108 search results - page 18 / 22 » Cover Trees for Nearest Neighbor |
ICDE
1999
IEEE
14 years 9 months ago
1999
IEEE
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...
KDD
2001
ACM
14 years 8 months ago
2001
ACM
We focus on the problem of finding patterns across two large, multidimensional datasets. For example, given feature vectors of healthy and of non-healthy patients, we want to answ...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
DASFAA
2005
IEEE
2005
IEEE
NNF: An Effective Approach in Medicine Paring Analysis of Traditional Chinese Medicine Prescriptions
14 years 1 months ago
Medicine Paring Analysis is one of the most important tasks in the research of Traditional Chinese Medicine Prescriptions. The most essential and difficult step is to mine associat...
KDD
1998
ACM
14 years 2 days ago
1998
ACM
Business users and analysts commonly use spreadsheets and 2D plots to analyze and understand their data. On-line Analytical Processing (OLAP) provides these users with added flexi...