113 search results - page 13 / 23 » Locally adaptive metrics for clustering high dimensional dat... |
VISSYM
2003
13 years 8 months ago
2003
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...
ICDM
2007
IEEE
14 years 1 months ago
2007
IEEE
It is not surprising that there is strong interest in kNN queries to enable clustering, classification and outlierdetection tasks. However, previous approaches to privacypreservi...
NIPS
1997
13 years 8 months ago
1997
Nonlinear dimensionality reduction is formulated here as the problem of trying to find a Euclidean feature-space embedding of a set of observations that preserves as closely as p...
SIGMOD
1998
ACM
13 years 11 months ago
1998
ACM
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
ACST
2006
13 years 8 months ago
2006
This paper investigates the applicability of distributed clustering technique, called RACHET [1], to organize large sets of distributed text data. Although the authors of RACHET c...