Enhancing Clustering Performance With Tensorized High-Order Bipartite Graphs: A Structured Graph Learning Approach
- 5 November 2024
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 35 (3) , 2616-2631
Abstract
Clustering based on structured graph learning involves acquiring a proximity matrix with an explicit clustering structure from the original one. However, the original proximity matrix often lacks some must-links compared to the groundtruth, constraining the upper bound of clustering performance. High-order proximity information can mitigate this limitation, yet traditional high-order proximity matrix-based methods are time-intensive. To tackle this, we propose the Tensorized High-order Bipartite Graphs-based structured proximity matrix learning method (THBG). Firstly, we introduce a high-order bipartite graph proximity matrix with a swift computation method, incorporating high-order information and significantly reducing computational overhead. Secondly, we apply tensor nuclear norm minimization to the tensor composed of high-order bipartite graphs, learning a low-rank tensor representation that effectively harnesses the consistency of high-order information. Concurrently, a structured bipartite graph proximity matrix with an explicit clustering structure is adaptively learned based on the low-rank tensor representation and Laplace rank constraint. Experimental results demonstrate the superiority and great potential of this method. Code available: https://anonymous.T4open.science/r/THBG-D10D.Keywords
Funding Information
- National Natural Science Foundation of China (62276212, 62406250)
- Fundamental Research Funds for the Central Universities
- Key Laboratory of Intelligent Equipment Application, Ministry of Education, Rocket Force University of Engineering
- Natural Science Basic Research Plan in Shaanxi Province of China (2023-JC-QN-0702)
This publication has 62 references indexed in Scilit:
- K-means clustering algorithms: A comprehensive review, variants analysis, and advances in the era of big dataInformation Sciences, 2022
- A comprehensive survey of clustering algorithms: State-of-the-art machine learning applications, taxonomy, challenges, and future research prospectsEngineering Applications of Artificial Intelligence, 2022
- Multi-dimensional clustering through fusion of high-order similaritiesPattern Recognition, 2022
- Multi-view Clustering with Latent Low-rank Proxy Graph LearningCognitive Computation, 2021
- High-order nonlocal Hashing for unsupervised cross-modal retrievalWorld Wide Web, 2021
- Motif discovery in networks: A surveyComputer Science Review, 2020
- Considerably Improving Clustering Algorithms Using UMAP Dimensionality Reduction Technique: A Comparative Study2020
- Factorization strategies for third-order tensorsLinear Algebra and its Applications, 2011
- The Hungarian Method for the Assignment Problem2009
- Graph theory in network analysisSocial Networks, 1983