Sciweavers

251 search results - page 20 / 51
» When Is Nearest Neighbors Indexable
Sort
View
EDBT
2008
ACM
99views Database» more  EDBT 2008»
14 years 7 months ago
Querying time-series streams
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
Vivekanand Gopalkrishnan
FLAIRS
2003
13 years 9 months ago
Efficient Retrieval for Case-Based Reasoning
In this work two indexing approaches are presented for case-based reasoning. The first is a hybrid technique which uses a combination of a matrix structure and a tree structure to...
David W. Patterson, Niall Rooney, Mykola Galushka
ICDE
2007
IEEE
206views Database» more  ICDE 2007»
14 years 9 months ago
Efficiently Processing Continuous k-NN Queries on Data Streams
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
Beng Chin Ooi, Christian Böhm, Claudia Plant,...
DEXAW
1999
IEEE
152views Database» more  DEXAW 1999»
13 years 12 months ago
Advanced Metrics for Class-Driven Similarity Search
This paper presents two metrics for the Nearest Neighbor Classifier that share the property of being adapted, i.e. learned, on a set of data. Both metrics can be used for similari...
Paolo Avesani, Enrico Blanzieri, Francesco Ricci
CCCG
2006
13 years 9 months ago
K-Nearest Neighbor Search using the Pyramid Technique
A k-nearest neighbor search algorithm for the Pyramid technique is presented. The Pyramid technique divides d-dimensional data space into 2d pyramids. Given a query point q, we in...
Bradford G. Nickerson, Qingxiu Shi