Co-clustering documents and words by minimizing the normalized cut objective function
From MaRDI portal
Recommendations
- Web document clustering using hyperlink structures
- scientific article; zbMATH DE number 2043368
- A method for spectral co-clustering documents and words based on morphology
- Spectral co-clustering documents and words based on fuzzy \(K\)-harmonic means
- Mutual information, phi-squared and model-based co-clustering for contingency tables
Cites work
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- A new method, the fusion fission, for the relaxed \(k\)-way graph partitioning problem, and comparisons with some multilevel algorithms
- An Efficient Heuristic Procedure for Partitioning Graphs
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Data Mining and Knowledge Discovery Handbook
- Empirical and theoretical comparisons of selected criterion functions for document clustering
- Multilevel refinement for combinatorial optimisation problems
- Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
- Partitioning Sparse Matrices with Eigenvectors of Graphs
Cited in
(3)
This page was built for publication: Co-clustering documents and words by minimizing the normalized cut objective function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656070)