Survey of spectral clustering based on graph theory
Spectral clustering converts the data clustering problem to the graph cut problem. It is based
on graph theory. Due to the reliable theoretical basis and good clustering performance …
on graph theory. Due to the reliable theoretical basis and good clustering performance …
Anchor-based fast spectral ensemble clustering
Ensemble clustering can obtain better and more robust results by fusing multiple base
clusterings, which has received extensive attention. Although many representative …
clusterings, which has received extensive attention. Although many representative …
Binary label learning for semi-supervised feature selection
Semi-supervised feature selection methods jointly exploit the labelled and unlabelled
samples when selecting the features. Under the semi-supervised learning scenario, the …
samples when selecting the features. Under the semi-supervised learning scenario, the …
Algorithm 1038: KCC: A MATLAB Package for k-Means-based Consensus Clustering
Consensus clustering is gaining increasing attention for its high quality and robustness. In
particular, k-means-based Consensus Clustering (KCC) converts the usual computationally …
particular, k-means-based Consensus Clustering (KCC) converts the usual computationally …
Blockchain based federated learning for intrusion detection for Internet of Things
N Sun, W Wang, Y Tong, K Liu - Frontiers of Computer Science, 2024 - Springer
Abstract In Internet of Things (IoT), data sharing among different devices can improve
manufacture efficiency and reduce workload, and yet make the network systems be more …
manufacture efficiency and reduce workload, and yet make the network systems be more …
A Structured Bipartite Graph Learning method for ensemble clustering
Given a set of base clustering results, conventional bipartite graph-based ensemble
clustering methods typically require computing a sample-cluster similarity matrix from each …
clustering methods typically require computing a sample-cluster similarity matrix from each …
Double High-Order Correlation Preserved Robust Multi-View Ensemble Clustering
X Zhao, T Xu, Q Shen, Y Liu, Y Chen, J Su - ACM Transactions on …, 2023 - dl.acm.org
Ensemble clustering (EC), utilizing multiple basic partitions (BPs) to yield a robust
consensus clustering, has shown promising clustering performance. Nevertheless, most …
consensus clustering, has shown promising clustering performance. Nevertheless, most …
Gaussian gravitation for cluster ensembles
K Cong, J Yang, H Wang, L Tao - Knowledge-Based Systems, 2022 - Elsevier
Gravity-based clustering methods can effectively distinguish the differences between the
data points close to the center of a dataset and those on a class boundary. However, most …
data points close to the center of a dataset and those on a class boundary. However, most …
Enhanced Spectral Ensemble Clustering for Fault Diagnosis: Application to Photovoltaic Systems
The role of clustering in unsupervised fault diagnosis is significant, but different clustering
techniques can yield varied results and cause inevitable uncertainty. Ensemble clustering …
techniques can yield varied results and cause inevitable uncertainty. Ensemble clustering …
Multi-view Ensemble Clustering via Low-rank and Sparse Decomposition: From Matrix to Tensor
As a significant extension of classical clustering methods, ensemble clustering first
generates multiple basic clusterings and then fuses them into one consensus partition by …
generates multiple basic clusterings and then fuses them into one consensus partition by …