この論文をさがす
説明
<jats:title>Abstract</jats:title><jats:p><jats:italic>Subspace clustering</jats:italic>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.</jats:p><jats:p>This article is categorized under:<jats:list list-type="explicit-label"><jats:list-item><jats:p>Technologies > Structure Discovery and Clustering</jats:p></jats:list-item></jats:list></jats:p>
収録刊行物
-
- WIREs Data Mining and Knowledge Discovery
-
WIREs Data Mining and Knowledge Discovery 2 (4), 351-364, 2012-06-22
Wiley