UCI P 104 - Improved Algorithms (8 pages)

Previewing pages 1, 2, 3 of 8 page document View the full content.
View Full Document

Improved Algorithms



Previewing pages 1, 2, 3 of actual document.

View the full content.
View Full Document
View Full Document

Improved Algorithms

5 views


Pages:
8
School:
University of California, Irvine
Course:
P 104 - Improved Algorithms for Topic Distillation in a Hyperlinked Environment
Improved Algorithms for Topic Distillation in a Hyperlinked Environment Documents

Unformatted text preview:

Improved Algorithms for Topic Distillation Environment Krishna Bharat Digital Equipment Corporation Systems Research Center 130 Lytton Avenue Palo Alto CA 94301 bharat pa dec com Abstract distillation This paper addresses the problem of topic on the World Wide Web namely given a typ ical 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 documents by at least 45 over pure connectivity analysis 1 Introduction Search services on the World Wide Web are the information retrieval systems that most people are familiar with As argued by Marchionini 23 end users want to achieve their goals with a minimum of cognitive load and a maximum of enjoyment Correspondingly in the context of Web searches we observe that users tend to type short queries one to three words 2 91 without giving much thought to query formulation Additionally it is often the case that users themselves are unclear about their information need 12 when framing the query Since determining relevance accurately under these circumstances is hard most search services are content to return exact query matches which may or may not satisfy the user s actual information need In this paper we describe a system that takes a somewhat different approach in the same context Given typical user queries on the World Wide Web i e short queries our system attempts to find quality documents related to the topic of the query Note that this is more general than finding a precise query match and not as ambitious as trying to exactly satisfy the user s information need The latter is often hard



View Full Document

Access the best Study Guides, Lecture Notes and Practice Exams

Loading Unlocking...
Login

Join to view Improved Algorithms and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Improved Algorithms and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?