138 search results - page 6 / 28 » Approximated Clustering of Distributed High-Dimensional Data |
DAWAK
2007
Springer
14 years 1 months ago
2007
Springer
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
GFKL
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. A method for measuring the density of data sets that contain an unknown number of clusters of unknown sizes is proposed. This method, called Pareto Density Estimation (PD...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
CCGRID
2006
IEEE
13 years 11 months ago
2006
IEEE
P2P systems represent a large portion of the Internet traffic which makes the data discovery of great importance to the user and the broad Internet community. Hence, the power of ...
KDD
2003
ACM
14 years 8 months ago
2003
ACM
High dimensional directional data is becoming increasingly important in contemporary applications such as analysis of text and gene-expression data. A natural model for multivaria...