.png){kind=icon}
.png){kind=icon}
Return
Subspace clustering
.png){kind=icon}
PRE
AI
DOI：10.1002/widm.1057.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2012 Wiley Periodicals, Inc.
Keywords:
HIGH-DIMENSIONAL DATA
ALGORITHM
SELECTION
VARIABLES
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
11.7
Papers:
532
Citations:
5.3K