Simple, direct and efficient multi-way spectral clustering
From MaRDI portal
Publication:5242868
DOI10.1093/imaiai/iay008zbMath1475.62184arXiv1609.08251OpenAlexW2811066984WikidataQ129969198 ScholiaQ129969198MaRDI QIDQ5242868
Lexing Ying, Anil Damle, Victor Minden
Publication date: 7 November 2019
Published in: Information and Inference: A Journal of the IMA (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.08251
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of graph theory (05C90) Inference from stochastic processes and spectral analysis (62M15)
Related Items (6)
Multiway Spectral Graph Partitioning: Cut Functions, Cheeger Inequalities, and a Simple Algorithm ⋮ A Spectral Method for Joint Community Detection and Orthogonal Group Synchronization ⋮ Spectral Embedding Norm: Looking Deep into the Spectrum of the Graph Laplacian ⋮ Uniform Bounds for Invariant Subspace Perturbations ⋮ Distance preserving model order reduction of graph-Laplacians and cluster analysis ⋮ Network Interpolation
This page was built for publication: Simple, direct and efficient multi-way spectral clustering