BEAR: Block elimination approach for random walk with restart on large graphs

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn 2015-May, Issue , 2015, Pages 1571-1585

  Shin, Kijung ^a   Jung, Jinhong ^b   Sael, Lee ^c   Kang, U ^b  

^a Seoul National University   (South Korea)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^c State University of New York   (South Korea)

Author keywords

Proximity; Random walk with restart; Relevance score

Indexed keywords

DATA MINING; RANDOM PROCESSES;

COMMUNITY DETECTION; DATA MINING APPLICATIONS; PRE-PROCESSING METHOD; PRE-PROCESSING STEP; PROXIMITY; RANDOM WALK WITH RESTART; RELEVANCE SCORE; STATE-OF-THE-ART METHODS;

MATRIX ALGEBRA;

EID: 84957598819     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2723372.2723716     Document Type: Conference Paper

References (46)

1. L. A. Adamic and E. Adar. Friends and neighbors on the web. Social Networks, 25(3):211-230, 2003.
2. R. Albert, H. Jeong, and A.-L. Barabasi. Error and attack tolerance of complex networks. Nature, 406(6794):378-382, 2000.
3. R. Andersen, F. Chung, and K. Lang. Local graph partitioning using pagerank vectors. In FOCS, pages 475-486, 2006.
4. R. Andersen, D. F. Gleich, and V. Mirrokni. Overlapping clusters for distributed computation. In WSDM, pages 273-282, 2012.
5. I. Antonellis, H. G. Molina, and C. C. Chang. Simrank++: Query rewriting through link analysis of the click graph. PVLDB, 1(1):408-421, 2008.
6. L. Backstrom and J. Leskovec. Supervised random walks: Predicting and recommending links in social networks. In WSDM, pages 635-644, 2011.
7. A. Balmin, V. Hristidis, and Y. Papakonstantinou. Objectrank: Authority-based keyword search in databases. In VLDB, pages 564-575, 2004.
8. S. Banerjee and A. Roy. Linear Algebra and Matrix Analysis for Statistics. CRC Press, 2014.
9. P. Bogdanov and A. Singh. Accurate and scalable nearest neighbors in large networks based on effective importance. In CIKM, pages 1009-1018, 2013.
10. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2009.
11. D. Chakrabarti, S. Papadimitriou, D. S. Modha, and C. Faloutsos. Fully automatic cross-associations. In KDD, pages 79-88, 2004.
12. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-mat: A recursive model for graph mining. In SDM, volume 4, pages 442-446, 2004.
13. S. Chakrabarti, A. Pathak, and M. Gupta. Index design and query processing for graph conductance search. PVLDB, 20(3):445-470, 2011.
14. F. Chierichetti, R. Kumar, S. Lattanzi, M. Mitzenmacher, A. Panconesi, and P. Raghavan. On compressing social networks. In KDD, pages 219-228, 2009.
15. P. G. Doyle and J. L. Snell. Random walks and electric networks. AMC, 10:12, 1984.
16. Y. Fujiwara, M. Nakatsuji, M. Onizuka, and M. Kitsuregawa. Fast and exact top-k search for random walk with restart. PVLDB, 5(5):442-453, 2012.
17. Y. Fujiwara, M. Nakatsuji, T. Yamamuro, H. Shiokawa, and M. Onizuka. Efficient personalized pagerank with accuracy assurance. In KDD, pages 15-23, 2012.
18. D. Gleich and M. Polito. Approximating personalized pagerank with minimal use of web graph data. Internet Mathematics, 3(3):257-294, 2006.
19. D. F. Gleich and C. Seshadhri. Vertex neighborhoods, low conductance cuts, and good seeds for local community methods. In KDD, pages 597-605, 2012.
20. M. Gupta, A. Pathak, and S. Chakrabarti. Fast algorithms for topk personalized pagerank queries. In WWW, pages 1225-1226, 2008.
21. J. He, M. Li, H.-J. Zhang, H. Tong, and C. Zhang. Manifold-ranking based image retrieval. In ACM Multimedia, pages 9-16, 2004.
22. G. Jeh and J. Widom. Simrank: a measure of structural-context similarity. In KDD, pages 538-543, 2002.
23. U. Kang and C. Faloutsos. Beyond 'caveman communities': Hubs and spokes for graph compression and mining. In ICDM, pages 300-309, 2011.
24. U. Kang and C. Faloutsos. Big graph mining: algorithms and discoveries. SIGKDD Explorations, 14(2):29-36, 2012.
25. U. Kang, H. Tong, and J. Sun. Fast random walk graph kernel. 2012.
26. G. Kasneci, S. Elbassuoni, and G. Weikum. Ming: mining informative entity relationship subgraphs. In CIKM, pages 1653-1656, 2009.
27. A. N. Langville and C. D. Meyer. Google's PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, 2011.
28. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 6(1):29-123, 2009.
29. D. Liben-Nowell and J. Kleinberg. The link-prediction problem for social networks. J. Amer. Soc. Inf. Sci. and Tech, 58(7):1019-1031, 2007.
30. Y. Lim, U. Kang, and C. Faloutsos. Slashburn: Graph compression and mining beyond caveman communities. IEEE Trans. Knowl. Data Eng., 26(12):3077-3089, 2014.
31. Z. Lin, M. R. Lyu, and I. King. Matchsim: a novel neighbor-based similarity measure with maximum neighborhood matching. In CIKM, pages 1613-1616, 2009.
32. A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. NIPS, 2:849-856, 2002.
33. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford University, 1999.
34. J.-Y. Pan, H.-J. Yang, C. Faloutsos, and P. Duygulu. Automatic multimedia cross-modal correlation discovery. In KDD, pages 653-658, 2004.
35. W. W. Piegorsch and G. Casella. Inverting a sum of matrices. SIAM Review, 32(3):470-470, 1990.
36. W. H. Press. Numerical recipes 3rd edition: The art of scientific computing. Cambridge university press, 2007.
37. P. Sarkar and A. W. Moore. A tractable approach to finding closest truncated-commute-time neighbors in large graphs. In UAI, pages 335-343, 2007.
38. P. Sarkar and A. W. Moore. Fast nearest-neighbor search in disk-resident graphs. In KDD, pages 513-522, 2010.
39. J. Sun, H. Qu, D. Chakrabarti, and C. Faloutsos. Neighborhood formation and anomaly detection in bipartite graphs. In ICDM, pages 418-425, 2005.
40. H. Tong and C. Faloutsos. Center-piece subgraphs: problem definition and fast solutions. In KDD, pages 404-413, 2006.
41. H. Tong, C. Faloutsos, B. Gallagher, and T. Eliassi-Rad. Fast best-effort pattern matching in large attributed graphs. In KDD, pages 737-746, 2007.
42. H. Tong, C. Faloutsos, and J.-Y. Pan. Random walk with restart: fast solutions and applications. KAIS, 14(3):327-346, 2008.
43. J. J. Whang, D. F. Gleich, and I. S. Dhillon. Overlapping community detection using seed set expansion. In CIKM, pages 2099-2108, 2013.
44. Y. Wu, R. Jin, and X. Zhang. Fast and unified local search for random walk based k-nearest-neighbor query in large graphs. In SIGMOD, pages 1139-1150, 2014.
45. C. Zhang, L. Shou, K. Chen, G. Chen, and Y. Bei. Evaluating geo-social inuence in location-based social networks. In CIKM, pages 1442-1451, 2012.
46. Z. A. Zhu, S. Lattanzi, and V. Mirrokni. A local algorithm for finding well-connected clusters. In ICML, pages 396-404, 2013.