On Group Nearest Group Query Processing

doi:10.1109/TKDE.2010.230

Return

On Group Nearest Group Query Processing

2012-02-01

PRE

Shazia Sadiq

Xiaofang Zhou

Hu Xu

Gabriel Pui Cheong Fung

DOI：10.1109/TKDE.2010.230

Original

Original request for help

Save

Abstract

En 中文

Given a data point set D, a query point set Q, and an integer k, the Group Nearest Group (GNG) query finds a subset omega (vertical bar omega vertical bar <= k) of points from D such that the total distance from all points in Q to the nearest point in omega is not greater than any other subset omega' (vertical bar omega'vertical bar <= k) of points in D. GNG query is a partition-based clustering problem which can be found in many real applications and is NP-hard. In this paper, Exhaustive Hierarchical Combination (EHC) algorithm and Subset Hierarchial Refinement (SHR) algorithm are developed for GNG query processing. While EHC is capable to provide the optimal solution for k = 2, SHR is an efficient approximate approach that combines database techniques with local search heuristic. The processing focus of our approaches is on minimizing the access and evaluation of subsets of cardinality k in D since the number of such subsets is exponentially greater than vertical bar D vertical bar. To do that, the hierarchical blocks of data points at high level are used to find an intermediate solution and then refined by following the guided search direction at low level so as to prune irrelevant subsets. The comprehensive experiments on both real and synthetic data sets demonstrate the superiority of SHR in terms of efficiency and quality.

Keywords:

K-median clustering

group nearest group query

group nearest neighbor query

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.