Exploiting Web querying for Web People Search in WePS2.

Appeared in WePS 2009.


Rabia Nuray-Turan, Zhaoqi Chen, Dmitri V. Kalashnikov, and Sharad Mehrotra

Computer Science Department
University of California, Irvine
GDF project (http://www.ics.uci.edu/~dvk/GDF)

Abstract

Searching for people on the Web is one of the most common query types to the web search engines today. However, when a person name is queried, the returned result often contains webpages related to several distinct namesakes who have the queried name. The task of disambiguating and finding the webpages related to the specific person of interest is left to the user. Many Web People Search (WePS) approaches have been developed recently that attempt to automate this disambiguation process. Nevertheless, the disambiguation quality of these techniques leaves a major room for improvement. In this paper we describe our experience of applying our WePS approaches developed in [20] in the context of WePS-2 Clustering Task [14]. The approach is based on extracting named entities from the web pages and then querying the web to collecting co-occurrence statistics, which are used as additional similarity measures.


Categories and Subject Descriptors:

H.2.m [Database Management]: Miscellaneous - Web People Search;
H.2.8 [Database Management]: Database Applications - Data mining;
H.3.3 [Information Storage and Retrieval]: Information Search and Retrieval


Keywords:

Web People Search, WEPS, clustering, Skyline Based Classifier, Web co-occurrence, Entity Resolution, Disambiguation


Downloadable files:

Paper: WEPS2_dvk.pdf
Presentation: WEPS2_dvk.ppt

BibTeX entry:

@inproceedings{WEPS2::dvk,
	author	= {Rabia Nuray-Turan and Zhaoqi Chen and Dmitri V. Kalashnikov and Sharad Mehrotra},
	title	= {Exploiting {Web} querying for {Web People Search} in {WePS2}},
	booktitle= {2nd Web People Search Evaluation Workshop (WePS 2009), 18th WWW Conference},
	month	= {April},
	year	= {2009}
}

Back to Kalashnikov's homepage

© 2009 Dmitri V. Kalashnikov. All Rights Reserved.