Enter Domain Name:

Top / Computers / Software / Information_Retrieval / Ranking / By_Context /

PageRank Computation Methods
A poster paper by Stanford db group which describes iterative methods for calculating PageRank.
http://www2002.org/CDROM/poster/173.pdf
Www2002.org  ~   Site Info   Whois   Trace Route   RBL Check  
What is this Page Known for? Computing Web Page Reputations,
PageRank and Hub and Authority generalization based on the topic of Web Pages. Definition of a model where a surfer can move forward (following an out-going link) and backward (following an in-going link in the inverse direction). [PS format]
http://www.cs.ualberta.ca/~drafiei/papers/www9.ps
Ualberta.ca  ~   Site Info   Whois   Trace Route   RBL Check  
Authoritative Sources in a Hyperlinked Environment
HITs is a link-structure analysis algorithm which ranks pages by "authorities" (pages which have many incoming links and provide the best source of information on a given topic) and "hubs" (pages which have many outgoing links and pro
http://www.cs.cornell.edu/home/kleinber/auth.pdf
Cornell.edu  ~   Site Info   Whois   Trace Route   RBL Check  
The Clever Project
The CLEVER search engine incorporates several algorithms that make use of hyperlink structure for discovering information on the Web. It is an extension of Hits method.
http://www.almaden.ibm.com/cs/k53/clever.html
Ibm.com  ~   Site Info   Whois   Trace Route   RBL Check  
SALSA: The Stochastic Approach for Link-Structure Analysis
A focused search algorithm (SALSA) based on Markov chains. It starts with a query on a broad topic, discards useless links, and then weights the remaining terms. A stochastic crawl is used to discover the authorities on this topic. [PS format]
http://www.cs.technion.ac.il/~moran/r/PS/lm-feb01.ps
Technion.ac.il  ~   Site Info   Whois   Trace Route   RBL Check  
The Intelligent Surfer: Probabilistic Combination of Link and Content Information in PageRank
This method uses query dependent importance scores and a probabilistic approach to improve upon PageRank. It pre-computes importance scores offline for every possible text query.
http://www.cs.washington.edu/homes/pedrod/papers/nips01b.pdf
Washington.edu  ~   Site Info   Whois   Trace Route   RBL Check  
Web Page Scoring Systems for Horizontal and Vertical Search
"Random Surfer" model extension. At each step of traversal of the Web graph, the surfer can jump to a random node or follow a hyperlink or follow a back-link (a hyperlink in the inverse direction) or stay in the same node.
http://www2002.org/CDROM/refereed/629/
Www2002.org  ~   Site Info   Whois   Trace Route   RBL Check  
A Significant Improvement to Clever Algorithm in Hyperlinked Environment
Paper by Minhua Wang describing an improvement to Kleimberg's algorithm.
http://www2002.org/CDROM/poster/171.pdf
Www2002.org  ~   Site Info   Whois   Trace Route   RBL Check  
PageRank: A Circuital Analysis
It shows some theoretical results for understanding the distribution of the score in the Web according to PageRank. Seven golden rules for building good pages are presented.
http://www2002.org/CDROM/poster/165.pdf
Www2002.org  ~   Site Info   Whois   Trace Route   RBL Check  
Improvement of HITS-based Algorithms on Web Documents
It proposes a new weighted HITS-based method that assigns appropriate weights to in-links of root documents and combines content analysis with HITS-based algorithms.
http://www2002.org/CDROM/refereed/643/
Www2002.org  ~   Site Info   Whois   Trace Route   RBL Check  
 


Page 1/3« Previous123Next »