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.
Beschreibung
Identifying "best bet" web search results by mining past user behavior
%0 Conference Paper
%1 1150526
%A Agichtein, Eugene
%A Zheng, Zijian
%B KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
%C New York, NY, USA
%D 2006
%I ACM Press
%K best-bet ranking search web
%P 902--908
%R http://doi.acm.org/10.1145/1150402.1150526
%T Identifying "best bet" web search results by mining past user behavior
%U http://portal.acm.org/citation.cfm?id=1150526
%X 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.
%@ 1-59593-339-5
@inproceedings{1150526,
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.},
added-at = {2007-06-12T09:26:19.000+0200},
address = {New York, NY, USA},
author = {Agichtein, Eugene and Zheng, Zijian},
biburl = {https://www.bibsonomy.org/bibtex/28b6ab02df241053f7f7c48a900d2665f/beate},
booktitle = {KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining},
description = {Identifying "best bet" web search results by mining past user behavior},
doi = {http://doi.acm.org/10.1145/1150402.1150526},
interhash = {d47c7898192324d783d6f1b32c3d8ffd},
intrahash = {8b6ab02df241053f7f7c48a900d2665f},
isbn = {1-59593-339-5},
keywords = {best-bet ranking search web},
location = {Philadelphia, PA, USA},
pages = {902--908},
publisher = {ACM Press},
timestamp = {2008-12-09T16:32:51.000+0100},
title = {Identifying "best bet" web search results by mining past user behavior},
url = {http://portal.acm.org/citation.cfm?id=1150526},
year = 2006
}