Robust clustering with adaptive order graph learning

DOI10.1016/J.INS.2023.119659MaRDI QIDQ6488766zbMATH OpenFDO

Authors Jiayi Tang, Yan Gao, Suqi Jia, Hui Feng

Publication date 19 October 2023

Published in Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

adaptive-order graph-learning strategynon-negative matrix factorizationrobust loss functionspectral clustering

Mathematics Subject Classification ID

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

Recommendations

• Robust local-coordinate non-negative matrix factorization with adaptive graph for robust clustering
• Robust graph regularized nonnegative matrix factorization for clustering
• Joint consensus kernel learning and adaptive hypergraph regularization for graph-based clustering
• Multiview clustering via robust neighboring constraint nonnegative matrix factorization
• Refined spectral clustering via embedded label propagation

Cites work

• An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices
• Learning the parts of objects by non-negative matrix factorization
• Statistical comparisons of classifiers over multiple data sets

Cited in

(2)

• Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs
• Robust local-coordinate non-negative matrix factorization with adaptive graph for robust clustering

This page was built for publication: Robust clustering with adaptive order graph learning

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