Co-clustering documents and words by minimizing the normalized cut objective function

DOI10.1007/S10852-010-9126-0zbMath1233.68177OpenAlexW2082920824MaRDI QIDQ656070

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

zbMATH Keywords

information retrievalgraph partitioningdata miningnormalized cutdocument clusteringfusion-fission

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Information storage and retrieval of data (68P20)

Uses Software

• Graclus

Cites Work

• Unnamed Item
• Multilevel refinement for combinatorial optimisation problems
• A new method, the fusion fission, for the relaxed \(k\)-way graph partitioning problem, and comparisons with some multilevel algorithms
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• An Efficient Heuristic Procedure for Partitioning Graphs
• Parallel Multilevel series k-Way Partitioning Scheme for Irregular 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

This page was built for publication: Co-clustering documents and words by minimizing the normalized cut objective function