Searching the Web oak搜索网页橡木.cs.ucla.pptVIP

Information Management on the World-Wide Web The Web and Information Galore 10 Years Ago With Web Challenges (1) Information overload Too much information, too little time Information Overload “XML” to Google 14 Million matching documents! “XML” to Amazon 464 matching books! Which one to read? Challenges (2) Hidden Web Not indexed by Search Engines “Hidden” from an average user Browse every site manually? Challenges (3) Transience Challenges (4) Scattered unstructured data All Computer Science faculty members and graduate students in the US? Projects In Our Group Web Archive Hidden Web Integration Page Ranking Algorithm User Recommendation System User Recommendation System 464 books on XML Which one to read? The one that my colleagues and friends recommend? Amazon’s Recommendation System 1 – 5 star rating by individual users Books can be sorted by “average user rating” My Typical Scenario Sort books by their average user rating Browse top 20 books to decide what to read Questions Is “5 star” by one user better than “4.9 star” by 100 users? Intuitively, I prefer 4.9 star by 100 users More “reliable” rating How much can I trust the rating of a particular person? How do I know that the person’s rating is reliable Our Approach “Inherent quality” or “rating” of a book How many users recommend the book (i.e., give high rating) if all users have read the book? More user rating ? More information on the “quality” of the book An average user is likely to give high rating for a high-quality book Probabilistic Rating Model How likely is the book of “4 star rating”? Rating probability distribution Update of Rating Probability As more users provide rating, we update our probability distribution Update of Rating Probability As more users provide rating, we update our probability distribution Update of Rating Probability As more users provide rating, we update our probability distribution Update of Rating Probability As more users provide rating, we update our probabilit