Efficient context-aware K-nearest neighbor search
Paper i proceeding, 2018

We develop a context-sensitive and linear-time K-nearest neighbor search method, wherein the test object and its neighborhood (in the training dataset) are required to share a similar structure via establishing bilateral relations. Our approach particularly enables to deal with two types of irregularities: (i) when the (test) objects are outliers, i.e. they do not belong to any of the existing structures in the (training) dataset, and (ii) when the structures (e.g. classes) in the dataset have diverse densities. Instead of aiming to capture the correct underlying structure of the whole data, we extract the correct structure in the neighborhood of the test object, which leads to computational efficiency of our search strategy. We investigate the performance of our method on a variety of real-world datasets and demonstrate its superior performance compared to the alternatives.

Författare

Mostafa Haghir Chehreghani

TELECOM ParisTech

Morteza Haghir Chehreghani

Chalmers, Data- och informationsteknik, Datavetenskap

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 10772 466-478

40th European Conference on Information Retrieval, ECIR 2018
Grenoble, France,

Ämneskategorier

Annan data- och informationsvetenskap

Bioinformatik (beräkningsbiologi)

Datorseende och robotik (autonoma system)

DOI

10.1007/978-3-319-76941-7_35

Mer information

Senast uppdaterat

2018-09-19