Enforced Block Diagonal Graph Learning for Multikernel Clustering

The existing multikernel graph clustering (MKGC) methods have emerged with notable success on nonlinear clustering tasks since the graph learning can effectively capture graph structure similarity between sample pair. Ideally, a high-quality graph should enjoy the good block diagonal property, i.e. the intercluster similarities correspond to zeros, while intracluster similarities represent nonzeros. Meanwhile, the number of diagonal blocks for a graph equals to the number of clusters on the dataset. However, most of the existing MKGC methods design a corpulent three-parts graph leaning process that poses challenges for hyperparameter tuning, time cost, and clustering performance. To overcome these challenging issues, we propose an enforced block diagonal graph learning for multikernel clustering (EBDGL-MKC) method, where we pursue a high-quality block diagonal graph via well-designed one-part graph leaning scheme rather than three parts. Inspired by symmetric matrix factorization (SMF), we first design a one-part block diagonal graph learning scheme to learn multiple block diagonal graphs, by exploring an explicit theoretical connection between the clustering partition of kernel $k$ -means and the excellent block diagonal graph. Then, these block diagonal graphs are stacked into a low-rank tensor for exploiting the high-order structure information hidden in the nonlinear data. After that, an effective alternate algorithm with convergence proof is performed on extensive experiments to demonstrate the superiority of EBDGL compared with the state-of-the-art multikernel clustering (MKC) methods

Cluster analysis · Combinatorics · Diagonal · Graph · Graph partition · Advanced Graph Neural Networks · Complex Network Analysis Techniques · Computer Science · Mathematics · Recommender Systems and Techniques · Artificial Intelligence · Theoretical Computer Science

• Convex Optimization

  Open Access•Sally Boyd, Stephen Boyd et al.•Convex Optimization•2004

  Add to list

• Multigraph Random Walk for Joint Learning of Multiview Clustering and Semisupervised Classification

  Open Access•Shiping Wang, Lele Fu et al.•IEEE Transactions on Computational…•2022

  Add to list

• Graph Regularized Sparse Non-Negative Matrix Factorization for Clustering

  Open Access•Ping Deng, Tianrui Li et al.•IEEE Transactions on Computational…•2023

  Add to list

• Sparse Pinball Twin Bounded Support Vector Clustering

  Open Access•M Tanveer, M Tabish et al.•IEEE Transactions on Computational…•2022

  Add to list

• Discovering Density-Based Clustering Structures Using Neighborhood Distance Entropy Consistency

  Open Access•Tahereh Kamali, Daniel W Stashuk•IEEE Transactions on Computational…•2020

  Add to list