Near Neighbor Search in Large Metric Spaces

@inproceedings{nn_brin_95, abstract = {Given user data, one often wants to find approximate matches in a large database. A good example of such a task is finding images similar to a given image in a large collection of images. We focus on the important and technically difficult case where each data element is high dimensional, or more generally, is represented by a point in a large metric spaceand distance calculations are computationally expensive. In this paper we introduce a data structure to solve this problem called a GNAT --...}, author = {Brin, Sergey }, booktitle = {The VLDB Journal}, citeulike-article-id = {1452929}, keywords = {data-structures, diplomarbeit, knn}, pages = {574--584}, posted-at = {2007-08-22 12:51:06}, priority = {3}, title = {Near Neighbor Search in Large Metric Spaces}, url = {http://citeseer.ist.psu.edu/brin95near.html}, year = {1995} }

TY - CONF ID - nn_brin_95 L3 - citeulike-article-id:1452929 TI - Near Neighbor Search in Large Metric Spaces T2 - The VLDB Journal SP - 574 EP - 584 N2 - Given user data, one often wants to find approximate matches in a large database. A good example of such a task is finding images similar to a given image in a large collection of images. We focus on the important and technically difficult case where each data element is high dimensional, or more generally, is represented by a point in a large metric spaceand distance calculations are computationally expensive. In this paper we introduce a data structure to solve this problem called a GNAT --... KW - data-structures KW - diplomarbeit KW - knn AU - Brin, Sergey PY - 1995/// UR - http://citeseer.ist.psu.edu/brin95near.html ER -