ACM Home Page
Please provide us with feedback. Feedback
Towards breaking the quality curse.: a web-querying approach to web people search.
Full text PdfPdf (329 KB)
Source
Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Singapore, Singapore
SESSION: Web search--1 table of contents
Pages 27-34  
Year of Publication: 2008
ISBN:978-1-60558-164-4
Authors
Dmitri V. Kalashnikov  University of California, Irvine, Irvine, CA, USA
Rabia Nuray-Turan  University of California, Irvine, Irvine, CA, USA
Sharad Mehrotra  University of California, Irvine, Irvine, CA, USA
Sponsors
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 29,   Downloads (12 Months): 371,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1390334.1390342
What is a DOI?

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 webpages often contain documents 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. This paper presents a new server-side WePS approach. It is based on collecting co-occurrence information from theWeb and thus it uses theWeb as an external data source. A skyline-based classification technique is developed for classifying the collected co-occurrence information in order to make clustering decisions. The clustering technique is specifically designed to (a) handle the dominance that exists in data and (b) to adapt to a given clustering quality measure. These properties allow the framework to get a major advantage in terms of result quality over all the latest WePS techniques we are aware of, including all the 18 methods covered in the recent WePS competition [2].


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
J. Artiles, J. Gonzalo, and S. Sekine. The semeval-2007 weps evaluation: Establishing a benchmark for the web people search task. In SemEval, 2007.
3
 
4
5
 
6
D. Bollegala, Y. Matsuo, and M. Ishizuka. Extracting key phrases to disambiguate personal names on the web. In CICLing, 2006.
7
 
8
9
10
11
 
12
E. Elmacioglu, Y. F. Tan, S. Yan, M.-Y. Kan, and D. Lee. Psnus: Web people name disambiguation by simple clustering with rich features. In SemEval, 2007.
 
13
E. Gabrilovich and S. Markovitch. Computing semantic relatedness using wikipedia-based explicit semantic analysis. In IJCAI, 2007.
 
14
R. Guha and A. Garg. Disambiguating people in search. In Stanford University, 2004.
 
15
D. V. Kalashnikov, Z. Chen, R. Nuray-Turan, and S. Mehrotra. Web people search via connection analysis. IEEE Transactions on Knowledge and Data Engineering (IEEE TKDE), to appear.
16
 
17
D. V. Kalashnikov, S. Mehrotra, and Z. Chen. Exploiting relationships for domain-independent data cleaning. In SIAM International Conference on Data Mining (SIAM Data Mining 2005), Newport Beach, CA, USA, April 21-23 2005.
 
18
D. V. Kalashnikov, S. Mehrotra, Z. Chen, R. Nuray-Turan, andN. Ashish. Entity search: A new paradigm for people search on the web. In IEEE ICDE, Istanbul, Turkey, April 16-20 2007.
 
19
P. Kanani, A. McCallum, and C. Pal. Improving author coreference by resource-bounded information gathering from the web. In IJCAI, 2007.
 
20
I. C. Lerman. Les Bases de la Classification Automatique. Gauthier-Villars, 1970.
 
21
22
 
23
R. Nuray-Turan, D. V. Kalashnikov, and S. Mehrotra. Self-tuning in graph-based reference disambiguation. In Proc. of Int'l Conf. on Database Systems for Advanced Applications (DASFAA), April 9-12 2007.
 
24
25


Collaborative Colleagues:
Dmitri V. Kalashnikov: colleagues
Rabia Nuray-Turan: colleagues
Sharad Mehrotra: colleagues