The Community for Technology Leaders
2013 IEEE 13th International Conference on Data Mining (2006)
Hong Kong
Dec. 18, 2006 to Dec. 22, 2006
ISSN: 1550-4786
ISBN: 0-7695-2701-9
pp: 1008-1015
Jian Pei , Simon Fraser Univ., Canada
Ergin Elmacioglu , The Pennsylvania State University, USA
Jaewoo Kang , NCSU & Korea Univ., Korea
Dongwon Lee , The Pennsylvania State University, USA
Byung-Won On , The Pennsylvania State University, USA
The entity resolution (ER) problem, which identifies duplicate entities that refer to the same real world entity, is essential in many applications. In this paper, in particular, we focus on resolving entities that contain a group of related elements in them (e.g., an author entity with a list of citations, a singer entity with song list, or an intermediate result by GROUP BY SQL query). Such entities, named as grouped-entities, frequently occur in many applications. The previous approaches toward grouped-entity resolution often rely on textual similarity, and produce a large number of false positives. As a complementing technique, in this paper, we present our experience of applying a recently proposed graph mining technique, Quasi-Clique, atop conventional ER solutions. Our approach exploits contextual information mined from the group of elements per entity in addition to syntactic similarity. Extensive experiments verify that our proposal improves precision and recall up to 83% when used together with a variety of existing ER solutions, but never worsens them.
Jian Pei, Ergin Elmacioglu, Jaewoo Kang, Dongwon Lee, Byung-Won On, "Improving Grouped-Entity Resolution Using Quasi-Cliques", 2013 IEEE 13th International Conference on Data Mining, vol. 00, no. , pp. 1008-1015, 2006, doi:10.1109/ICDM.2006.85
78 ms
(Ver 3.3 (11022016))