Block spectral clustering methods for multiple graphs.

DOI10.1002/NLA.2075MaRDI QIDQ5271011zbMATH OpenOpenAlexFDO

Authors Chuan Chen, Michael Ng, Shuqin Zhang

Publication date 3 July 2017

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.2075

zbMATH Keywords

clustering of multiple graphseigenvalueseigenvectorsmultiple graphs cutspectral clustering

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Spectral methods for graph clustering - a survey
• Multiple graphs clustering by gradient flow method
• Spectral clustering and its use in bioinformatics
• Spectral clustering and block models: a review and a new algorithm
• Latent Clustering on Graphs with Multiple Edge Types

Cites work

• Clustering With Multi-Layer Graphs: A Spectral Perspective
• Mixed membership stochastic blockmodels

Cited in

(3)

• Multiple graphs clustering by gradient flow method
• Spectral clustering via sparse graph structure learning with application to proteomic signaling networks in cancer
• Implicit consensus clustering from multiple graphs

Describes a project that uses

Uses Software

• MultiVis

This page was built for publication: Block spectral clustering methods for multiple graphs.

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