Parallel SimRank computation on large graphs with iterative aggregation

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2010, Pages 543-552

  He, Guoming ^a   Feng, Haijun ^a   Li, Cuiping ^a   Chen, Hong ^a  

^a Beijing Key Laboratory of Big Data Management and Analysis Methods   (China)

Author keywords

GPU; Graph; Iterative aggregation; Parallel; SimRank

Indexed keywords

GPU; GRAPH; ITERATIVE AGGREGATION; PARALLEL; SIMRANK;

GRAPH THEORY; GRAPHIC METHODS; MARKOV PROCESSES; PROGRAM PROCESSORS;

ITERATIVE METHODS;

EID: 77956216757     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835804.1835874     Document Type: Conference Paper

References (41)

1. L. Backstrom, D. Huttenlocher, and J. Kleinberg. Group formation in large social networks: membership, growth, and evolution. In Proc. of the 12th Int'l Conference on Knowledge discovery and data mining(KDD'06), 2006.
2. N. Bell and M. Garland. Efficient sparse matrix-vector multiplication on cuda. In Technical Report NVR-2008-004, 2008.
3. A. Buluç and J. R. Gilbert. Challenges and advances in parallel sparse matrix-matrix multiplication. In ICPP '08: Proceedings of the 2008 37th International Conference on Parallel Processing, pages 503-510, Washington, DC, USA, 2008. IEEE Computer Society.
4. L. S. Buriol, C. Castillo, D. Donato, S. Leonardi, and S. Millozzi. Temporal analysis of the wikigraph. In WI '06: Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence, pages 45-51, Washington, DC, USA, 2006. IEEE Computer Society.
5. Y. Chi, X. Song, D. Zhou, K. Hino, and B. L. Tseng. Evolutionary spectral clustering by incorporating temporal smoothness. In Proc. of the 13th Int'l Conference on Knowledge discovery and data mining(KDD'07), 2007.
6. S. Ding, J. He, H. Yan, and T. Suel. Using graphics processors for high performance ir query processing. In WWW '09: Proceedings of the 18th international conference on World wide web, pages 421-430, New York, NY, USA, 2009. ACM.
7. C. Faloutsos, K. S. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. In KDD '04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 118-127, New York, NY, USA, 2004. ACM.
8. W. Fang, K. K. Lau, M. Lu, X. Xiao, C. K. Lam, P. Y. Yang, B. He, Q. Luo, P. V. Sander, and K. Yang. Parallel data mining on graphic processors. In Technical Report HKUST-CS09-07.
9. D. Fogaras and B. Racz. Scaling link-based similarity search. In Proc. of the 14th Int'l Conference on World Wide Web (WWW'05), 2005.
10. D. Fogaras and B. Rácz. Scaling link-based similarity search. In WWW '05: Proceedings of the 14th international conference on World Wide Web, pages 641-650, New York, NY, USA, 2005. ACM.
11. P. Ganesan, H. Garcia-Molina, and J. Widom. Exploiting hierarchical domain structure to compute similarity. ACM Trans. Inf. Syst., 21(1):64-93, 2003.
12. V. Garcia, E. Debreuve, and M. Barlaud. Fast k nearest neighbor search using gpu. CoRR, abs/0804.1448, 2008.
13. M. Girvan and M. Newman. Community structure in social and biological networks. In Proc. Of the National Academy of Sciences, 2002.
14. N. K. Govindaraju, J. Gray, R. Kumar, and D. Manocha. Gputerasort: high performance graphics co-processor sorting for large database management. In SIGMOD '06: Proceedings of the 2006 ACM SIGMOD international conference on Management of data, pages 325-336, New York, NY, USA, 2006. ACM.
15. N. K. Govindaraju, N. Raghuvanshi, and D. Manocha. Fast and approximate stream mining of quantiles and frequencies using graphics processors. In SIGMOD '05: Proceedings of the 2005 ACM SIGMOD international conference on Management of data, pages 611-622, New York, NY, USA, 2005. ACM.
16. B. He, K. Yang, R. Fang, M. Lu, N. K. Govindaraju, Q. Luo, and P. V. Sander. Relational joins on graphics processors. In SIGMOD '08: Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pages 511-524, New York, NY, USA, 2008. ACM.
17. G. Jeh and J. Widom. Simrank: a measure of structural-context similarity. In KDD '02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 538-543, New York, NY, USA, 2002. ACM.
18. J. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 1999.
19. Y. Koren, S. C. North, and C. Volinsky. Measuring and extracting proximity in networks. In KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 245-255, New York, NY, USA, 2006. ACM.
20. A. N. Langville and C. D. Meyer. Updating pagerank with iterative aggregation. In WWW Alt. '04: Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters, pages 392-393, New York, NY, USA, 2004. ACM.
21. A. N. Langville and C. D. Meyer. Updating markov chains with an eye on google's pagerank. SIAM J. Matrix Anal. Appl., 27(4):968-987, 2006.
22. E. A. Leicht, P. Holme, and M. E. J. Newman. Vertex similarity in networks. Physical Review E, 73:026120, 2006.
23. J. Leskovec, J. M. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In Proc. of the 13th Int'l Conference on Knowledge discovery and data mining(KDD'07), 2007.
24. M. Ley. Dblp: some lessons learned. Proc. VLDB Endow., 2(2):1493-1500, 2009.
25. C. Li, J. Han, G. He, X. Jin, Y. Sun, Y. Yu, and T. Wu. Fast computation of simrank for static and dynamic information networks. In EDBT'10, 2010.
26. D. Lizorkin, P. Velikhov, M. Grinev, and D. Turdakov. Accuracy estimate and optimization techniques for simrank computation. In Proc. of the 34st Int'l Conference on Very Large Databases (VLDB'08), 2008.
27. D. Lizorkin, P. Velikhov, M. N. Grinev, and D. Turdakov. Accuracy estimate and optimization techniques for simrank computation. Proc. VLDB Endow., 1(1):422-433, 2008.
28. A. G. Maguitman, F. Menczer, F. Erdinc, H. Roinestad, and A. Vespignani. Algorithmic computation and approximation of semantic similarity. World Wide Web, 9(4):431-456, 2006.
29. I. Marek, P. Mayer, and I. Pultarova. Convergence issues in the theory and practice of iterative aggregation/disagrregation methods. Electronic Transactions on Numerical Analysis, 35:185-200, 2009.
30. M.E.J. Newman. The structure and function of complex netwroks. SIAM Review, 2003.
31. C. D. Meyer. Stochastic complementation, uncoupling markov chains, and the theory of nearly reducible systems. SIAM Review, 31(2):240-272, 1989.
32. A. Ng, M. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In Proc. Of the Advances in Neural Information Processing Systems(NIPS), 2002.
33. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford University Database Group, http://citeseer.nj.nec.com/368196.html, 1998.
34. J. Sun, D. Tao, and C. Faloutsos. Beyond streams and graphs: dynamic tensor analysis. In Proc. of the 12th Int'l Conference on Knowledge discovery and data mining(KDD'06), 2006.
35. Y. Takahashi. A lumping method for numerical calculations of stationary distributions of markov chains. 1975.
36. C. Tantipathananandh, T. Y. Berger-Wolf, and D. Kempe. A framework for community identification in dynamic social networks. In Proc. of the 13th Int'l Conference on Knowledge discovery and data mining(KDD'07), 2007.
37. H. Tong, S. Papadimitriou, P. S. Yu, and C. Faloutsos. Proximity tracking on time-evolving bipartite graphs. In Proc. of SDM, 2008.
38. 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 '05: Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval, pages 130-137, New York, NY, USA, 2005. ACM.
39. X. Yan and J. Han. Closegraph: Mining closed frequent graph patterns. In Proc. of the 9th Int'l Conference on Knowledge discovery and data mining(KDD'03), 2003.
40. X. Yan, P. S. Yu, and J. Han. Substructure similarity search in graph databases. In Proc. Of ACM-SIGMOD Int'l Conference on Management of Data, 2005.
41. Y. Zhu, S. Ye, and X. Li. Distributed pagerank computation based on iterative aggregation-disaggregation methods. In CIKM '05, pages 578-585, New York, NY, USA, 2005. ACM.