Sciweavers

1038 search results - page 133 / 208
» Space-Bounded Query Approximation
Sort
View
130
Voted
MICAI
2005
Springer
15 years 8 months ago
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
Edgar Chávez, Karina Figueroa, Gonzalo Nava...
111
Voted
VLDB
2004
ACM
158views Database» more  VLDB 2004»
15 years 8 months ago
REHIST: Relative Error Histogram Construction Algorithms
Histograms and Wavelet synopses provide useful tools in query optimization and approximate query answering. Traditional histogram construction algorithms, such as V-Optimal, optim...
Sudipto Guha, Kyuseok Shim, Jungchul Woo
144
Voted
SSDBM
1999
IEEE
124views Database» more  SSDBM 1999»
15 years 7 months ago
An Indexing Scheme for Fast Similarity Search in Large Time Series Databases
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
Eamonn J. Keogh, Michael J. Pazzani
135
Voted
CINQ
2004
Springer
116views Database» more  CINQ 2004»
15 years 6 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...
112
Voted
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
15 years 6 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....