Cover Trees Revisited: Exploiting Unused Distance and Direction Information

The cover tree (CT) and its improved version are hierarchical data structures that simplified navigating nets while maintaining good runtime guarantees. They can perform nearest neighbor search in logarithmic time and provide efficient computation in practice. In this paper, we revisit cover trees f...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on knowledge and data engineering Vol. 35; no. 11; pp. 1 - 16
Main Authors:	Wang, Zhi-Jie, Nie, Mengdie, Zhao, Kaiqi, Quan, Zhe, Yao, Bin
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.11.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Approximation algorithms Computed tomography Computer science Cover tree data mining Data search data structure and algorithms Data structures machine learing Navigation Nearest neighbor methods Runtime Search algorithms Synthetic data Trigonometric functions
ISSN:	1041-4347, 1558-2191
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!