TY - CONF
T1 - Depth-first k-nearest neighbor finding using the MaxNearestDist estimator
T2 - Image Analysis and Processing, 2003.Proceedings. 12th International Conference on
Y1 - 2003
A1 - Samet, Hanan
KW - branch-and-bound
KW - data
KW - depth-first
KW - distance;
KW - DNA
KW - documents;
KW - estimation;
KW - estimator;
KW - finding;
KW - images;
KW - k-nearest
KW - matching;
KW - maximum
KW - MaxNearestDist
KW - mining;
KW - neighbor
KW - parameter
KW - pattern
KW - possible
KW - process;
KW - processing;
KW - query
KW - search
KW - searching;
KW - sequences;
KW - series;
KW - similarity
KW - text
KW - TIME
KW - tree
KW - video;
AB - Similarity searching is an important task when trying to find patterns in applications which involve mining different types of data such as images, video, time series, text documents, DNA sequences, etc. Similarity searching often reduces to finding the k nearest neighbors to a query object. A description is given of how to use an estimate of the maximum possible distance at which a nearest neighbor can be found to prune the search process in a depth-first branch-and-bound k-nearest neighbor finding algorithm. Using the MaxNearestDist estimator (Larsen, S. and Kanal, L.N., 1986) in the depth-first k-nearest neighbor algorithm provides a middle ground between a pure depth-first and a best-first k-nearest neighbor algorithm.
JA - Image Analysis and Processing, 2003.Proceedings. 12th International Conference on
M3 - 10.1109/ICIAP.2003.1234097
ER -