ACM Home Page
Please provide us with feedback. Feedback
Mining rich session context to improve web search
Full text MovMov (26:09),  PdfPdf (2.88 MB)
Source
International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Paris, France
SESSION: Research track papers table of contents
Pages 1037-1046  
Year of Publication: 2009
ISBN:978-1-60558-495-9
Authors
Guangyu Zhu  University of Maryland, College Park, MD, USA
Gilad Mishne  Yahoo! Inc, Sunnyvale, CA, USA
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): 57,   Downloads (12 Months): 191,   Citation Count: 0
Additional Information:

abstract   references   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/1557019.1557131
What is a DOI?

ABSTRACT

User browsing information, particularly their non-search related activity, reveals important contextual information on the preferences and the intent of web users. In this paper, we expand the use of browsing information for web search ranking and other applications, with an emphasis on analyzing individual user sessions for creating aggregate models. In this context, we introduce ClickRank, an efficient, scalable algorithm for estimating web page and web site importance from browsing information. We lay out the theoretical foundation of ClickRank based on an intentional surfer model and analyze its properties. We evaluate its effectiveness for the problem of web search ranking, showing that it contributes significantly to retrieval performance as a novel web search feature. We demonstrate that the results produced by ClickRank for web search ranking are highly competitive with those produced by other approaches, yet achieved at better scalability and substantially lower computational costs. Finally, we discuss novel applications of ClickRank in providing enriched user web search experience, highlighting the usefulness of our approach for non-ranking tasks.


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
R. Baeza-Yates, C. Castillo, F. Junqueira, V. Plachouras, and F. Silvestri. Challenges in distributed information retrieval. In ICDE, pages 6--20, 2007.
5
6
 
7
L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. CRC Press, 1984.
8
 
9
W. Cohen, R. Shapire, and Y. Singer. Learning to order things. Journal of Artificial Intelligence Research, 10:243--270, 1999.
10
 
11
12
 
13
 
14
J. H. Friedman. Greedy function approximation: A gradient boosting machine. The Annals of Statistics, 29(5):1189--1232, 2001.
 
15
Google. We know the web was big. Online, 2008. http://googleblog.blogspot.com/2008/07/we-knew-web-was-big.html.
 
16
17
18
19
20
21
 
22
23
 
24
A. N. Langville and C. D. Meyer. Deeper inside PageRank. Journal of Internet Mathematics, 1(3):335--400, 2005.
25
26
27
28
 
29
C. Moler. The world's largest matrix computation. Online, 2002. http://www.mathworks.com/company/newsletters/news_notes/clevescorner/oct02_cleve.html.
30
31
 
32
L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank Citation Ranking: Bringing Order to The web. Technical Report, Stanford University, 1998.
33
 
34
W. M. Rand. Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association, 66(336):846--850, 1971.
35
36
37
38
39

Collaborative Colleagues:
Guangyu Zhu: colleagues
Gilad Mishne: colleagues