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.
%0 Conference Paper
%1 citeulike:4384556
%A Chakrabarti, Deepayan
%A Kumar, Ravi
%A Punera, Kunal
%B WWW '09: Proceedings of the 18th international conference on World wide web
%C New York, NY, USA
%D 2009
%I ACM
%K clicks, hci, queries
%P 391--400
%R 10.1145/1526709.1526762
%T Quicklink selection for navigational query results
%U http://dx.doi.org/10.1145/1526709.1526762
%X 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.
%@ 978-1-60558-487-4
@inproceedings{citeulike:4384556,
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.},
added-at = {2009-08-06T15:16:38.000+0200},
address = {New York, NY, USA},
author = {Chakrabarti, Deepayan and Kumar, Ravi and Punera, Kunal},
biburl = {https://www.bibsonomy.org/bibtex/26fbc725180a4cf9a708ed9b21ae6db39/chato},
booktitle = {WWW '09: Proceedings of the 18th international conference on World wide web},
citeulike-article-id = {4384556},
citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1526709.1526762},
citeulike-linkout-1 = {http://dx.doi.org/10.1145/1526709.1526762},
doi = {10.1145/1526709.1526762},
interhash = {13e1fab6590d1f7fb122e2e04e921176},
intrahash = {6fbc725180a4cf9a708ed9b21ae6db39},
isbn = {978-1-60558-487-4},
keywords = {clicks, hci, queries},
location = {Madrid, Spain},
pages = {391--400},
posted-at = {2009-04-23 11:47:49},
priority = {0},
publisher = {ACM},
timestamp = {2009-08-06T15:16:42.000+0200},
title = {Quicklink selection for navigational query results},
url = {http://dx.doi.org/10.1145/1526709.1526762},
year = 2009
}