Spectral clustering and biclustering. Learning large graphs and contingency tables
From MaRDI portal
Publication:2844997
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of graph theory (05C90) Contingency tables (62H17) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to statistics (62-01) Multivariate analysis (62Hxx) Signed and weighted graphs (05C22)
Recommendations
- Spectral clustering and the high-dimensional stochastic blockmodel
- Spectral methods for graph clustering - a survey
- A review on spectral clustering and stochastic block models
- Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs
- Spectral clustering and its use in bioinformatics
Cited in
(14)- Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm
- On spectra of spectra
- Matrix and discrepancy view of generalized random and quasirandom graphs
- Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity
- Estimating parameters of a directed weighted graph model with beta-distributed edge-weights
- Spectral properties of modularity matrices
- Data analytics on graphs
- Relating multiway discrepancy and singular values of nonnegative rectangular matrices
- General Cheeger inequalities for \(p\)-Laplacians on graphs
- Generalized quasirandom properties of expanding graph sequences
- Discrepancy minimizing spectral clustering
- A graph spectrum based geometric biclustering algorithm
- Regularity-based spectral clustering and mapping the Fiedler-carpet
- Dirichlet \(p\)-Laplacian eigenvalues and Cheeger constants on symmetric graphs
This page was built for publication: Spectral clustering and biclustering. Learning large graphs and contingency tables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2844997)
