158 search results - page 23 / 32 » On Optimizing Nearest Neighbor Queries in High-Dimensional D... |
PAMI
1998
14 years 9 months ago
1998
A new method for analyzing the intrinsic dimensionality (ID) of low dimensional manifolds in high dimensional feature spaces is presented. The basic idea is to rst extract a low-d...
NIPS
2007
14 years 11 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
CIKM
2007
Springer
15 years 3 months ago
2007
Springer
Spatial queries for extracting data from wireless sensor networks are important for many applications, such as environmental monitoring and military surveillance. One such query i...
SSDBM
2005
IEEE
15 years 3 months ago
2005
IEEE
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a pr...
160
click to vote
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...