Spectral methods for graph clustering - a survey
From MaRDI portal
Publication:713095
DOI10.1016/J.EJOR.2010.08.012zbMATH Open1250.68228DBLPjournals/eor/NascimentoC11OpenAlexW2161494102WikidataQ57739688 ScholiaQ57739688MaRDI QIDQ713095FDOQ713095
Recommendations
Cites work
- scientific article; zbMATH DE number 5957371 (Why is no real title available?)
- scientific article; zbMATH DE number 3862930 (Why is no real title available?)
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 3002629 (Why is no real title available?)
- scientific article; zbMATH DE number 781814 (Why is no real title available?)
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- A survey of kernel and spectral methods for clustering
- An r-Dimensional Quadratic Placement Algorithm
- Cluster analysis and mathematical programming
- Complex networks: structure and dynamics
- Consistency of spectral clustering
- Graph clustering
- Lower Bounds for the Partitioning of Graphs
- Machine Learning: ECML 2004
- Open problems of Paul Erd�s in graph theory
- Semidefinite spectral clustering
- Spectral embedding of graphs.
- Spectral partitioning with multiple eigenvectors
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 no real title available?)
- 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 no real title available?)
- Title not available (Why is no real title available?)
- 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 no real title available?)
- Clustering and community detection in directed networks: a survey
- Title not available (Why is no real title available?)
- 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
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)
