A scalable randomized method to compute link-based similarity rank on the web graph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3268, Issue , 2004, Pages 557-567

  Fogaras, Dániel ^a,b   Rácz, Balázs ^a,b  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; HYPERTEXT SYSTEMS; ITERATIVE METHODS; WEBSITES; MONTE CARLO METHODS;

ALGORITHM COMPUTING; HYPERLINKS; LINK-BASED; RANDOMIZED METHOD; SCALABLE ALGORITHMS; SIMILARITY FUNCTIONS; SIMILARITY MEASURE; SIMRANK; WEB GRAPHS; WEB-PAGE; HYPERLINK STRUCTURE; INDEXING TECHNIQUES; PARALLELIZATION TECHNIQUES;

MONTE CARLO METHODS; ITERATIVE METHODS;

EID: 34250725631     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30192-9_55     Document Type: Article

References (20)

1. P. Berkhin. Survey of clustering data mining techniques. Technical report, Accrue Software, San Jose, CA, 2002.
2. E. Brewer. Lessons from giant-scale services.
3. S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30(1-7):107-117, 1998.
4. A. Broder. On the resemblance and containment of documents. In Proceedings of the Compression and Complexity of Sequences 1997, page 21. IEEE Computer Society, 1997.
5. N. Bruno, L. Gravano, and A. Marian. Evaluating top-k queries over web-accessible databases. In Proceedings of the ICDE Conference, 2002.
6. Y. Y. Chen, Q. Gan, and T. Suel. I/O-efficient techniques for computing PageRank. In Proceedings of the eleventh international conference on Information and knowledge management, pages 549-557. ACM Press, 2002.
7. M. Cristo, P. Calado, E.S. de Moura, N. Ziviani, and B. Ribeiro-Neto. Link information as a similarity measure in web classification. In String Processing and Information Retrieval, pages 43-55. Springer LNCS 2857, 2003.
8. J. Dean and M. R. Henzinger. Finding related pages in the World Wide Web. Computer Networks (Amsterdam, Netherlands: 1999), 31(11-16):1467-1479, 1999.
9. G. Flake, S. Lawrence, C. L. Giles, and E Coetzee. Self-organization of the web and identification of communities. IEEE Computer, 35(3):66-71, 2002.
10. T. H. Haveliwala, A. Gionis, D. Klein, and P. Indyk. Evaluating strategies for similarity search on the web. In Proceedings of the 11th World Wide Web Conference (WWW), pages 432-442. ACM Press, 2002.
11. N. Heintze. Scalable document fingerprinting. In 7990 USENIX Workshop on Electronic Commerce, November 1996.
12. G. Jeh and J. Widom. SimRank: A measure of structural-context similarity. In Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2002.
13. J. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, 1999.
14. W. Lu, J. Janssen, E. Milios, and N. Japkowicz. Node similarity in networked information spaces. In Proceedings of the 2001 conference of the Centre for Advanced Studies on Collaborative research, page 11. IBM Press, 2001.
15. U. Meyer, P. Sanders, and J. Sibeyn. Algorithms for Memory Hierarchies, Advanced Lectures. LNCS, Springer, 2003.
16. Open Directory Project (ODP). http://www.dmoz.org.
17. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.
18. C. R. Palmer, P. B. Gibbons, and C. Faloutsos. ANF: a fast and scalable tool for data mining in massive graphs. In Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 81-90. ACM Press, 2002.
19. J. S. Rosenthal. Parallel computing and Monte Carlo algorithms. Far East J. Theor. Stat., 4:207-236, 2000.
20. I. H. Witten, A. Moffat, and T. C. Bell. Managing gigabytes (2nd ed.): Compressing and indexing documents and images. Morgan Kaufmann Publishers Inc., 1999.