Using Web Graph Structure for Person Name Disambiguation

In the third edition of WePS campaign we have undertaken the person name disambiguation problem referred to as a clustering task. Our aim was to make use of intrinsic link relationships among Web pages for name resolution in Web search results. To date, link structure has not been used for this purpose. However, Web graph can be a rich source of information about latent semantic similarity between pages. In our approach we hypothesize that pages referring to one person should be linked through the Web graph structure, namely through topically related pages. Our clustering algorithm consists of two stages. In the first stage, we find topically related pages for each search result page using graph-based random walk method. Next, we cluster Web search result pages with common related pages. In the second stage, Web pages are further clustered using content-based clustering algorithm. The results of evaluation have showed that this algorithm can deliver competitive performance.

• Type: Conference
• Year: 2010
• Where: CLEF
• Authors: Elena Smirnova, Konstantin Avrachenkov, Brigitte Trousse
• Keywords: CLEF 2010, Clustering Algorithm, Information Technology, Related Pages, Web Pages