We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Subspace clustering.
- Authors
Kriegel, Hans-Peter; Kröger, Peer; Zimek, Arthur
- Abstract
Subspace clustering refers to the task of identifying clusters of similar objects or data records (vectors) where the similarity is defined with respect to a subset of the attributes (i.e., a subspace of the data space). The subspace is not necessarily (and actually is usually not) the same for different clusters within one clustering solution. In this article, the problems motivating subspace clustering are sketched, different definitions and usages of subspaces for clustering are described, and exemplary algorithmic solutions are discussed. Finally, we sketch current research directions. © 2012 Wiley Periodicals, Inc.
- Publication
WIREs: Data Mining & Knowledge Discovery, 2012, Vol 2, Issue 4, p351
- ISSN
1942-4787
- Publication type
Article
- DOI
10.1002/widm.1057