Issue No.06 - June (2012 vol.24)
Jie Tang , Tsinghua University, Beijing
A.C.M. Fong , Auckland University of Technology, Auckland
Bo Wang , Nanjing University of Aeronautics and Astronautics, Beijing
Jing Zhang , Tsinghua University, Beijing
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2011.13
Despite years of research, the name ambiguity problem remains largely unresolved. Outstanding issues include how to capture all information for name disambiguation in a unified approach, and how to determine the number of people K in the disambiguation process. In this paper, we formalize the problem in a unified probabilistic framework, which incorporates both attributes and relationships. Specifically, we define a disambiguation objective function for the problem and propose a two-step parameter estimation algorithm. We also investigate a dynamic approach for estimating the number of people K. Experiments show that our proposed framework significantly outperforms four baseline methods of using clustering algorithms and two other previous methods. Experiments also indicate that the number K automatically found by our method is close to the actual number.
Digital libraries, information search and retrieval, database applications, heterogeneous databases.
Jie Tang, A.C.M. Fong, Bo Wang, Jing Zhang, "A Unified Probabilistic Framework for Name Disambiguation in Digital Library", IEEE Transactions on Knowledge & Data Engineering, vol.24, no. 6, pp. 975-987, June 2012, doi:10.1109/TKDE.2011.13