Processing Incomplete k Nearest Neighbor Search
Given a setS of multidimensional objects and a query object q, a k nearest neighbor (kNN) query finds from S the k closest objects to q. This query is a fundamental problem in database, data mining, and information retrieval research. It plays an important role in a wide spectrum of real application...
Saved in:
Main Authors: | MIAO, Xiaoye, GAO, Yunjun, CHEN, Gang, ZHENG, Baihua, CUI, Huiyong |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2016
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/3322 https://ink.library.smu.edu.sg/context/sis_research/article/4324/viewcontent/ProcessingIncompletek.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Authenticated multistep nearest neighbor search
by: Papadopoulos, S., et al.
Published: (2013) -
Ranked Reverse Nearest Neighbor Search
by: LEE, Ken C. K., et al.
Published: (2008) -
Distributed k-nearest neighbor queries in metric spaces
by: DING, Xin, et al.
Published: (2018) -
Visible Reverse k-Nearest Neighbor Query Processing in Spatial Databases
by: GAO, Yunjun, et al.
Published: (2009) -
Top-k Dominating Queries on Incomplete Data
by: MIAO, Xiaoye, et al.
Published: (2016)