504 search results - page 3 / 101 » PCS: An Efficient Clustering Method for High-Dimensional Dat... |
KDD
2008
ACM
14 years 5 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
: Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerate...
ICML
2003
IEEE
14 years 6 months ago
2003
IEEE
We investigate how random projection can best be used for clustering high dimensional data. Random projection has been shown to have promising theoretical properties. In practice,...
CIDM
2007
IEEE
13 years 11 months ago
2007
IEEE
Clustering large data sets with high dimensionality is a challenging data-mining task. This paper presents a framework to perform such a task efficiently. It is based on the notio...
ICML
1995
IEEE
14 years 6 months ago
1995
IEEE
Understanding high-dimensional real world data usually requires learning the structure of the data space. The structure maycontain high-dimensional clusters that are related in co...