734 search results - page 9 / 147 » A New Indexing Method for High Dimensional Dataset |
SDM
2003
SIAM
13 years 8 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
SIGMOD
2012
ACM
11 years 9 months ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
ICDE
2003
IEEE
14 years 8 months ago
2003
IEEE
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
We describe the design and implementation of a new data layout scheme, called multi-dimensional clustering, in DB2 Universal Database Version 8. Many applications, e.g., OLAP and ...
TVCG
2011
13 years 2 months ago
2011
—Visual exploration of multivariate data typically requires projection onto lower-dimensional representations. The number of possible representations grows rapidly with the numbe...