跳到主要导航 跳到搜索 跳到主要内容

Answering range-based reverse kNN queries

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

Given a point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Despite significant progress on this problem, there is a research gap in finding RkNNs not just for an object, but for a given range, which is a natural extension of the problem. Motivated by this, we develop algorithms for exact processing of range-based RkNN with arbitrary values of k on dynamic datasets, which retrieve all the data points that have any position in the given query range R as one of their k nearest neighbors. The experimental results demonstrate the efficiency and the accuracy of our proposed optimizations and algorithms.

源语言英语
主期刊名Web and Big Data - Second International Joint Conference, APWeb-WAIM 2018, Proceedings
编辑Yi Cai, Yoshiharu Ishikawa, Jianliang Xu
出版商Springer Verlag
368-376
页数9
ISBN(印刷版)9783319968926
DOI
出版状态已出版 - 2018
活动2nd Asia Pacific Web and Web-Age Information Management Joint Conference on Web and Big Data, APWeb-WAIM 2018 - Macau, 中国
期限: 23 7月 201825 7月 2018

出版系列

姓名Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
10988 LNCS
ISSN(印刷版)0302-9743
ISSN(电子版)1611-3349

会议

会议2nd Asia Pacific Web and Web-Age Information Management Joint Conference on Web and Big Data, APWeb-WAIM 2018
国家/地区中国
Macau
时期23/07/1825/07/18

指纹

探究 'Answering range-based reverse kNN queries' 的科研主题。它们共同构成独一无二的指纹。

引用此