.png){kind=icon}
返回
On Group Nearest Group Query Processing
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2010.230.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
K-median clustering
group nearest group query
group nearest neighbor query
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
引用论文
Operating-Condition-Based Voltage Control Algorithm of Distributed Energy Storage Systems in Variable Energy Resource Integrated Distribution System.png)
Electronics
OAAI
ElectronicsIF0
OAAI分享收藏
查看更多内容