Processing group nearest group query

Deng, Ke, Xu, Hu, Sadiq, Shazia, Lu, Yansheng, Fung, Pui Cheong Gabriel and Shen, Heng Tao (2009). Processing group nearest group query. In: Loannidis, Yannis, Dik Lee and Raymond Ng, Proceedings of 25th International Conference on Data Engineering. 25th International Conference on Data Engineering (ICDE 2009), Shanghai, China, (1144-1147). 29 March - 2 April 2009. doi:10.1109/ICDE.2009.186


Author Deng, Ke
Xu, Hu
Sadiq, Shazia
Lu, Yansheng
Fung, Pui Cheong Gabriel
Shen, Heng Tao
Title of paper Processing group nearest group query
Conference name 25th International Conference on Data Engineering (ICDE 2009)
Conference location Shanghai, China
Conference dates 29 March - 2 April 2009
Proceedings title Proceedings of 25th International Conference on Data Engineering   Check publisher's open access policy
Journal name Icde: 2009 Ieee 25th International Conference On Data Engineering, Vols 1-3   Check publisher's open access policy
Place of Publication U.S.A.
Publisher IEEE
Publication Year 2009
Sub-type Fully published paper
DOI 10.1109/ICDE.2009.186
ISBN 9781424434220
ISSN 1084-4627
Editor Loannidis, Yannis
Dik Lee
Raymond Ng
Start page 1144
End page 1147
Total pages 4
Collection year 2010
Language eng
Formatted Abstract/Summary
Given a data point set D, a query point set Q and an integer k, the Group Nearest Group (GNG) query finds a subset of points from D, ω (|ω| ≤ k), such that the total distance from all points in Q to the nearest point in ω is no greater than any other subset of points in D, ω' (|ω'| ≤ k). GNG query can be found in many real applications. In this paper, Exhaustive Hierarchical Combination algorithm (EHC) and Subset Hierarchial Refinement algorithm (SHR) are developed for GNG query processing. The superiority of SHR in terms of efficiency and quality compared to existing algorithms developed originally for data clustering is demonstrated.
© 2009 IEEE.
Subjects 080109 Pattern Recognition and Data Mining
080607 Information Engineering and Theory
890399 Information Services not elsewhere classified
E1
Keyword Data clustering
Data points
Nearest point
Query points
Real applications
Refinement algorithms
Q-Index Code E1
Q-Index Status Confirmed Code
Institutional Status UQ

 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 2 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 5 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Thu, 25 Feb 2010, 10:13:42 EST by Ms Lynette Adams on behalf of School of Information Technol and Elec Engineering