2019
DOI: 10.1609/aaai.v33i01.330110001
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Hierarchical Datastructure for Nearest Neighbor Search

Abstract: Nearest neighbor search is a fundamental computational tool and has wide applications. In past decades, many datastructures have been developed to speed up this operation. In this paper, we propose a novel hierarchical datastructure for nearest neighbor search in moderately high dimension. Our proposed method maintains good run time guarantees, and it outperforms several state-of-the-art methods in practice.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 2 publications
(2 reference statements)
0
1
0
Order By: Relevance
“…In recent years, binary classification for imbalanced data has received much attention (Castro and Braga 2013; due to its wide applications in various domains such as mortality prediction, and so on (Zhao et al 2014;Bhattacharya, Rajan, and Shrivastava 2017;Liu et al 2018;Nie et al 2019;Liu et al 2019;Lin et al 2019;Xu et al ). A main characteristic of this problem is that, most of data samples belong to one class while the rest belong to the other.…”
Section: Introductionmentioning
confidence: 99%
“…In recent years, binary classification for imbalanced data has received much attention (Castro and Braga 2013; due to its wide applications in various domains such as mortality prediction, and so on (Zhao et al 2014;Bhattacharya, Rajan, and Shrivastava 2017;Liu et al 2018;Nie et al 2019;Liu et al 2019;Lin et al 2019;Xu et al ). A main characteristic of this problem is that, most of data samples belong to one class while the rest belong to the other.…”
Section: Introductionmentioning
confidence: 99%