Download Now Free registration required
Clustering has been recognized as an important and valuable capability in the data mining field. Instead of finding clusters in the full feature space, subspace clustering is an emergent task which aims at detecting clusters embedded in subspaces. Most of previous works in the literature are density-based approaches, where a cluster is regarded as a high-density region in a subspace. However, the identification of dense regions in previous works lacks of considering a critical problem, called "The density divergence problem" in this paper, which refers to the phenomenon that the region densities vary in different subspace cardinalities.
- Format: PDF
- Size: 1638.4 KB