Joint consensus kernel learning and adaptive hypergraph regularization for graph-based clustering

DOI10.1016/J.INS.2024.121468MaRDI QIDQ6658978zbMATH OpenFDO

Authors Ju Niu, Yuhui du

Publication date 8 January 2025

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.INS.2024.121468

zbMATH Keywords

adaptive hypergraph Laplacian regularizerconsensus kernel learninghypergraphself-expressiveness

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Recommendations

• Robust multi-view clustering with hyper-Laplacian regularization
• Learning a consensus affinity matrix for multi-view clustering via subspaces merging on Grassmann manifold
• Exact \(k\)-component graph learning for image clustering
• Mutual structure learning for multiple kernel clustering
• Cluster structure augmented deep nonnegative matrix factorization with low-rank tensor learning

Cites work

• Algorithm AS 136: A K-Means Clustering Algorithm
• Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Graph Regularized Sparse Coding for Image Representation
• Implicit Block Diagonal Low-Rank Representation
• Structure preserving projections learning via low-rank embedding for image classification

Cited in

(1)

• Robust clustering with adaptive order graph learning

This page was built for publication: Joint consensus kernel learning and adaptive hypergraph regularization for graph-based clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6658978)