Co-clustering documents and words by minimizing the normalized cut objective function
DOI10.1007/S10852-010-9126-0zbMATH Open1233.68177OpenAlexW2082920824MaRDI QIDQ656070FDOQ656070
Authors: Charles Edmond Bichot 
Publication date: 26 January 2012
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-010-9126-0
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
Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- An Efficient Heuristic Procedure for Partitioning Graphs
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Data Mining and Knowledge Discovery Handbook
- Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
- Empirical and theoretical comparisons of selected criterion functions for document clustering
- A new method, the fusion fission, for the relaxed \(k\)-way graph partitioning problem, and comparisons with some multilevel algorithms
- Multilevel refinement for combinatorial optimisation problems
Cited In (3)
Uses Software
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)
