Disambiguating Web appearances of people in a social network

Say you are looking for information about a particular person. A search engine returns many pages for that person's name but which pages are about the person you care about, and which are about other people who happen to have the same name? Furthermore, if we are looking for multiple people who are related in some way, how can we best leverage this social network? This paper presents two unsupervised frameworks for solving this problem: one based on link structure of the Web pages, another using Agglomerative/Conglomerative Double Clustering (A/CDC)--an application of a recently introduced multi-way distributional clustering method. To evaluate our methods, we collected and hand-labeled a dataset of over 1000 Web pages retrieved from Google queries on 12 personal names appearing together in someones in an email folder. On this dataset our methods outperform traditional agglomerative clustering by more than 20%, achieving over 80% F-measure. Categories and Subject Descriptors H.3....

• Type: Conference
• Year: 2005
• Where: WWW
• Authors: Ron Bekkerman, Andrew McCallum
• Keywords: Agglomerative/Conglomerative Double Clustering, Internet Technology, Multi-way Distributional Clustering, Traditional Agglomerative Clustering, WWW 2005