TY - GEN
T1 - Disambiguating authors in academic publications using random forests
AU - Treeratpituk, Pucktada
AU - Giles, C. Lee
PY - 2009
Y1 - 2009
N2 - 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 pairwise 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%.
AB - 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 pairwise 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%.
UR - http://www.scopus.com/inward/record.url?scp=70450273106&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70450273106&partnerID=8YFLogxK
U2 - 10.1145/1555400.1555408
DO - 10.1145/1555400.1555408
M3 - Conference contribution
AN - SCOPUS:70450273106
SN - 9781605586977
T3 - Proceedings of the ACM/IEEE Joint Conference on Digital Libraries
SP - 39
EP - 48
BT - JCDL'09 - Proceedings of the 2009 ACM/IEEE Joint Conference on Digital Libraries
T2 - 2009 ACM/IEEE Joint Conference on Digital Libraries, JCDL'09
Y2 - 15 June 2009 through 19 June 2009
ER -