| Quicklink selection for navigational query results |
| Full text |
Pdf
(835 KB)
|
Source
|
International World Wide Web Conference
archive
Proceedings of the 18th international conference on World wide web
table of contents
Madrid, Spain
SESSION: Search/session: search UI
table of contents
Pages 391-400
Year of Publication: 2009
ISBN:978-1-60558-487-4
|
|
Authors
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 28, Downloads (12 Months): 111, Citation Count: 0
|
|
|
ABSTRACT
Quicklinks for a website are navigational shortcuts displayed below the website homepage on a search results page, and that let the users directly jump to selected points inside the website. Since the real-estate on a search results page is constrained and valuable, picking the best set of quicklinks to maximize the benefits for a majority of the users becomes an important problem for search engines. Using user browsing trails obtained from browser toolbars, and a simple probabilistic model, we formulate the quicklink selection problem as a combinatorial optimizaton problem. We first demonstrate the hardness of the objective, and then propose an algorithm that is provably within a factor of 1-1/e of the optimal. We also propose a different algorithm that works on trees and that can find the optimal solution; unlike the previous algorithm, this algorithm can incorporate natural constraints on the set of chosen quicklinks. The efficacy of our methods is demonstrated via empirical results on both a manually labeled set of websites and a set for which quicklink click-through rates for several webpages were obtained from a real-world search engine.
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
|
Prosenjit Bose , Evangelos Kranakis , Danny Krizanc , Miguel Vargas Martin , Jurek Czyzowicz , Andrzej Pelc , Leszek Gasieniec, Strategies for Hotlink Assignments, Proceedings of the 11th International Conference on Algorithms and Computation, p.23-34, December 18-20, 2000
|
| |
4
|
|
| |
5
|
|
 |
6
|
|
| |
7
|
J. Czyzowicz, E. Kranakis, D. Krizanc, A. Pelc, and M. M. Vargas. Enhancing hyperlink structure for improving web performance. J. Web Engineering, 1(2):93--127, 2003.
|
 |
8
|
|
| |
9
|
Y. Fu, K. Sandu, and M.-Y. Shih. Clustering of web users based on access patterns. In WebKDD Workshop, pages 21--38, 1999.
|
| |
10
|
|
| |
11
|
E. Kranakis, D. Krizanc, and M. V. Martin. Optimizing web server's data transfer with hotlinks. In IADIS Intl. Conf. on WWW/Internet, pages 341--346, 2003.
|
| |
12
|
|
 |
13
|
Yuting Liu , Bin Gao , Tie-Yan Liu , Ying Zhang , Zhiming Ma , Shuyuan He , Hang Li, BrowseRank: letting web users vote for page importance, Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, July 20-24, 2008, Singapore, Singapore
[doi> 10.1145/1390334.1390412]
|
| |
14
|
P. Mayr. Website entries from a web log file perspective -- a new log file measure. In Proceedings of the AoIR-ASIST Workshop on Web Science Research Methods, 2004.
|
| |
15
|
G. L. Nemhauser and L. A. Wolsey. Best algorithms for approximating the maximum of a submodular set function. Mathematics of Operations Research, 3(3):177--188, 1978.
|
| |
16
|
G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of approximations for maximizing submodular set functions. Mathematical Programming, 14:265--294, 1978.
|
| |
17
|
|
 |
18
|
|
| |
19
|
|
 |
20
|
|
| |
21
|
|
 |
22
|
|
|