Discrepancy minimizing spectral clustering

DOI10.1016/j.dam.2018.02.016zbMath1387.05144OpenAlexW2791514214WikidataQ130087675 ScholiaQ130087675MaRDI QIDQ1752470

Ahmed Elbanna, Marianna Bolla

Publication date: 24 May 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.02.016

zbMATH Keywords

\(k\)-means clusteringspectral subspacesmultiway discrepancynormalized adjacency matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Three conjectures of Ostrander on digraph Laplacian eigenvectors ⋮ Generalized quasirandom properties of expanding graph sequences

Cites Work

• Relating multiway discrepancy and singular values of nonnegative rectangular matrices
• Using discrepancy to control singular values for nonnegative matrices
• Lifts, discrepancy and nearly optimal spectral gap
• Matrix and discrepancy view of generalized random and quasirandom graphs
• Eigenvalues and expanders
• Hermitian matrices and graphs: Singular values and discrepancy
• Generalized quasirandom graphs
• Dense expanders and pseudo-random bipartite graphs
• Spectral Clustering and Biclustering
• Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
• The effectiveness of lloyd-type methods for the k-means problem
• Quasi-random graphs
• Unnamed Item
• Unnamed Item