Spectral methods for graph clustering - a survey

DOI10.1016/j.ejor.2010.08.012zbMath1250.68228OpenAlexW2161494102WikidataQ57739688 ScholiaQ57739688MaRDI QIDQ713095

Mariá C. V. Nascimento, André C. P. L. F. de Carvalho

Publication date: 26 October 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.08.012

zbMATH Keywords

modularityspectral clusteringratio cutmin-cut\(n\)-cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

New inequalities for network distance measures by using graph spectra ⋮ Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering ⋮ Community detection in networks via a spectral heuristic based on the clustering coefficient ⋮ Improving the non‐compensatory trace‐clustering decision process ⋮ Reconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricing ⋮ A reductive approach to hypergraph clustering: an application to image segmentation ⋮ Path Laplacian matrices: introduction and application to the analysis of consensus in networks ⋮ Extending bootstrap AMG for clustering of attributed graphs ⋮ Modularity revisited: a novel dynamics-based concept for decomposing complex networks ⋮ Unnamed Item ⋮ Clustering and community detection in directed networks: a survey ⋮ Dominant-set clustering: a review ⋮ Polyhedral properties of the induced cluster subgraphs ⋮ Bipartite communities via spectral partitioning ⋮ On conjectures of network distance measures by using graph spectra ⋮ Construction of the similarity matrix for the spectral clustering method: numerical experiments ⋮ On some properties of the Laplacian matrix revealed by the RCM algorithm ⋮ Variable neighborhood search for minimum sum-of-squares clustering on networks

Uses Software

• LAPACK
• SpectralNET

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph clustering
• Spectral partitioning with multiple eigenvectors
• Cluster analysis and mathematical programming
• Spectral embedding of graphs.
• A survey of kernel and spectral methods for clustering
• Complex networks: structure and dynamics
• Consistency of spectral clustering
• Semidefinite spectral clustering
• [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
• Machine Learning: ECML 2004
• An r-Dimensional Quadratic Placement Algorithm
• Lower Bounds for the Partitioning of Graphs

This page was built for publication: Spectral methods for graph clustering - a survey