Talk:Vantage-point tree

This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computer science Mid‑importance This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles Mid This article has been rated as Mid-importance on the project's importance scale. Things you can help WikiProject Computer science with: Here are some tasks awaiting attention: Article requests : Requested articles/Applied arts and sciences/Computer science, computing, and Internet Cleanup : Computer science articles needing attention Computer science articles needing expert attention Copyedit : Computing Expand : Computer science Infobox : Computer science articles without infoboxes Maintain : Timeline of computing 2020–present Photo : Find pictures for the biographies of computer scientists (see List of computer scientists) Computing articles needing images Stubs : Computer science stubs Unreferenced : WikiProject Computer science/Unreferenced BLPs Project-related : Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

MVP tree is a generalization of the better-known VP tree. It can be adequately covered in the more complete Vantage-point tree article. Pburka (talk) 22:29, 16 November 2014 (UTC)[reply]

 Done JackPotte (talk) 00:06, 30 January 2016 (UTC)[reply]

I added notes about Brin's GNAT data structure, which is related to the MVP. Brin's paper: http://www.vldb.org/conf/1995/P574.PDF --Ericjster (talk) 00:59, 29 January 2019 (UTC)[reply]

Algorithms are missing: a construction algorithm as well as a nearest neighbor search algorithms would be welcome. Also, a search for all neighbors within a tolerance margin would be welcome. 160.129.138.225 (talk) 15:04, 23 March 2017 (UTC)[reply]

Each variant has some differences in the construction, and those details often can be important in practice. The construction algorithm should generalize the different variations. --Ericjster (talk) 00:59, 29 January 2019 (UTC)[reply]

I think more should be said about metric spaces, and all you need is a function to compare two things. For example one can create an index on text or pictures, and the user only needs to provide a distance function. The distance function must maintain the triangle inequality. --Ericjster (talk) 00:59, 29 January 2019 (UTC)[reply]