Spectral methods for graph clustering - a survey

DOI10.1016/J.EJOR.2010.08.012zbMATH Open1250.68228DBLPjournals/eor/NascimentoC11OpenAlexW2161494102WikidataQ57739688 ScholiaQ57739688MaRDI QIDQ713095FDOQ713095

Authors: 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

Recommendations

• scientific article; zbMATH DE number 2043367
• Spectral clustering and its use in bioinformatics
• A survey of kernel and spectral methods for clustering
• Partitioning well-clustered graphs: spectral clustering works!
• Spectral clustering and block models: a review and a new algorithm

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Complex networks: structure and dynamics
• Title not available (Why is that?)
• Graph clustering
• Consistency of spectral clustering
• Title not available (Why is that?)
• Cluster analysis and mathematical programming
• Title not available (Why is that?)
• Machine Learning: ECML 2004
• A survey of kernel and spectral methods for clustering
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Open problems of Paul Erd�s in graph theory
• Lower Bounds for the Partitioning of Graphs
• Semidefinite spectral clustering
• An r-Dimensional Quadratic Placement Algorithm
• Spectral partitioning with multiple eigenvectors
• Spectral embedding of graphs.
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (42)

• Community detection in networks via a spectral heuristic based on the clustering coefficient
• Path Laplacian matrices: introduction and application to the analysis of consensus in networks
• Dominant-set clustering: a review
• A reductive approach to hypergraph clustering: an application to image segmentation
• An auto-weighted enhanced horizontal collaborative fuzzy clustering algorithm with knowledge adaption mechanism
• Spectral algorithms
• Data clustering based on the modified relaxation Cheeger cut model
• Spectral clustering based on matrix perturbation theory
• A graph spectrum based geometric biclustering algorithm
• New inequalities for network distance measures by using graph spectra
• Graph spectral techniques in computer sciences
• Polyhedral properties of the induced cluster subgraphs
• Title not available (Why is that?)
• Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering
• Convex programming based spectral clustering
• Sparse spectral clustering method based on the incomplete Cholesky decomposition
• Title not available (Why is that?)
• Title not available (Why is that?)
• On some properties of the Laplacian matrix revealed by the RCM algorithm.
• Regularity-based spectral clustering and mapping the Fiedler-carpet
• Bipartite communities via spectral partitioning
• A spectral approach to clustering numerical vectors as nodes in a network
• On conjectures of network distance measures by using graph spectra
• Block spectral clustering methods for multiple graphs.
• Improving the non‐compensatory trace‐clustering decision process
• On the eigenvectors of \(p\)-Laplacian
• A survey of kernel and spectral methods for clustering
• Modularity revisited: a novel dynamics-based concept for decomposing complex networks
• A distributed algorithm for spectral sparsification of graphs with applications to data clustering
• Reconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricing
• Robust asymmetric non-negative matrix factorization for clustering nodes in directed networks
• Spectral clustering
• Spectral clustering and biclustering. Learning large graphs and contingency tables
• Automatic determination of clusters
• Title not available (Why is that?)
• Clustering and community detection in directed networks: a survey
• Title not available (Why is that?)
• Study on the determination and application of the cluster number of images based on spectral graph theory
• Extending bootstrap AMG for clustering of attributed graphs
• Construction of the similarity matrix for the spectral clustering method: numerical experiments
• Koopman-based spectral clustering of directed and time-evolving graphs
• Variable neighborhood search for minimum sum-of-squares clustering on networks

Uses Software

• LAPACK
• SpectralNET

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

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