A space and time efficient algorithm for SimRank computation

Advances in Web Technologies and Applications - Proceedings of the 12th Asia-Pacific Web Conference, APWeb 2010

Volumn , Issue , 2010, Pages 164-170

  Yu, Weiren ^a   Lin, Xuemin ^b   Le, Jiajin ^a  

^a DONGHUA UNIVERSITY   (China)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Graph similarity; Link based analysis; Optimal algorithms; Sim rank

Indexed keywords

CONVERGENCE RATES; GRAPH MODEL; GRAPH SIMILARITY; HYPERLINKS; ITERATION COMPUTATION; ITERATION TECHNIQUES; OPTIMAL ALGORITHM; OPTIMIZATION TECHNIQUES; SPACE AND TIME; SPACE REQUIREMENTS; SYNTHETIC AND REAL DATA; TIME AND SPACE; TIME COMPLEXITY; WEB DOCUMENT; WORST CASE;

ALGORITHMS; COMPUTATION THEORY; CONVERGENCE OF NUMERICAL METHODS; HYPERTEXT SYSTEMS; OPTIMIZATION; WORLD WIDE WEB;

COMPUTATIONAL EFFICIENCY;

EID: 77954306427     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/APWeb.2010.42     Document Type: Conference Paper

References (20)

1. G. Jeh and J. Widom, "Simrank: a measure of structural-context similarity," in KDD, 2002.
2. A. Pathak, S. Chakrabarti, and M. S. Gupta, "Index design for dynamic personalized pagerank," in ICDE, 2008.
3. D. Fogaras and B. Rácz, "Scaling link-based similarity search," in WWW, 2005.
4. D. Fogaras and B. Racz, "A scalable randomized method to compute link-based similarity rank on the web graph," in EDBT Workshops, 2004.
5. D. Lizorkin, P. Velikhov, M. Grinev, and D. Turdakov, "Accuracy estimate and optimization techniques for simrank computation," PVLDB, vol.1, no.1, 2008.
6. E. F. D'Azevedo, M. R. Fahey, and R. T. Mills, "Vectorized sparse matrix multiply for compressed row storage format," in International Conference on Computational Science (1), 2005.
7. D. Coppersmith and S. Winograd, "Matrix multiplication via arithmetic progressions," J. Symb. Comput., vol.9, no.3, 1990.
8. J. Cohen and M. S. Roth, "On the implementation of strassen's fast multiplication algorithm," Acta Inf., vol.6, 1976.
9. D. Coppersmith and S. Winograd, "On the asymptotic complexity of matrix multiplication," SIAM J. Comput., vol.11, no.3, 1982.
10. W. M. Chan and A. George, "A linear time implementation of the reverse cuthill-mckee algorithm," BIT, vol.20, no.1, 1980.
11. A. Lim, B. Rodrigues, and F. Xiao, "Heuristics for matrix bandwidth reduction," European Journal of Operational Research, vol.174, no.1, 2006.
12. R. Bhatia, Matrix Analysis. Springer, 1997.
13. J. U. Quevedo and S.-H. S. Huang, "Similarity among web pages based on their link structure," in IKE, 2003.
14. R. M. Lawrence Page, Sergey brin and T. Winograd, "The pagerank citation ranking bringing order to the web," 1998, technial report.
15. B. H. Weinberg, "Bibliographic coupling: A review," Information Storage and Retrieval, vol.10, no.5-6, 1974.
16. D. T. Wijaya and S. Bressan, "Clustering web documents using co-citation, coupling, incoming, and outgoing hyperlinks: a comparative performance analysis of algorithms," IJWIS, vol.2, no.2, 2006.
17. A. O. Mendelzon, "Review - authoritative sources in a hyperlinked environment," ACM SIGMOD Digital Review, vol.1, 2000.
18. W. Xi, E. A. Fox, W. Fan, B. Zhang, Z. Chen, J. Yan, and D. Zhuang, "Simfusion: measuring similarity using unified relationship matrix," in SIGIR, 2005.
19. Y. Cai, P. Li, H. Liu, J. He, and X. Du, "S-simrank: Combining content and link information to cluster papers effectively and efficiently," in ADMA, 2008.
20. I. Antonellis, H. Garcia-Molina, and C.-C. Chang, "Simrank++: query rewriting through link analysis of the click graph," PVLDB, vol.1, no.1, 2008.