Regularity-based spectral clustering and mapping the Fiedler-carpet
DOI10.1515/spma-2022-0167zbMath1489.05091arXiv2112.10637OpenAlexW4285202972MaRDI QIDQ2148856
Vilas Winstein, Frank Seidl, Tao You, Fatma Abdelkhalek, Marianna Bolla
Publication date: 24 June 2022
Published in: Special Matrices (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.10637
correspondence analysisnormalized Laplacianmultiway cutsmultiway discrepancyFiedler-vectorweighted \(k\)-means algorithm
Factor analysis and principal components; correspondence analysis (62H25) Numerical computation of solutions to systems of equations (65H10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relating multiway discrepancy and singular values of nonnegative rectangular matrices
- Singular value decomposition of large random matrices (for two-way classification of microarrays)
- Isoperimetric inequalities, growth, and the spectrum of graphs
- Spectra and optimal partitions of weighted graphs
- Hermitian matrices and graphs: Singular values and discrepancy
- Eigenvalues and partitionings of the edges of a graph
- Spectral Clustering and Biclustering
- Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
- Expander graphs and their applications
- Generalized quasirandom properties of expanding graph sequences
- The effectiveness of lloyd-type methods for the k-means problem
- Quasi‐random graphs with given degree sequences
- Networks
This page was built for publication: Regularity-based spectral clustering and mapping the Fiedler-carpet