Hierarchical co-clustering: off-line and incremental approaches
From MaRDI portal
Publication:2435705
DOI10.1007/S10618-012-0292-8zbMATH Open1281.68190OpenAlexW2086687760MaRDI QIDQ2435705FDOQ2435705
Authors: Ruggero G. Pensa, Dino Ienco, Rosa Meo
Publication date: 19 February 2014
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00798161/file/paper-2_4aperto_889279.pdf
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Cites Work
- A generalized maximum entropy approach to Bregman co-clustering and matrix approximation
- Title not available (Why is that?)
- 10.1162/153244303321897735
- Measures of Association for Cross Classifications
- 10.1162/153244303322753670
- Genetic local search for multi-objective combinatorial optimization
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- Parameter-less co-clustering for star-structured heterogeneous data
- Title not available (Why is that?)
- Title not available (Why is that?)
- Measures of Association for Cross Classifications. II: Further Discussion and References
Cited In (2)
This page was built for publication: Hierarchical co-clustering: off-line and incremental approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2435705)