SSC : Statistical Subspace Clustering

Abstract : Subspace clustering is an extension of traditional clustering that seeks to find clusters in different subspaces within a dataset. This is a particularly important challenge with high dimensional data where the curse of dimensionality occurs. It has also the benefit of providing smaller descriptions of the clusters found. Existing methods only consider numerical databases and do not propose any method for clusters visualization. Besides, they require some input parameters difficult to set for the user. The aim of this paper is to propose a new subspace clustering algorithm, able to tackle databases that may contain continuous as well as discrete attributes, requiring as few user parameters as possible, and producing an interpretable output. We present a method based on the use of the well-known EM algorithm on a probabilistic model designed under some specific hypotheses, allowing us to present the result as a set of rules, each one defined with as few relevant dimensions as possible. Experiments, conducted on artificial as well as real databases, show that our algorithm gives robust results, in terms of classification and interpretability of the output.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/inria-00536697
Contributor : Isabelle Tellier <>
Submitted on : Tuesday, November 16, 2010 - 5:32:22 PM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM
Long-term archiving on: Thursday, February 17, 2011 - 3:07:31 AM

File

MLDM05.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00536697, version 1

Collections

Citation

Laurent Candillier, Isabelle Tellier, Fabien Torre, Olivier Bousquet. SSC : Statistical Subspace Clustering. 4th International Conference on Machine Learning and Data Mining in Pattern Recognition, 2005, Leipzig, Georgia. pp.100--109. ⟨inria-00536697⟩

Share

Metrics

Record views

329

Files downloads

764