[{"publication":"Computer Networks","oa_version":"None","month":"05","keyword":["Search engines","Related pages","Searching paradigms"],"language":[{"iso":"eng"}],"type":"journal_article","date_published":"1999-05-17T00:00:00Z","publication_identifier":{"issn":["1389-1286"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","scopus_import":"1","_id":"11687","issue":"11-16","author":[{"last_name":"Dean","first_name":"Jeffrey","full_name":"Dean, Jeffrey"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"}],"date_created":"2022-07-29T06:55:26Z","article_processing_charge":"No","publication_status":"published","intvolume":"        31","title":"Finding related pages in the world wide Web","quality_controlled":"1","page":"1467-1479","publisher":"Elsevier","article_type":"original","citation":{"ista":"Dean J, Henzinger MH. 1999. Finding related pages in the world wide Web. Computer Networks. 31(11–16), 1467–1479.","mla":"Dean, Jeffrey, and Monika H. Henzinger. “Finding Related Pages in the World Wide Web.” <i>Computer Networks</i>, vol. 31, no. 11–16, Elsevier, 1999, pp. 1467–79, doi:<a href=\"https://doi.org/10.1016/s1389-1286(99)00022-5\">10.1016/s1389-1286(99)00022-5</a>.","short":"J. Dean, M.H. Henzinger, Computer Networks 31 (1999) 1467–1479.","ieee":"J. Dean and M. H. Henzinger, “Finding related pages in the world wide Web,” <i>Computer Networks</i>, vol. 31, no. 11–16. Elsevier, pp. 1467–1479, 1999.","chicago":"Dean, Jeffrey, and Monika H Henzinger. “Finding Related Pages in the World Wide Web.” <i>Computer Networks</i>. Elsevier, 1999. <a href=\"https://doi.org/10.1016/s1389-1286(99)00022-5\">https://doi.org/10.1016/s1389-1286(99)00022-5</a>.","apa":"Dean, J., &#38; Henzinger, M. H. (1999). Finding related pages in the world wide Web. <i>Computer Networks</i>. Elsevier. <a href=\"https://doi.org/10.1016/s1389-1286(99)00022-5\">https://doi.org/10.1016/s1389-1286(99)00022-5</a>","ama":"Dean J, Henzinger MH. Finding related pages in the world wide Web. <i>Computer Networks</i>. 1999;31(11-16):1467-1479. doi:<a href=\"https://doi.org/10.1016/s1389-1286(99)00022-5\">10.1016/s1389-1286(99)00022-5</a>"},"year":"1999","date_updated":"2022-09-12T09:12:21Z","day":"17","doi":"10.1016/s1389-1286(99)00022-5","abstract":[{"lang":"eng","text":"When using traditional search engines, users have to formulate queries to describe their information need. This paper discusses a different approach to Web searching where the input to the search process is not a set of query terms, but instead is the URL of a page, and the output is a set of related Web pages. A related Web page is one that addresses the same topic as the original page. For example, www.washingtonpost.com is a page related to www.nytimes.com, since both are online newspapers.\r\n\r\nWe describe two algorithms to identify related Web pages. These algorithms use only the connectivity information in the Web (i.e., the links between pages) and not the content of pages or usage information. We have implemented both algorithms and measured their runtime performance. To evaluate the effectiveness of our algorithms, we performed a user study comparing our algorithms with Netscape's `What's Related' service (http://home.netscape.com/escapes/related/). Our study showed that the precision at 10 for our two algorithms are 73% better and 51% better than that of Netscape, despite the fact that Netscape uses both content and usage pattern information in addition to connectivity information."}],"volume":31,"extern":"1"},{"issue":"11-16","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Heydon, Allan","last_name":"Heydon","first_name":"Allan"},{"full_name":"Mitzenmacher, Michael","last_name":"Mitzenmacher","first_name":"Michael"},{"full_name":"Najork, Marc","last_name":"Najork","first_name":"Marc"}],"scopus_import":"1","_id":"11688","intvolume":"        31","title":"Measuring index quality using random walks on the web","article_processing_charge":"No","date_created":"2022-07-29T07:00:28Z","publication_status":"published","quality_controlled":"1","page":"1291-1303","article_type":"original","publisher":"Elsevier","year":"1999","citation":{"ama":"Henzinger MH, Heydon A, Mitzenmacher M, Najork M. Measuring index quality using random walks on the web. <i>Computer Networks</i>. 1999;31(11-16):1291-1303. doi:<a href=\"https://doi.org/10.1016/s1389-1286(99)00016-x\">10.1016/s1389-1286(99)00016-x</a>","apa":"Henzinger, M. H., Heydon, A., Mitzenmacher, M., &#38; Najork, M. (1999). Measuring index quality using random walks on the web. <i>Computer Networks</i>. Elsevier. <a href=\"https://doi.org/10.1016/s1389-1286(99)00016-x\">https://doi.org/10.1016/s1389-1286(99)00016-x</a>","ieee":"M. H. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork, “Measuring index quality using random walks on the web,” <i>Computer Networks</i>, vol. 31, no. 11–16. Elsevier, pp. 1291–1303, 1999.","chicago":"Henzinger, Monika H, Allan Heydon, Michael Mitzenmacher, and Marc Najork. “Measuring Index Quality Using Random Walks on the Web.” <i>Computer Networks</i>. Elsevier, 1999. <a href=\"https://doi.org/10.1016/s1389-1286(99)00016-x\">https://doi.org/10.1016/s1389-1286(99)00016-x</a>.","short":"M.H. Henzinger, A. Heydon, M. Mitzenmacher, M. Najork, Computer Networks 31 (1999) 1291–1303.","mla":"Henzinger, Monika H., et al. “Measuring Index Quality Using Random Walks on the Web.” <i>Computer Networks</i>, vol. 31, no. 11–16, Elsevier, 1999, pp. 1291–303, doi:<a href=\"https://doi.org/10.1016/s1389-1286(99)00016-x\">10.1016/s1389-1286(99)00016-x</a>.","ista":"Henzinger MH, Heydon A, Mitzenmacher M, Najork M. 1999. Measuring index quality using random walks on the web. Computer Networks. 31(11–16), 1291–1303."},"date_updated":"2022-09-12T09:13:55Z","abstract":[{"lang":"eng","text":"Recent research has studied how to measure the size of a search engine, in terms of the number of pages indexed. In this paper, we consider a different measure for search engines, namely the quality of the pages in a search engine index. We provide a simple, effective algorithm for approximating the quality of an index by performing a random walk on the Web, and we use this methodology to compare the index quality of several major search engines."}],"day":"17","doi":"10.1016/s1389-1286(99)00016-x","extern":"1","volume":31,"publication":"Computer Networks","month":"05","oa_version":"None","keyword":["Search engines","Index quality","Random walks","PageRank"],"language":[{"iso":"eng"}],"type":"journal_article","date_published":"1999-05-17T00:00:00Z","publication_identifier":{"issn":["1389-1286"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public"}]