Disambiguating authors in academic publications using random forests

ABSTRACT

Users of digital libraries usually want to know the exact author or authors of an article. But different authors may share the same names, either as full names or as initials and last names (complete name change examples are not considered here). In such a case, the user would like the digital library to differentiate among these authors. Name disambiguation can help in many cases; one being a user in a search of all articles written by a particular author. Disambiguation also enables better bibliometric analysis by allowing a more accurate counting and grouping of publications and citations. In this paper, we describe an algorithm for pair-wise disambiguation of author names based on a machine learning classification algorithm, random forests. We define a set of similarity profile features to assist in author disambiguation. Our experiments on the Medline database show that the random forest model outperforms other previously proposed techniques such as those using support-vector machines (SVM). In addition, we demonstrate that the variable importance produced by the random forest model can be used in feature selection with little degradation in the disambiguation accuracy. In particular, the inverse document frequency of author last name and the middle name's similarity alone achieves an accuracy of almost 90%.

REFERENCES

• 1: Ron Bekkerman , Andrew McCallum, Disambiguating Web appearances of people in a social network, Proceedings of the 14th international conference on World Wide Web, May 10-14, 2005, Chiba, Japan [doi>10.1145/1060745.1060813]
• 2: Omar Benjelloun , Hector Garcia-Molina , Heng Gong , Hideki Kawai , Tait E. Larson , David Menestrina , Sutthipong Thavisomboon, D-Swoosh: A Family of Algorithms for Generic, Distributed Entity Resolution, Proceedings of the 27th International Conference on Distributed Computing Systems, p.37, June 25-27, 2007 [doi>10.1109/ICDCS.2007.96]
• 3: Mikhail Bilenko , Beena Kamath , Raymond J. Mooney, Adaptive Blocking: Learning to Scale Up Record Linkage, Proceedings of the Sixth International Conference on Data Mining, p.87-96, December 18-22, 2006 [doi>10.1109/ICDM.2006.13]
• 4: Mikhail Bilenko , Raymond Mooney , William Cohen , Pradeep Ravikumar , Stephen Fienberg, Adaptive Name Matching in Information Integration, IEEE Intelligent Systems, v.18 n.5, p.16-23, September 2003 [doi>10.1109/MIS.2003.1234765]
• 5: Leo Breiman, Random Forests, Machine Learning, v.45 n.1, p.5-32, October 1 2001 [doi>10.1023/A:1010933404324]
• 6: Wray Buntine , Tim Niblett, A Further Comparison of Splitting Rules for Decision-Tree Induction, Machine Learning, v.8 n.1, p.75-85, Jan. 1992 [doi>10.1023/A:1022686419106]
• 7: C. Chang and C. Lin. Libsvm: a library for support vector machines. http://www.csie.ntu.edu.tw/cjlin/libsvm, 2001.
• 8: P. Christen. A comparison of personal name matching: Techniques and practical issues. Workshop on Mining Complex Data (MCD), 2006.
• 9: William W. Cohen , Henry Kautz , David McAllester, Hardening soft information sources, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, p.255-259, August 20-23, 2000, Boston, Massachusetts, United States [doi>10.1145/347090.347141]
• 10: I. Fellegi and A. Sunter. A theory for record linkage. Journal of the American Statistical Association, 1969.
• 11: Hui Han , Lee Giles , Hongyuan Zha , Cheng Li , Kostas Tsioutsiouliklis, Two supervised learning approaches for name disambiguation in author citations, Proceedings of the 4th ACM/IEEE-CS joint conference on Digital libraries, June 07-11, 2004, Tuscon, AZ, USA [doi>10.1145/996350.996419]
• 12: Hui Han , Hongyuan Zha , C. Lee Giles, Name disambiguation in author citations using a K-way spectral clustering method, Proceedings of the 5th ACM/IEEE-CS joint conference on Digital libraries, June 07-11, 2005, Denver, CO, USA [doi>10.1145/1065385.1065462]
• 13: Mauricio A. Hernández , Salvatore J. Stolfo, The merge/purge problem for large databases, Proceedings of the 1995 ACM SIGMOD international conference on Management of data, p.127-138, May 22-25, 1995, San Jose, California, United States
• 14: J. Huang, S. Ertekin, and C. L. Giles. Efficient name disambiguation for large-scale databases. Proc of The European Conf on Principles and Practice of Knowledge Discovery in Databases, 2006.
• 15: Liang Jin , Chen Li , Sharad Mehrotra, Efficient Record Linkage in Large Data Sets, Proceedings of the Eighth International Conference on Database Systems for Advanced Applications, p.137, March 26-28, 2003
• 16: A. Liaw and M. Wiener. Classification and regression by randomforest. R News.
• 17: Andrew McCallum , Kamal Nigam , Lyle H. Ungar, Efficient clustering of high-dimensional data sets with application to reference matching, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, p.169-178, August 20-23, 2000, Boston, Massachusetts, United States [doi>10.1145/347090.347123]
• 18: A. Monge and C. Elkan. An Efficient domain-independent algorithm for detecting approximately duplicate database records. Proc of SIGMOD, 1997.
• 19: Byung-Won On , Dongwon Lee , Jaewoo Kang , Prasenjit Mitra, Comparative study of name disambiguation problem using a scalable blocking-based framework, Proceedings of the 5th ACM/IEEE-CS joint conference on Digital libraries, June 07-11, 2005, Denver, CO, USA [doi>10.1145/1065385.1065463]
• 20: Hung-sik Kim , Dongwon Lee, Parallel linkage, Proceedings of the sixteenth ACM conference on Conference on information and knowledge management, November 06-10, 2007, Lisbon, Portugal [doi>10.1145/1321440.1321482]
• 21: Yang Song , Jian Huang , Isaac G. Councill , Jia Li , C. Lee Giles, Efficient topic-based unsupervised name disambiguation, Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries, June 18-23, 2007, Vancouver, BC, Canada [doi>10.1145/1255175.1255243]
• 22: Wee Meng Soon , Hwee Tou Ng , Daniel Chung Yong Lim, A machine learning approach to coreference resolution of noun phrases, Computational Linguistics, v.27 n.4, December 2001
• 23: Sheila Tejada , Craig A. Knoblock , Steven Minton, Learning object identification rules for information integration, Information Systems, v.26 n.8, p.607-633, December 2001 [doi>10.1016/S0306-4379(01)00042-4]
• 24: Vetle I. Torvik , Marc Weeber , Don R. Swanson , Neil R. Smalheiser, A probabilistic similarity metric for Medline records: A model for author name disambiguation: Research Articles, Journal of the American Society for Information Science and Technology, v.56 n.2, p.140-158, January 2005 [doi>10.1002/asi.v56:2]
• 25: W. Winkler. The state of record linkage and current research problems. Statistics of Income Division, 1999.
• 26: W. Winkler. Approximate string comparator search strategies for very large administrative lists. Proc of the Section on Survey Research Methods, 2004.
• 27: Hui Yang , Jamie Callan, Near-duplicate detection for eRulemaking, Proceedings of the 2005 national conference on Digital government research, May 15-18, 2005, Atlanta, Georgia

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.3 Information Search and Retrieval
          Subjects: Clustering

General Terms:
Algorithms, Experimentation

Keywords:
author disambiguation, medline, random forests