Resolving person names in web people search

Balog, K., Azzopardi, L. and Rijke, M. (2009) Resolving person names in web people search. In: King, I. and Baeza-Yates, R. (eds.) Weaving Services and People on the World Wide Web. Springer, pp. 301-323. ISBN 9783642005701 (doi:10.1007/978-3-642-00570-1_15)

Full text not currently available from Enlighten.


Disambiguating person names in a set of documents (such as a set of web pages returned in response to a person name) is a key task for the presentation of results and the automatic profiling of experts. With largely unstructured documents and an unknown number of people with the same name the problem presents many difficulties and challenges. This chapter treats the task of person name disambiguation as a document clustering problem, where it is assumed that the documents represent particular people. This leads to the person cluster hypothesis, which states that similar documents tend to represent the same person. Single Pass Clustering, k-Means Clustering, Agglomerative Clustering and Probabilistic Latent Semantic Analysis are employed and empirically evaluated in this context. On the SemEval 2007 Web People Search it is shown that the person cluster hypothesis holds reasonably well and that the Single Pass Clustering and Agglomerative Clustering methods provide the best performance.

Item Type:Book Sections
Glasgow Author(s) Enlighten ID:Azzopardi, Dr Leif
Authors: Balog, K., Azzopardi, L., and Rijke, M.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science

University Staff: Request a correction | Enlighten Editors: Update this record