Robust multi-view clustering with hyper-Laplacian regularization

DOI10.1016/J.INS.2024.121718MaRDI QIDQ6669281zbMATH OpenFDO

Authors Xiao Yu, Hui Liu, Yan Zhang, Yuan Gao, Caiming Zhang

Publication date 22 January 2025

Published in Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

auto-weighted schemehypergraphLaplacian matrixmulti-view clusteringrobustness

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Multi-view clustering with graph regularized optimal transport
• Multiview clustering via robust neighboring constraint nonnegative matrix factorization
• Tensor double arc-tangent norm minimization for multi-view clustering
• Deep low-rank subspace ensemble for multi-view clustering
• Multi-view spectral clustering via robust local subspace learning

Cites work

• Fine-grained similarity fusion for multi-view spectral clustering
• Robust multi-view non-negative matrix factorization with adaptive graph and diversity constraints
• Robust Subspace Clustering for Multi-View Data by Exploiting Correlation Consensus
• Sample-level weights learning for multi-view clustering on spectral rotation
• Semi-supervised multi-view clustering based on orthonormality-constrained nonnegative matrix factorization

Cited in

(4)

• Multi-view clustering with graph regularized optimal transport
• Tensor double arc-tangent norm minimization for multi-view clustering
• Enhanced tensor based embedding anchor learning for multi-view clustering
• Joint consensus kernel learning and adaptive hypergraph regularization for graph-based clustering

This page was built for publication: Robust multi-view clustering with hyper-Laplacian regularization

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