BBM: Bayesian browsing model from petabyte-scale data

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2009, Pages 537-545

  Liu, Chao ^a   Guo, Fan ^b   Faloutsos, Christos ^b  

^a MICROSOFT RESEARCH   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Bayesian models; Click log analysis; Web search

Indexed keywords

BAYESIAN; BAYESIAN MODELS; CLICK LOG ANALYSIS; EXACT INFERENCE; LOG DATA; LOG LIKELIHOOD; MODELING TECHNIQUE; TEST MODELS; WEB SEARCH;

BAYESIAN NETWORKS; COMPETITION; INFORMATION RETRIEVAL; INTERNET;

WORLD WIDE WEB;

EID: 70350627644     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1557019.1557081     Document Type: Conference Paper

References (31)

1. E. Agichtein, E. Brill, and S. Dumais. Improving web search ranking by incorporating user behavior information. In SIGIR '06, pages 19-26, 2006.
2. E. Agichtein, E. Brill, S. Dumais, and R. Ragno. Learning user interaction models for predicting web search result preferences. In SIGIR '06, pages 3-10, 2006.
3. B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data stream systems. In PODS '02, pages 1-16, 2002.
4. R. Baeza-Yates. Applications of web query mining. Advances in Information Retrieval, pages 7-22, 2005.
5. R. Baeza-Yates, C. Hurtado, and M. Mendoza. Query recommendation using query logs in search engines. In International Workshop on Clustering Information over the Web, 2004.
6. M. Bilenko and R. W. White. Mining the search trails of surfing crowds: identifying relevant websites from user activity. In WWW '08: Proceeding of the 17th international conference on World Wide Web, pages 51-60, 2008.
7. C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. Hullender. Learning to rank using gradient descent. In ICML '05: Proceedings of the 22nd international conference on Machine learning, pages 89-96, 2005.
8. N. Craswell, O. Zoeter, M. Taylor, and B. Ramsey. An experimental comparison of click position-bias models. In WSDM '08: Proceedings of the first international conference on Web search and data mining, pages 87-94, 2008.
9. J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In OSDI'04: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation, 2004.
10. P. Domingos and G. Hulten. Mining high-speed data streams. In KDD '00: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 71-80, 2000.
11. G. E. Dupret and B. Piwowarski. A user browsing model to predict search engine click data from past observations. In SIGIR '08, pages 331-338, 2008.
12. Y. Freund, R. Iyer, R. E. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. Journal Machine Learning Research, 4:933-969, 2003.
13. M. M. Gaber, A. Zaslavsky, and S. Krishnaswamy. Mining data streams: a review. SIGMOD Record, 34(2):18-26, 2005.
14. C. Giannella, J. Han, J. Pei, X. Yan, and P. S. Yu. Mining frequent patterns in data streamsat multiple time granularities. Next Generation Data Mining, 2003.
15. S. Guha, A. Meyerson, N. Mishra, and R. Motwani. Clustering data streams: Theory and practice. IEEE Transactions on Knowledge and Data Engineering, 15, 2003.
16. F. Guo, L. Li, and C. Faloutsos. Tailoring click models to user goals. In WSCD '09: Proceedings of the workshop on Web search click data, 2009.
17. F. Guo, C. Liu, and Y.-M. Wang. Efficient multiple-click models in web search. In WSDM '09, 2009.
18. T. Joachims. Optimizing search engines using clickthrough data. In KDD '02, pages 133-142, 2002.
19. T. Joachims, L. Granka, B. Pan, H. Hembrooke, and G. Gay. Accurately interpreting clickthrough data as implicit feedback. In SIGIR '05, pages 154-161, 2005.
20. T. Joachims, L. Granka, B. Pan, H. Hembrooke, F. Radlinski, and G. Gay. Evaluating the accuracy of implicit feedback from clicks and query reformulations in web search. ACM Transactions on Information Systems, 25(2):7, 2007.
21. T. Minka. Expectation propagation for approximate bayesian inference. In UAI '01: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, pages 362-369, 2001.
22. F. Radlinski and T. Joachims. Query chains: learning to rank from implicit feedback. In KDD '05, pages 239-248, 2005.
23. M. Richardson, E. Dominowska, and R. Ragno. Predicting clicks: estimating the click-through rate for new ads. In WWW '07: Proceedings of the 16th international conference on World Wide Web, pages 521-530, 2007.
24. M. Shokouhi1, F. Scholer, and A. Turpin. Investigating the effectiveness of clickthrough data for document reordering. In ECIR'08, pages 591-595, 2008.
25. C. Silverstein, H. Marais, M. Henzinger, and M. Moricz. Analysis of a very large web search engine query log. SIGIR Forum, 33(1):6-12, 1999.
26. A. Trotman. Learning to rank. Information Retrieval, 8(3):359-381, 2005.
27. M.-F. Tsai, T.-Y. Liu, T. Qin, H.-H. Chen, and W.-Y. Ma. FRank: a ranking method with fidelity loss. In SIGIR '07, pages 383-390, 2007.
28. S. Wedig and O. Madani. A large-scale analysis of query logs for assessing personalization opportunities. In KDD '06, pages 742-747, 2006.
29. G.-R. Xue, H.-J. Zeng, Z. Chen, Y. Yu, W.-Y. Ma, W. Xi, and W. Fan. Optimizing web search using web click-through data. In CIKM '04, pages 118-126, 2004.
30. J. S. Yedidia, W. T. Freeman, and Y. Weiss. Constructing free-energy approximations and generalized belief propagation algorithms. IEEE Trans. Inf. Theory, 51(7):2282-2312, 2005.
31. Z. Zhang and O. Nasraoui. Mining search engine query logs for query recommendation. In WWW'06, pages 1039-1040, 2006.