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.
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: