Beyond Pagerank: Machine Learning for Static Ranking

Beyond Pagerank: Machine Learning for Static Ranking

Introduction PageRank Algorithm fRank Algorithm Experimental Results Conclusions and Future Work My Review Beyond PageRank: Machine Learning for Static Ranking Matthew Richardson1, Amit Prakash1 Eric Brill2 1Microsoft Research 2MSN World Wide Web Conference, 2006 Presented by Srinivas Pasupuleti Beyond PageRank: Machine Learning for Static Ranking Introduction PageRank Algorithm fRank Algorithm Experimental Results Conclusions and Future Work My Review Outline 1 Introduction 2 PageRank Algorithm 3 fRank Algorithm 4 Experimental Results 5 Conclusions and Future Work 6 My Review Presented by Srinivas Pasupuleti Beyond PageRank: Machine Learning for Static Ranking Introduction PageRank Algorithm fRank Algorithm Experimental Results Conclusions and Future Work My Review Introduction Types of Ranking Dynamic Ranking Query-dependent ranking Focussed on improving the ordering of results returned to user Static Ranking Query-independent ranking Presented by Srinivas Pasupuleti Beyond PageRank: Machine Learning for Static Ranking fRank Machine Learning Approach Ranking based on many features besides the PageRank 100 times faster in computation compared to PageRank Introduction PageRank Algorithm fRank Algorithm Experimental Results Conclusions and Future Work My Review Introduction Ranking Algorithms PageRank A Single measure - Easier to manipulate by spammers Computationally very expensive Presented by Srinivas Pasupuleti Beyond PageRank: Machine Learning for Static Ranking Introduction PageRank Algorithm fRank Algorithm Experimental Results Conclusions and Future Work My Review Introduction Ranking Algorithms PageRank A Single measure - Easier to manipulate by spammers Computationally very expensive fRank Machine Learning Approach Ranking based on many features besides the PageRank 100 times faster in computation compared to PageRank Presented by Srinivas Pasupuleti Beyond PageRank: Machine Learning for Static Ranking Introduction PageRank Algorithm fRank Algorithm Experimental Results Conclusions and Future Work My Review PageRank Algorithm (1 − α) P(i) P(j) = + αΣi∈Bj (1) N |Fi | P(j) is the page rank score of page j Fi is the set of pages that page i links to Bj is the set of pages that link to j Presented by Srinivas Pasupuleti Beyond PageRank: Machine Learning for Static Ranking Introduction PageRank Algorithm fRank Algorithm Experimental Results Conclusions and Future Work My Review fRank Algorithm Feature Set PageRank Popularity Anchor text and inlinks Page-level and Domain-level features Presented by Srinivas Pasupuleti Beyond PageRank: Machine Learning for Static Ranking Introduction PageRank Algorithm fRank Algorithm Experimental Results Conclusions and Future Work My Review fRank Algorithm Z = {< i, j >} be a collection of pairs of items, where item i should be assigned a higher value than item j. Goal: Learn a function f such that, ∀ < i, j >∈ Z, f (xi ) > f (xj ) Ranking function is modeled by fully connected 2 layer neural network with 10 hidden nodes Presented by Srinivas Pasupuleti Beyond PageRank: Machine Learning for Static Ranking Introduction PageRank Algorithm fRank Algorithm Experimental Results Conclusions and Future Work My Review Experimental setup Training set Human judgements for 28000 queries resulting in an average of 18 ratings per query. The network is trained with 5 million pairings of web pages, where one page had a higher rating than the other Performance Measure Pairwise accuracy defined as the fraction of time that the ranking algorithm and human judges agree on ordering of a pair of web pages. Presented by Srinivas Pasupuleti Beyond PageRank: Machine Learning for Static Ranking Introduction PageRank Algorithm fRank Algorithm Experimental Results Conclusions and Future Work My Review Results Table: Basic Results Technique Accuracy(%) PageRank 56.70 fRank 67.43 Presented by Srinivas Pasupuleti Beyond PageRank: Machine Learning for Static Ranking Introduction PageRank Algorithm fRank Algorithm Experimental Results Conclusions and Future Work My Review Results Table: Results for individual feature sets Feature Set Accuracy(%) PageRank 56.70 Popularity 60.82 Anchor 59.09 Page 63.93 Domain 59.03 All Features 67.43 Presented by Srinivas Pasupuleti Beyond PageRank: Machine Learning for Static Ranking Introduction PageRank Algorithm fRank Algorithm Experimental Results Conclusions and Future Work My Review Results Table: fRank performance as feature sets are added. At each row, the feature set that gave the greatest increase in accuracy was added to the list of features (i.e., we conducted a greedy search over feature sets) Feature Set Accuracy (%) None 50.00 +Page 63.93 +Popularity 66.83 +Anchor 67.25 +PageRank 67.31 +Domain 67.43 Presented by Srinivas Pasupuleti Beyond PageRank: Machine Learning for Static Ranking Introduction PageRank Algorithm fRank Algorithm Experimental Results Conclusions and Future Work My Review Results Table: Top ten URLs for PageRank vs. fRank PageRank fRank(%) google.com google.com apple.com/quicktime/download yahoo.com amazon.com americanexpress.com yahoo.com hp.com microsoft.com/windows/ie target.com apple.com/quicktime bestbuy.com mapquest.com dell.com ebay.com autotrader.com mozilla.org/products/firefox dogpile.com ftc.gov bankofamerica.com Presented by Srinivas Pasupuleti Beyond PageRank: Machine Learning for Static Ranking Introduction PageRank Algorithm fRank Algorithm Experimental Results Conclusions and Future Work My Review Conclusions and Future Work Conclusions PageRank doesn’t provide good static ranking fRank achieves higher pairwise accuracy Page-level and popularity features are the significant contributors Ordering using fRank correspond to what Web users, rather than Web page authors, prefer Presented by Srinivas Pasupuleti Beyond PageRank: Machine Learning for Static Ranking Introduction PageRank Algorithm fRank Algorithm Experimental Results Conclusions and Future Work My Review Conclusions and Future Work Future Work Many more features can be included Existence, or lack there of certain words (“under construction”) Number of images in a page, size of those images Searching habits of users, by time of the day Incorporating fRank and page-level features directly into the PageRank computation Presented by Srinivas Pasupuleti Beyond PageRank: Machine Learning for Static Ranking Introduction PageRank Algorithm fRank Algorithm Experimental Results Conclusions and Future Work My Review My Review Need of more intuitive way of collecting training data “popularity” and PageRank generally go together Behavior of Web User and Web Author is not independent Presented by Srinivas Pasupuleti Beyond PageRank: Machine Learning for Static Ranking Appendix For Further Reading References Matthew Richardson, Amit Prakash and Eric Brill. Beyond PageRank: Machine Learning for Static Ranking WWW 2006 Chris Burges, Tal Shaked et.al Learning to Rank using Gradient Descent ICML 2005 Lawrence Page, Sergey Brin, Rajeev Motwani and Terry Winograd The PageRank Citation Ranking: Bringing Order to the Web TR, Stanford 1998 Presented by Srinivas Pasupuleti Beyond PageRank: Machine Learning for Static Ranking.

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    17 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us