On clusterings: good, bad and spectral
From MaRDI portal
Publication:3583579
Recommendations
Cited in
(84)- Spectral Clustering by Recursive Partitioning
- Dynamic Graph Clustering Using Minimum-Cut Trees
- A survey of kernel and spectral methods for clustering
- The small-community phenomenon in networks
- From graph cuts to isoperimetric inequalities: convergence rates of Cheeger cuts on data clouds
- Finding and using expanders in locally sparse graphs
- Community detection based on network communicability
- Consistency of spectral clustering
- A decentralized algorithm for spectral analysis
- Maximizing edge-ratio is NP-complete
- Graph clustering
- Graph partitioning via adaptive spectral techniques
- Mean curvature, threshold dynamics, and phase field theory on finite graphs
- A Cheeger-type inequality on simplicial complexes
- The Small Community Phenomenon in Networks: Models, Algorithms and Applications
- Graph Clustering using Effective Resistance
- Well-mixing vertices and almost expanders
- Algorithmic extensions of Cheeger's inequality to higher eigenvalues and partitions
- Randomized approximation schemes for cuts and flows in capacitated graphs
- Structural similarity: spectral methods for relaxed blockmodeling
- Community detection by resistance distance: automation and benchmark testing
- Cluster forests
- Improved row-by-row method for binary quadratic optimization problems
- Clustering with \(r\)-regular graphs
- Mean shift spectral clustering
- Optimality of spectral clustering in the Gaussian mixture model
- Frequency-based views to pattern collections
- Mixed Hölder matrix discovery via wavelet shrinkage and Calderón-Zygmund decompositions
- Nonlocal-interaction equation on graphs: gradient flow structure and continuum limit
- Fuzzy spectral clustering by PCCA+: application to Markov state models and data classification
- Go with the flow, on Jupiter and snow. Coherence from model-free video data without trajectories
- Spectral concentration and greedy \(k\)-clustering
- SpectralCAT: categorical spectral clustering of numerical and nominal data
- Clustering and outlier detection using isoperimetric number of trees
- Density-constrained graph clustering
- Spectral clustering based on local linear approximations
- Grouping objects in multi-band images using an improved eigenvector-based algorithm
- Mixed-case community detection problem in social networks: algorithms and analysis
- Improved spectral-norm bounds for clustering
- Convex programming based spectral clustering
- Spectral clustering and its use in bioinformatics
- Spectral clustering based on matrix perturbation theory
- Asymptotic regularity of subdivisions of Euclidean domains by iterated PCA and iterated 2-means
- Kernel spectral clustering with memory effect
- Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data
- Multiway spectral clustering: a margin-based perspective
- Spectral clustering revisited: information hidden in the Fiedler vector
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
- Automatically finding clusters in normalized cuts
- A spectral clustering-based framework for detecting community structures in complex networks
- Structure- and Physics-Preserving Reductions of Power Grid Models
- An ideal point based many-objective optimization for community detection of complex networks
- Cortical spatiotemporal dimensionality reduction for visual grouping
- Estimating perimeter using graph cuts
- Multicuts and perturb \& MAP for probabilistic graph clustering
- Diffusion operator and spectral analysis for directed hypergraph Laplacian
- Finding large \(k\)-clubs in undirected graphs
- Soft memberships for spectral clustering, with application to permeable language distinction
- Lower bounds on paraclique density
- Good clusterings have large volume
- Memetic graph clustering
- 3D human posture segmentation by spectral clustering with surface normal constraint
- Partitioning well-clustered graphs: spectral clustering works!
- Tree-based coarsening and partitioning of complex networks
- Hierarchical Community Detection by Recursive Partitioning
- Guaranteed clustering and biclustering via semidefinite programming
- On the Paley graph of a quadratic character
- Probabilistic correlation clustering and image partitioning using perturbed multicuts
- Local flow partitioning for faster edge connectivity
- Incremental methods for community detection in both fully and growing dynamic networks
- Finding large expanders in graphs: from topological minors to induced subgraphs
- On a class of nonlocal continuity equations on graphs
- Testing higher-order clusterability on graphs
- Spatial regression and estimation of disease risks: A clustering‐based approach
- Mining representative subset based on fuzzy clustering
- Good (K-means) clusterings are unique (up to small perturbations)
- Community detection via a triangle and edge combination conductance partitioning
- Graph ambiguity
- Group-Level Analysis and Visualization of Social Networks
- Bounded confidence opinion dynamics: a survey
- The maximum community partition problem in networks
- Improving spectral bounds for clustering problems by Lagrangian relaxation
- Networks synchronizability, local dynamics and some graph invariants
- Hypergraph clustering using a new Laplacian tensor with applications in image processing
This page was built for publication: On clusterings: good, bad and spectral
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3583579)
