Resolving person names in web people search

10Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Balog, K., Azzopardi, L., & De Rijke, M. (2009). Resolving person names in web people search. In Weaving Services and People on the World Wide Web (pp. 301–323). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-00570-1_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free