An Ensemble of Locally Reliable Cluster Solutions

Abstract

Clustering ensemble indicates to an approach in which a number of (usually weak) base clusterings are performed and their consensus clustering is used as the final clustering. Knowing democratic decisions are better than dictatorial decisions, it seems clear and simple that ensemble (here, clustering ensemble) decisions are better than simple model (here, clustering) decisions. But it is not guaranteed that every ensemble is better than a simple model. An ensemble is considered to be a better ensemble if their members are valid or high-quality and if they participate according to their qualities in constructing consensus clustering. In this paper, we propose a clustering ensemble framework that uses a simple clustering algorithm based on kmedoids clustering algorithm. Our simple clustering algorithm guarantees that the discovered clusters are valid. From another point, it is also guaranteed that our clustering ensemble framework uses a mechanism to make use of each discovered cluster according to its quality. To do this mechanism an auxiliary ensemble named reference set is created by running several kmeans clustering algorithms.

Fuzzy clustering method to compare the spread rate of Covid-19 in the high risks countries

“…But these methods use hard clustering as base clustering algorithm. Recently soft clustering algorithms [27] have been popular and it has been shown that these methods are superior to traditional hard clustering algorithms [28] , [29] , [30] . We can use soft clustering and fuzzy clustering interchangeably.…”

VIRMOTIF: A User-Friendly Tool for Viral Sequence Analysis

“…Clustering of sequences is the process of bringing similar motifs together as a cluster. Different clustering approaches have been previously used to group biological and nonbiological data [ 17 , 18 , 19 , 20 ]. Clustering of sequences gives the user the ability to observe each group separately, identify similar patterns among samples in the same group, identify differences between different clusters, and find the most important motifs in each group.…”

A Multi-Object Simulated Annealing Approach to Identify Likely Functional Genomic Pairs

“…The value of the movement probability function is computed in every step from the relation exp(-ΔF/T). The difference between this equation and the object function is the value for the current and the new solution [26,29,30]. Theoretically, overcoming local optimization, the SA technique is able to find the absolute optimized solution.…”