The blind men and the elephant: on meeting the problem of multiple truths in data from clustering and pattern mining perspectives

DOI10.1007/S10994-013-5334-YzbMATH Open1321.68413OpenAlexW2156617549WikidataQ58799510 ScholiaQ58799510MaRDI QIDQ2260922FDOQ2260922

Authors Arthur Zimek, Jilles Vreeken

Publication date 12 March 2015

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/10067/1237990151162165141

zbMATH Keywords

subspace clusteringpattern miningensemble clusteringalternative clusteringmultiview clusteringconstraint clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• \textit{MultiClust} special issue on discovering, summarizing and using multiple clusterings
• The generic subspace clustering model
• Mining maximal pattern-based subspace clusters in high dimensional space
• A survey of consensus clustering
• A survey on enhanced subspace clustering

Cites work

• scientific article; zbMATH DE number 3168214 (Why is no real title available?)
• scientific article; zbMATH DE number 41467 (Why is no real title available?)
• scientific article; zbMATH DE number 3579840 (Why is no real title available?)
• scientific article; zbMATH DE number 2018600 (Why is no real title available?)
• scientific article; zbMATH DE number 1897893 (Why is no real title available?)
• 10.1162/153244303321897735
• A Method for Comparing Two Hierarchical Clusterings
• A Probability Theory of Cluster Analysis
• A survey of hierarchical classification across different application domains
• A survey on enhanced subspace clustering
• A survey on unsupervised outlier detection in high‐dimensional numerical data
• Automatic aspect discrimination in data clustering
• BoosTexter: A boosting-based system for text categorization
• Constrained Clustering
• Discovering significant patterns
• Discovery Science
• Elements of Information Theory
• Ensemble clustering using semidefinite programming with applications
• Estimating the cluster tree of a density by analyzing the minimal spanning tree of a sample
• Flexible modeling based on copulas in nonparametric median regression
• I-divergence geometry of probability distributions and minimization problems
• Krimp: mining itemsets that compress
• Maximum entropy models and subjective interestingness: an application to tiles in binary databases
• Modeling by shortest data description
• On clustering validation techniques
• On the theory and construction of k-clusters
• Randomization methods for assessing data analysis results on real‐valued matrices
• Relative clustering validity criteria: A comparative overview
• Summarizing transactional databases with overlapped hyperrectangles
• Supervised descriptive rule discovery: a unifying survey of contrast set, emerging pattern and subgroup mining

Cited in

(5)

• Mining maximal pattern-based subspace clusters in high dimensional space
• A comparative analysis of granular computing clustering from the view of set
• Local contrast as an effective means to robust clustering against varying densities
• Steps towards causal Formal Concept Analysis
• The PRIMPING routine -- tiling through proximal alternating linearized minimization

Describes a project that uses

Uses Software

• UCI
• BoosTexter
• FatiGO
• Krimp
• ALOI

This page was built for publication: The blind men and the elephant: on meeting the problem of multiple truths in data from clustering and pattern mining perspectives

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