{"date_updated":"2023-02-17T14:47:44Z","status":"public","day":"01","extern":"1","language":[{"iso":"eng"}],"_id":"11897","year":"2003","publication_status":"published","quality_controlled":"1","publication_identifier":{"issn":["01635840"],"isbn":["978-1-58113-015-7"]},"conference":{"start_date":"1998-08-24","location":"Melbourne, Australia","name":"SIGIR: International Conference on Research and Development in Information Retrieval","end_date":"1998-08-28"},"type":"conference","publication":"21st annual international ACM SIGIR conference on Research and development in information retrieval","doi":"10.1145/290941.290972","article_processing_charge":"No","title":"Improved algorithms for topic distillation in a hyperlinked environment","oa_version":"None","date_published":"2003-08-01T00:00:00Z","page":"104–111","date_created":"2022-08-17T08:56:18Z","scopus_import":"1","publisher":"Association for Computing Machinery","abstract":[{"text":"This paper addresses the problem of topic distillation on the World Wide Web, namely, given a typical user query to find quality documents related to the query topic. Connectivity analysis has been shown to be useful in identifying high quality pages within a topic specific graph of hyperlinked documents. The essence of our approach is to augment a previous connectivity analysis based algorithm with content analysis. We identify three problems with the existing approach and devise algorithms to tackle them. The results of a user evaluation are reported that show an improvement of precision at 10\r\ndocuments by at least 45% over pure connectivity analysis. ","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","author":[{"full_name":"Bharat, Krishna","first_name":"Krishna","last_name":"Bharat"},{"orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"}],"citation":{"short":"K. Bharat, M.H. Henzinger, in:, 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Association for Computing Machinery, 2003, pp. 104–111.","mla":"Bharat, Krishna, and Monika H. Henzinger. “Improved Algorithms for Topic Distillation in a Hyperlinked Environment.” <i>21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</i>, Association for Computing Machinery, 2003, pp. 104–111, doi:<a href=\"https://doi.org/10.1145/290941.290972\">10.1145/290941.290972</a>.","apa":"Bharat, K., &#38; Henzinger, M. H. (2003). Improved algorithms for topic distillation in a hyperlinked environment. In <i>21st annual international ACM SIGIR conference on Research and development in information retrieval</i> (pp. 104–111). Melbourne, Australia: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/290941.290972\">https://doi.org/10.1145/290941.290972</a>","ieee":"K. Bharat and M. H. Henzinger, “Improved algorithms for topic distillation in a hyperlinked environment,” in <i>21st annual international ACM SIGIR conference on Research and development in information retrieval</i>, Melbourne, Australia, 2003, pp. 104–111.","ista":"Bharat K, Henzinger MH. 2003. Improved algorithms for topic distillation in a hyperlinked environment. 21st annual international ACM SIGIR conference on Research and development in information retrieval. SIGIR: International Conference on Research and Development in Information Retrieval, 104–111.","ama":"Bharat K, Henzinger MH. Improved algorithms for topic distillation in a hyperlinked environment. In: <i>21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</i>. Association for Computing Machinery; 2003:104–111. doi:<a href=\"https://doi.org/10.1145/290941.290972\">10.1145/290941.290972</a>","chicago":"Bharat, Krishna, and Monika H Henzinger. “Improved Algorithms for Topic Distillation in a Hyperlinked Environment.” In <i>21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</i>, 104–111. Association for Computing Machinery, 2003. <a href=\"https://doi.org/10.1145/290941.290972\">https://doi.org/10.1145/290941.290972</a>."}}