436 search results - page 15 / 88 » Automatic Subspace Clustering of High Dimensional Data for D... |
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
We present a new visualization of the distance and cluster structure of high dimensional data. It is particularly well suited for analysis tasks of users unfamiliar with complex d...
MLDM
2005
Springer
14 years 1 months ago
2005
Springer
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...
CSB
2003
IEEE
14 years 28 days ago
2003
IEEE
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
PAKDD
2005
ACM
14 years 1 months ago
2005
ACM
: While feature selection is very difficult for high dimensional, unstructured data such as face image, it may be much easier to do if the data can be faithfully transformed into l...