Comparison of three objective functions for conceptual clustering

DOI10.1007/3-540-44794-6_33MaRDI QIDQ4802603zbMATH OpenFDO

Authors Céline Robardet, Fabien Feschet

Publication date 21 April 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2168/21680399.htm

zbMATH Keywords

association measureconceptual clusteringunsupervised clustering

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 496231
• scientific article; zbMATH DE number 2084846
• LC: A conceptual clustering algorithm
• scientific article; zbMATH DE number 4007494
• Data clustering based on a new objective function

Cited in

(6)

• Hierarchical co-clustering: off-line and incremental approaches
• Parameter-less co-clustering for star-structured heterogeneous data
• scientific article; zbMATH DE number 496231 (Why is no real title available?)
• scientific article; zbMATH DE number 2084846 (Why is no real title available?)
• Explaining random forest and XGBoost with shallow decision trees by co-clustering feature importance
• Differentiable parameter-less co-clustering using graph neural networks

This page was built for publication: Comparison of three objective functions for conceptual clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4802603)