Auto-weighted Graph Reconstruction for efficient ensemble clustering
Authors:
- Xiaojun YangXYXiaojun Yang
- Weihao ZhaoWZWeihao Zhao
- Jing WangJWJing Wang
- Siyuan PengSPSiyuan Peng
- Feiping NieFNFeiping Nie
- 20 September 2024
- journal article
- research article
- Published by Elsevier in Information Sciences
- Vol. 689
Abstract
No abstract availableKeywords
Funding Information
- Guangzhou Municipal Science and Technology Project (202206010104)
- National Natural Science Foundation of China (62373112, 62306080)
This publication has 29 references indexed in Scilit:
- Anchor-based fast spectral ensemble clusteringInformation Fusion, 2024
- Sparse K-means clustering algorithm with anchor graph regularizationInformation Sciences, 2024
- Ensemble clustering via fusing global and local structure informationExpert Systems with Applications, 2023
- Clustering ensemble via structured hypergraph learningInformation Fusion, 2022
- A multiple k-means clustering ensemble algorithm to find nonlinearly separable clustersInformation Fusion, 2020
- Scalable spectral ensemble clustering via building representative co-association matrixNeurocomputing, 2020
- Ensemble clustering based on dense representationNeurocomputing, 2019
- Ensemble clustering based on evidence extracted from the co-association matrixPattern Recognition, 2019
- A clustering ensemble: Two-level-refined co-association matrix with path-based transformationPattern Recognition, 2015
- On voting-based consensus of cluster ensemblesPattern Recognition, 2010