A Scalable Randomized Method to Compute Link-Based Similarity Rank on the Web Graph
- 1 January 2004
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Evaluating top-k queries over Web-accessible databasesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Algorithms for Memory HierarchiesPublished by Springer Nature ,2003
- Link Information as a Similarity Measure in Web ClassificationPublished by Springer Nature ,2003
- I/O-efficient techniques for computing pagerankPublished by Association for Computing Machinery (ACM) ,2002
- Self-organization and identification of Web communitiesComputer, 2002
- ANFPublished by Association for Computing Machinery (ACM) ,2002
- Evaluating strategies for similarity search on the webPublished by Association for Computing Machinery (ACM) ,2002
- Authoritative sources in a hyperlinked environmentJournal of the ACM, 1999
- The anatomy of a large-scale hypertextual Web search engineComputer Networks and ISDN Systems, 1998