Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Ball_tree> ?p ?o }
Showing triples 1 to 38 of
38
with 100 triples per page.
- Ball_tree abstract "In computer science, a ball tree, balltree or metric tree, is a space partitioning data structure for organizing points in a multi-dimensional space. The ball tree gets its name from the fact that it partitions data points into a nested set of hyperspheres known as \"balls\". The resulting data structure has characteristics that make it useful for a number of applications, most notably nearest neighbor search.".
- Ball_tree wikiPageID "31877832".
- Ball_tree wikiPageLength "9441".
- Ball_tree wikiPageOutDegree "16".
- Ball_tree wikiPageRevisionID "700395241".
- Ball_tree wikiPageWikiLink Binary_tree.
- Ball_tree wikiPageWikiLink Category:Machine_learning.
- Ball_tree wikiPageWikiLink Category:Trees_(data_structures).
- Ball_tree wikiPageWikiLink Computer_science.
- Ball_tree wikiPageWikiLink Data_structure.
- Ball_tree wikiPageWikiLink Euclidean_distance.
- Ball_tree wikiPageWikiLink Heap_(data_structure).
- Ball_tree wikiPageWikiLink Hypersphere.
- Ball_tree wikiPageWikiLink K-d_tree.
- Ball_tree wikiPageWikiLink M-tree.
- Ball_tree wikiPageWikiLink Nearest_neighbor_search.
- Ball_tree wikiPageWikiLink Online_algorithm.
- Ball_tree wikiPageWikiLink Priority_queue.
- Ball_tree wikiPageWikiLink Space_partitioning.
- Ball_tree wikiPageWikiLink Time_complexity.
- Ball_tree wikiPageWikiLinkText "Ball tree".
- Ball_tree wikiPageWikiLinkText "ball tree".
- Ball_tree wikiPageUsesTemplate Template:About.
- Ball_tree wikiPageUsesTemplate Template:Mvar.
- Ball_tree wikiPageUsesTemplate Template:Reflist.
- Ball_tree subject Category:Machine_learning.
- Ball_tree subject Category:Trees_(data_structures).
- Ball_tree hypernym Space.
- Ball_tree type Structure.
- Ball_tree type Technique.
- Ball_tree comment "In computer science, a ball tree, balltree or metric tree, is a space partitioning data structure for organizing points in a multi-dimensional space. The ball tree gets its name from the fact that it partitions data points into a nested set of hyperspheres known as \"balls\". The resulting data structure has characteristics that make it useful for a number of applications, most notably nearest neighbor search.".
- Ball_tree label "Ball tree".
- Ball_tree sameAs Q4851284.
- Ball_tree sameAs m.0gvt6yl.
- Ball_tree sameAs Ball_tree.
- Ball_tree sameAs Q4851284.
- Ball_tree wasDerivedFrom Ball_tree?oldid=700395241.
- Ball_tree isPrimaryTopicOf Ball_tree.