On clusterings

DOI10.1145/990308.990313zbMath1192.05160OpenAlexW2034331023WikidataQ29999158 ScholiaQ29999158MaRDI QIDQ3583579

Adrian Vetta, Ravindran Kannan, Santosh Vempala

Publication date: 17 August 2010

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/990308.990313

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (75)

Hierarchical Community Detection by Recursive Partitioning ⋮ Well-mixing vertices and almost expanders ⋮ The small-community phenomenon in networks ⋮ Spectral concentration and greedy \(k\)-clustering ⋮ Structural similarity: spectral methods for relaxed blockmodeling ⋮ The Small Community Phenomenon in Networks: Models, Algorithms and Applications ⋮ From graph cuts to isoperimetric inequalities: convergence rates of Cheeger cuts on data clouds ⋮ Networks Synchronizability, Local Dynamics and Some Graph Invariants ⋮ Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data ⋮ A survey of kernel and spectral methods for clustering ⋮ Multicuts and perturb \& MAP for probabilistic graph clustering ⋮ Spectral clustering based on matrix perturbation theory ⋮ Fuzzy spectral clustering by PCCA+: application to Markov state models and data classification ⋮ Mixed Hölder matrix discovery via wavelet shrinkage and Calderón-Zygmund decompositions ⋮ Kernel spectral clustering with memory effect ⋮ Grouping objects in multi-band images using an improved eigenvector-based algorithm ⋮ Spectral clustering and its use in bioinformatics ⋮ Computing heat kernel PageRank and a local clustering algorithm ⋮ A Cheeger-type inequality on simplicial complexes ⋮ Clustering and outlier detection using isoperimetric number of trees ⋮ Finding large expanders in graphs: from topological minors to induced subgraphs ⋮ Consistency of spectral clustering ⋮ 3D human posture segmentation by spectral clustering with surface normal constraint ⋮ Finding and Using Expanders in Locally Sparse Graphs ⋮ Multiway spectral clustering: a margin-based perspective ⋮ SpectralCAT: categorical spectral clustering of numerical and nominal data ⋮ Graph clustering ⋮ Cortical Spatiotemporal Dimensionality Reduction for Visual Grouping ⋮ Graph ambiguity ⋮ Guaranteed clustering and biclustering via semidefinite programming ⋮ Mixed-case community detection problem in social networks: algorithms and analysis ⋮ Graph Clustering using Effective Resistance ⋮ Structure- and Physics-Preserving Reductions of Power Grid Models ⋮ An ideal point based many-objective optimization for community detection of complex networks ⋮ Hypergraph Clustering Using a New Laplacian Tensor with Applications in Image Processing ⋮ Probabilistic Correlation Clustering and Image Partitioning Using Perturbed Multicuts ⋮ Finding large \(k\)-clubs in undirected graphs ⋮ Graph Partitioning via Adaptive Spectral Techniques ⋮ Soft memberships for spectral clustering, with application to permeable language distinction ⋮ Mean shift spectral clustering ⋮ Mean curvature, threshold dynamics, and phase field theory on finite graphs ⋮ Partitioning Well-Clustered Graphs: Spectral Clustering Works! ⋮ Frequency-based views to pattern collections ⋮ Clustering with \(r\)-regular graphs ⋮ Nonlocal-interaction equation on graphs: gradient flow structure and continuum limit ⋮ Automatically finding clusters in normalized cuts ⋮ Go with the flow, on Jupiter and snow. Coherence from model-free video data without trajectories ⋮ Local Flow Partitioning for Faster Edge Connectivity ⋮ Incremental methods for community detection in both fully and growing dynamic networks ⋮ Generalizing the hypergraph Laplacian via a diffusion process with mediators ⋮ Mining representative subset based on fuzzy clustering ⋮ Asymptotic regularity of subdivisions of Euclidean domains by iterated PCA and iterated 2-means ⋮ Cluster forests ⋮ Dynamic Graph Clustering Using Minimum-Cut Trees ⋮ Convex programming based spectral clustering ⋮ Spatial regression and estimation of disease risks: A clustering‐based approach ⋮ Optimality of spectral clustering in the Gaussian mixture model ⋮ Algorithmic Extensions of Cheeger’s Inequality to Higher Eigenvalues and Partitions ⋮ A decentralized algorithm for spectral analysis ⋮ Community detection based on network communicability ⋮ Group-Level Analysis and Visualization of Social Networks ⋮ Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation ⋮ Experiments on Density-Constrained Graph Clustering ⋮ Maximizing edge-ratio is NP-complete ⋮ Estimating perimeter using graph cuts ⋮ A spectral clustering-based framework for detecting community structures in complex networks ⋮ Diffusion operator and spectral analysis for directed hypergraph Laplacian ⋮ Spectral clustering revisited: information hidden in the Fiedler vector ⋮ Improved row-by-row method for binary quadratic optimization problems ⋮ Community detection by resistance distance: automation and benchmark testing ⋮ Community detection via a triangle and edge combination conductance partitioning ⋮ Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs ⋮ Tree-Based Coarsening and Partitioning of Complex Networks ⋮ THE MAXIMUM COMMUNITY PARTITION PROBLEM IN NETWORKS ⋮ Memetic Graph Clustering

This page was built for publication: On clusterings