Prof Vitaliy Kurlin: mathematics & computer science

Data Science theory and applications. Everything is possible!

E-mail: vitaliy.kurlin(at)gmail.com, University of Liverpool, UK

Project Nearest Neighbors within a new area of Geometric Data Science based on papers

ICML 2023   TopoInVis 2022


Neighbor search by a new Compressed Cover Tree

cover trees
  • Yury Elkin, Vitaliy Kurlin.
  • A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree.
  • Proceedings ICML 2023 (Int. Conference on Machine Learning), p. 9267-9311. Top 20 publication venue across all subjects including Nature and Science.
  • url [official link]   url [early version]

Back to Top of this page | Back to Research & papers | Back to Home page

Gaps in the time complexity for cover trees

cover trees
  • Yury Elkin, Vitaliy Kurlin.
  • Counterexamples expose gaps in the proof of time complexity for cover trees introduced in 2006.
  • Proceedings of TopoInVis 2022 : IEEE Workshop on Topological Data Analysis and Visualization, p.9-17.
  • PDF [9 pages, 240K]   url [official link]   url [early version]  

Back to Top of this page | Back to Research & papers | Back to Home page