ACM Home Page
Please provide us with feedback. Feedback
Identifying "best bet" web search results by mining past user behavior
Full text PdfPdf (829 KB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Philadelphia, PA, USA
POSTER SESSION: Industrial and government applications track posters table of contents
Pages: 902 - 908  
Year of Publication: 2006
ISBN:1-59593-339-5
Authors
Eugene Agichtein  Microsoft Research, Redmond, WA
Zijian Zheng  Microsoft Corporation, Redmond, WA
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 142,   Citation Count: 7
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/1150402.1150526
What is a DOI?

ABSTRACT

The top web search result is crucial for user satisfaction with the web search experience. We argue that the importance of the relevance at the top position necessitates special handling of the top web search result for some queries. We propose an effective approach of leveraging millions of past user interactions with a web search engine to automatically detect "best bet" top results preferred by majority of users. Interestingly, this problem can be more effectively addressed with classification than using state-of-the-art general ranking methods. Furthermore, we show that our general machine learning approach achieves precision comparable to a heavily tuned, domain-specific algorithm, with significantly higher coverage. Our experiments over millions of user interactions for thousands of queries demonstrate the effectiveness and robustness of our techniques.


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
 
3
 
4
5
6
 
7
D. M. Chickering, The WinMine Toolkit, Microsoft Technical Report MSR-TR-2002-103, 2002
 
8
9
 
10
J. Goecks and J. Shavlick. Learning users' interests by unobtrusively observing their normal behavior. In the Proceedings of the IJCAI Workshop on Machine Learning for Information Filtering. 1999.
11
12
13
14
 
15
 
16
D. Oard and J. Kim. Implicit feedback for recommender systems. In the Proceedings of the AAAI Workshop on Recommender Systems. 1998
 
17
D. Oard and J. Kim. Modeling information content using observable behavior. In Proceedings of the 64th Annual Meeting of the American Society for Information Science and Technology. 2001
18
19
 
20
21
22
 
23
E. M. Voorhees, D. Harman, Overview of TREC, 2001
24

CITED BY  7

Collaborative Colleagues:
Eugene Agichtein: colleagues
Zijian Zheng: colleagues