@inbook{d9d6281648ca473c899f15f26c8bacb6,
title = "In-memory processing for nearest user-specified group search",
abstract = "This paper presents a nearest user-specified group (NUG) search which called a clustered NN problem. Given a set of data points P and a query point q, NUG search finds the nearest subset c ⊂ P (|c| ≥ k) from q (called user-specified group) that satisfies given conditions. Motivated by the brute-force approach for NUG search requires O (|P|2) computational cost, we propose a faster algorithm to handle NUG problem with in-memory processing. We first define clustered objects above k as a user-specified group and the NUG search problem. Moreover, the proposed solution converts a NUG search problem to a graph formulation problem, and reduces processing cost with geometric-based heuristics. Our experimental results show that the efficiency and effectiveness of our proposed approach outperforms the conventional one.",
keywords = "K-nearest neighbor query, Nearest user-specified group query",
author = "Jang, {Hong Jun} and Choi, {Woo Sung} and Hyun, {Kyeong Seok} and Taehyung Lim and Jung, {Soon Young} and Jaehwa Chung",
note = "Publisher Copyright: {\textcopyright} Springer Science+Business Media Singapore 2015.",
year = "2015",
doi = "10.1007/978-981-10-0281-6_112",
language = "English",
series = "Lecture Notes in Electrical Engineering",
publisher = "Springer Verlag",
pages = "797--803",
booktitle = "Lecture Notes in Electrical Engineering",
}