Exploiting site-level information to improve web search

A Broder, E Gabrilovich, V Josifovski… - Proceedings of the 19th …, 2010 - dl.acm.org
A Broder, E Gabrilovich, V Josifovski, G Mavromatis, D Metzler, J Wang
Proceedings of the 19th ACM international conference on Information and …, 2010dl.acm.org
Ranking Web search results has long evolved beyond simple bag-of-words retrieval models.
Modern search engines routinely employ machine learning ranking that relies on
exogenous relevance signals. Yet the majority of current methods still evaluate each Web
page out of context. In this work, we introduce a novel source of relevance information for
Web search by evaluating each page in the context of its host Web site. For this purpose, we
devise two strategies for compactly representing entire Web sites. We formalize our …
Ranking Web search results has long evolved beyond simple bag-of-words retrieval models. Modern search engines routinely employ machine learning ranking that relies on exogenous relevance signals. Yet the majority of current methods still evaluate each Web page out of context. In this work, we introduce a novel source of relevance information for Web search by evaluating each page in the context of its host Web site. For this purpose, we devise two strategies for compactly representing entire Web sites. We formalize our approach by building two indices, a traditional page index and a new site index, where each "document" represents the an entire Web site. At runtime, a query is first executed against both indices, and then the final page score for a given query is produced by combining the scores of the page and its site. Experimental results carried out on a large-scale Web search test collection from a major commercial search engine confirm the proposed approach leads to consistent and significant improvements in retrieval effectiveness.
ACM Digital Library