Approximate normalized cuts without eigen-decomposition

DOI10.1016/j.ins.2016.09.032zbMath1428.68241OpenAlexW2519127091MaRDI QIDQ2282282

Shifei Ding, Yu Xue, Ming-Jing Du, HongJie Jia

Publication date: 7 January 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2016.09.032

zbMATH Keywords

matrix tracenormalized cutapproximate kernel matrixweighted kernel \(k\)-means

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

GraphLSHC: towards large scale spectral hypergraph clustering

Uses Software

• Graclus

Cites Work

• Unnamed Item
• Unnamed Item
• Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs
• Simple graphs in granular computing
• Fuzzy nonlinear regression analysis using a random weight network
• Spectral redemption in clustering sparse networks