232 search results - page 5 / 47 » Fast High-Dimensional Data Search in Incomplete Databases |
215
click to vote
ICDE
2002
IEEE
16 years 2 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
149
click to vote
VLDB
2000
ACM
15 years 5 months ago
2000
ACM
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
128
click to vote
DEXA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In this paper, we study the problem of projected outlier detection in high dimensional data streams and propose a new technique, called Stream Projected Ouliter deTector ...
209
click to vote
ICDE
2008
IEEE
16 years 2 months ago
2008
IEEE
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
223
click to vote
ICDE
2000
IEEE
16 years 2 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...