The Importance of Prior Probabilities for Entry Page Search (2002)
Cached
Download Links
- [homepages.cwi.nl]
- [janus.cs.utwente.nl]
- [wwwhome.cs.utwente.nl]
- [dis.tpd.tno.nl]
- DBLP
Other Repositories/Bibliography
| Venue: | PROCEEDINGS OF THE 25TH ANNUAL INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL |
| Citations: | 114 - 16 self |
BibTeX
@INPROCEEDINGS{Kraaij02theimportance,
author = {Wessel Kraaij and Thijs Westerveld and Djoerd Hiemstra},
title = {The Importance of Prior Probabilities for Entry Page Search },
booktitle = {PROCEEDINGS OF THE 25TH ANNUAL INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL},
year = {2002},
pages = {27--34},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
An important class of searches on the world-wide-web has the goal to find an entry page (homepage) of an organisation. Entry page search is quite different from Ad Hoc search. Indeed a plain Ad Hoc system performs disappointingly. We explored three non-content features of web pages: page length, number of incoming links and URL form. Especially the URL form proved to be a good predictor. Using URL form priors we found over 70% of all entry pages at rank 1, and up to 89% in the top 10. Non-content features can easily be embedded in a language model framework as a prior probability.
