Discrepancy minimizing spectral clustering

DOI10.1016/J.DAM.2018.02.016MaRDI QIDQ1752470zbMATH OpenOpenAlexWikidataFDO

Authors Marianna Bolla, Ahmed Elbanna

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)

Recommendations

• Regularity-based spectral clustering and mapping the Fiedler-carpet
• A note on spectral clustering
• Spectral concentration and greedy \(k\)-clustering

Cites work

• scientific article; zbMATH DE number 4027516 (Why is no real title available?)
• Dense expanders and pseudo-random bipartite graphs
• Eigenvalues and expanders
• Generalized quasirandom graphs
• Hermitian matrices and graphs: Singular values and discrepancy
• Lifts, discrepancy and nearly optimal spectral gap
• Matrix and discrepancy view of generalized random and quasirandom graphs
• Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
• Quasi-random graphs
• Relating multiway discrepancy and singular values of nonnegative rectangular matrices
• Spectra and structure of weighted graphs
• Spectral clustering and biclustering. Learning large graphs and contingency tables
• The effectiveness of Lloyd-type methods for the \(k\)-means problem
• Using discrepancy to control singular values for nonnegative matrices

Cited in

(6)

• Relating multiway discrepancy and singular values of nonnegative rectangular matrices
• Generalized quasirandom properties of expanding graph sequences
• Cluster differences scaling with a within-clusters loss component and a fuzzy successive approximation strategy to avoid local minima
• Regularity-based spectral clustering and mapping the Fiedler-carpet
• Matrix and discrepancy view of generalized random and quasirandom graphs
• Three conjectures of Ostrander on digraph Laplacian eigenvectors

This page was built for publication: Discrepancy minimizing spectral clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752470)