Combination of different clustering algorithms

Data clustering is an important task and has found applications in numerous real-world problems. Since no single clustering algorithm is able to identify all different types of cluster shapes and structures, ensemble clustering was proposed to combine different partitions of the same data generated by multiple clustering algorithms. The key idea of most ensemble clustering algorithms is to find a partition that is consistent with most of the available partitions of the input data. One problem with these algorithms is their inability to handle uncertain data pairs, i.e. data pairs for which about half of the partitions put them into the same cluster and the other half do the opposite. When the number of uncertain data pairs is large, they can mislead the ensemble clustering algorithm in generating the final partition. To overcome this limitation, we propose an ensemble clustering approach based on the technique of matrix completion. The proposed algorithm constructs a partially observed similarity matrix based on the data pairs whose cluster memberships are agreed upon by most of the clustering algorithms in the ensemble. It then deploys the matrix completion algorithm to complete the similarity matrix. The final data partition is computed by applying an efficient spectral clustering algorithm to the completed matrix. Our empirical studies with multiple real-world datasets show that the proposed algorithm performs significantly better than the state-of-the-art algorithms for ensemble clustering.

The localization accuracy of a fingerprint-based localization system is dependent on several factors, one of which is the accuracy and efficiency at which the fingerprint database is clustered. Most highly efficient and accurate clustering algorithms have high time-dependent computational complexity (CC), which tends to limit their practical applicability. A technique that has yet to be explored is the sequential hybridization of multiple low-time CC clustering algorithms to produce a single moderate-time CC clustering algorithm with high localization accuracy. As a result, this paper proposes a clustering algorithm with a moderate time CC that is based on the sequential hybridization of the closest access point (CAP) and improved k-means clustering algorithms. The performance of the proposed sequential hybrid clustering algorithm is determined and compared to the modified affinity propagation clustering (m-APC), fuzzy c-mean (FCM), and 2-CAP algorithms presented in earlier research works using four experimentally generated and publicly available fingerprint databases. The performance metrics considered for the comparisons are the position root mean square error (RMSE) and clustering time based on big O notation. The simulation results show that the proposed sequential hybrid clustering algorithm has improved localization accuracy with position RMSEs of about 54%, 77%, and 52%, respectively, higher than those of the m-APC, FCM, and 2-CAP algorithms. In terms of clustering time, it is 99% and 79% faster than the m-APC and FCM algorithms, respectively, but 90% slower than the 2-CAP algorithm. The results have shown that it is possible to develop a clustering algorithm that has a moderate clustering time with very high localization accuracy through sequential hybridization of multiple clustering algorithms that have a low clustering time with poor localization accuracy. Doi: 10.28991/ESJ-2024-08-02-02 Full Text: PDF

Each clustering algorithm usually optimizes a qualification metric during its learning process. The qualification metric in traditional clustering algorithms considers all the features of under-consideration dataset equally; it means each feature participates in the clustering process equivalently. Considering that some features have more information than the others in a dataset (due to their lower information or their higher variances, etc.), we proposes a fuzzy weighted clustering algorithm. We name this new clustering algorithm, Fuzzy Weighted Locally Adaptive Clustering (FWLAC) algorithm. The proposed FWLAC algorithm is capable of handling imbalanced clustering. However, FWLAC algorithm suffers from its sensitivity to the two parameters that should be tuned manually. The performance of FWLAC algorithm is affected by well-tuning of its parameters. So the paper proposes two solutions to well-tuning of its two parameters. In the first solution, we propose a simple clustering ensemble framework to show the sensitivity of the WLAC algorithm to its manual well-tuning. Although it is not a try-and-error procedure, it is like a grid search, where we use different pairs of values for both parameters h 1 and h 2. Per each pair of values for parameters h 1 and h 2, the algorithm produces a partitioning. So after the grid search, we obtain a large number of partitionings. We break any of the partitionings into its clusters, and then they form an ensemble of clusters. Finally the consensus partitioning is extracted from them by a consensus function. The algorithm is not data dependent at all. For all datasets, we use a similar grid search and a similar set of values for the parameters h 1 and h 2. In this way we have proposed an alternative solution to parameter selection. We use a selection phase to select/remove some clusters from our ensemble of clusters to obtain an elite ensemble of clusters. To do this, a stability measure, normalized mutual information (NMI), was used to validate a cluster. The paper shows the effectiveness of the proposed clustering frameworks both theoretically and experimentally.

Use of a fuzzy granulation–degranulation criterion for assessing cluster validity

The classic Fuzzy C-means (FCM) algorithm has limited clustering performance and is prone to misclassification of border points. This study offers a bi-directional FCM clustering ensemble approach that takes local information into account (LI_BIFCM) to overcome these challenges and increase clustering quality. First, various membership matrices are created after running FCM multiple times, based on the randomization of the initial cluster centers, and a vertical ensemble is performed using the maximum membership principle. Second, after each execution of FCM, multiple local membership matrices of the sample points are created using multiple K-nearest neighbors, and a horizontal ensemble is performed. Multiple horizontal ensembles can be created using multiple FCM clustering. Finally, the final clustering results are obtained by combining the vertical and horizontal clustering ensembles. Twelve data sets were chosen for testing from both synthetic and real data sources. The LI_BIFCM clustering performance outperformed four traditional clustering algorithms and three clustering ensemble algorithms in the experiments. Furthermore, the final clustering results has a weak correlation with the bi-directional cluster ensemble parameters, indicating that the suggested technique is robust.

The link-based cluster ensemble (LCE) method is applied to a high resolution satellite precipitation estimation (HSPE) algorithm, a modified form of the Precipitation Estimation from Remotely Sensed Imagery using an Artificial Neural Network Cloud Classification (PERSIANN-CCS) algorithm. The HSPE involves the following four steps: (1) segmentation of infrared cloud images into patches; (2) cloud patch feature extraction; (3) clustering and classification of cloud patches using cluster ensemble technique; and (4) dynamic application of brightness temperature (Tb) and rain rate relationships, derived using satellite observations. The LCE method combines multiple data partitions from different clustering in order to cluster the cloud patches. The results show that using the cluster ensemble increase the performance of rainfall estimates if compared to the HSPE algorithm using Self Organizing Map (SOM). The Heidke Skill Score (HSS) is improved 5% to 7% at medium and high level of rainfall thresholds.

Evaluation measures for cluster ensembles based on a fuzzy generalized Rand index

Clustering ensemble is an open proposition that aims to solve the limitation of a single cluster algorithm on the diversity of data structures in data partitions. It obtains a consensus model by integrating multiple clustering algorithms. Compared with a single clustering algorithm, it can process the data more accurately and stably, and has a better tolerance for the structure and diversity of the data. This paper proposes to integrate particle swarm optimization for clustering ensemble model. Particularly, the idea is to first use multiple classic clustering algorithms to cluster the original data set to obtain a preliminary clustering result set, and then search for a clustering result that is most consistent with the preliminary results by a particle swarm optimization procedure. In the experiments, we make use of public data sets and micro-precision to evaluate the effectiveness of the proposed clustering ensemble model, and compare it with both base clustering algorithms and other common clustering ensemble algorithms. The evaluation results show that this model can significantly improve the base clustering algorithms and outperforms common clustering ensemble algorithms in most cases.

In this work, a new image segmentation algorithm is introduced. The proposed algorithm combines the results of an hybrid clustering ensemble. The ensemble clustering is composed of fuzzy c-means (FCM) algorithm and fuzzy local information c-means (FCM_S1 and FCM_S2) algorithms with different values of the neighbors effect. The consensus technique is performed by the ordered weighted averaging (OWA) method. The weight attributed to each classifier can be modified during the process of classification and is determined by the classifier results of the pixel neighbors classification. Dynamic weights give the method the ability to select the temporal best performance during the classification process. Experiments performed on a synthetic image, and real images show that the proposed algorithm is effective and efficient and provides good noise elimination effect.

Region-of-interest extraction in low depth of field images using ensemble clustering and difference of Gaussian approaches

Big data is technology that has the ability to manage very large amounts of data, in very fast time to allow real-time analysis and reactions. Several clustering methods which are used to group data are Fuzzy C-Means (FCM) and K-Means Clustering. K-Means Clustering algorithm is a method of partitioning existing data into two or more group. This research goal was to compare the performance of K-Means and Fuzzy C-Means algorithms in clustering data using big data technology. In this research, Hadoop and Hive were chosen the big data technology. The knowledge of Shia history on student and lecturer of Syarif Hidayatullah State Islamic University Jakarta were the data which used in this research, The testing was done by constructing application K-Means Fuzzy C-Means using Java language, Hadoop and Hive and then test the performance of K-Means and Fuzzy C-Means algorithms in data clustering. It compares both algorithms in terms of accuracy, execution time, and time complexity of the algorithms. In the application K-Means Fuzzy C-Means, evaluation were performed with data filter and the average accuracy difference result of K-Means and Fuzzy C-Means is 8.03% with the better accuracy owned by K-Means. The average execution time difference is 718.58 ms, which K-Means was faster than is Fuzzy C-Means. The time complexities of both algorithms have the same value O(n2) and the Big O equation resulted in an average difference of 93,568 with the smallest value on K-Means. Thus, K-Means algorithm is better than the Fuzzy C-Means in terms of accuracy, execution time, and the time complexity.

Ensemble clustering has made significant progress in improving clustering performance by integrating multiple basic partitions. However, the conventional ensemble clustering methods rarely combine the rich information from both basic partitions and feature space comprehensively and efficiently. Facing the limitation, we design an Ensemble Clustering Based on Manifold Broad Learning System (EC-MBLS) in this paper. EC-MBLS firstly constructs a fuzzy partition matrix to capture the cluster-wise similarities from basic partitions. Then a manifold broad learning system (MBLS) is designed to learn a better consensus partition, which is guided by the global cluster structure of data and constrained by the local affinity of data. An efficient solution is finally provided to optimize the MBLS. Compared with the state-of-the-art ensemble clustering methods, experiments on multiple real-world clustering tasks are carried out to demonstrate the effectiveness of EC-MBLS.

MotivationThe advent of highly multiplexed in situ imaging cytometry assays has revolutionized the study of cellular systems, offering unparalleled detail in observing cellular activities and characteristics. These assays provide comprehensive insights by concurrently profiling the spatial distribution and molecular features of numerous cells. In navigating this complex data landscape, unsupervised machine learning techniques, particularly clustering algorithms, have become essential tools. They enable the identification and categorization of cell types and subsets based on their molecular characteristics. Despite their widespread adoption, most clustering algorithms in use were initially developed for cell suspension technologies, leading to a potential mismatch in application. There is a critical gap in the systematic evaluation of these methods, particularly in determining the properties that make them optimal for in situ imaging assays. Addressing this gap is vital for ensuring accurate, reliable analyses and fostering advancements in cellular biology research.ResultsIn our extensive investigation, we evaluated a range of similarity metrics, which are crucial in determining the relationships between cells during the clustering process. Our findings reveal substantial variations in clustering performance, contingent on the similarity metric employed. These variations underscore the importance of selecting appropriate metrics to ensure accurate cell type and subset identification. In response to these challenges, we introduce FuseSOM, a novel ensemble clustering algorithm that integrates hierarchical multiview learning of similarity metrics with self-organizing maps. Through a rigorous stratified subsampling analysis framework, we demonstrate that FuseSOM outperforms existing best-practice clustering methods specifically tailored for in situ imaging cytometry data. Our work not only provides critical insights into the performance of clustering algorithms in this novel context but also offers a robust solution, paving the way for more accurate and reliable in situ imaging cytometry data analysis.Availability and implementationThe FuseSOM R package is available on Bioconductor and is available under the GPL-3 license. All the codes for the analysis performed can be found at Github.

Ant clustering algorithm with K-harmonic means clustering

This series of studies aims to propose the automatic machine embroidery image color analysis system to solve the problem of lack of manpower for machine embroidery fabric drafting and to shorten drafting time. The studies included three parts: (1) machine embroidery image color separation, (2) search of repeated pattern images, (3) machine embroidery color analysis system integration. This study aimed to find the optimal clustering algorithm and cluster validity indices for the automatic color separation process of machine embroidery fabric drafting in order to shorten drafting time. To improve image quality for computer analysis, this study used the color hybrid median filter to filter noise and the color bilateral filter to smoothen fabric and embroidery texture for subsequent color separation. By extracting the color a* component and b* component of the machine embroidery image in CIE L*a*b* color system, this study used the Gustafson-Kessel clustering algorithm for color separation. The Gustafson-Kessel clustering algorithm in machine embroidery image color separation can improve color separation accuracy, and its result is compared with that of the clustering algorithms commonly used in the color separation of color images. This study implemented the chromatography of the color separation results, and used the cluster validity indices to prove that the application of Gustafson-Kessel clustering algorithm in the machine embroidery image color separation system has better results than K-means, K-medoid, fuzzy C-means (FCM), and self-organizing map (SOM) clustering algorithm. The results meet the classifications as expected by human eyes.