Advertisement

Memory-based random walk for multi-query local community detection

  • Yuchen BianEmail author
  • Dongsheng Luo
  • Yaowei Yan
  • Wei Cheng
  • Wei Wang
  • Xiang Zhang
Regular Paper
  • 45 Downloads

Abstract

Local community detection, which aims to find a target community containing a set of query nodes, has recently drawn intense research interest. The existing local community detection methods usually assume all query nodes are from the same community and only find a single target community. This is a strict requirement and does not allow much flexibility. In many real-world applications, however, we may not have any prior knowledge about the community memberships of the query nodes, and different query nodes may be from different communities. To address this limitation of the existing methods, we propose a novel memory-based random walk method, MRW, that can simultaneously identify multiple target local communities to which the query nodes belong. In MRW, each query node is associated with a random walker. Different from commonly used memoryless random walk models, MRW records the entire visiting history of each walker. The visiting histories of walkers can help unravel whether they are from the same community or not. Intuitively, walkers with similar visiting histories are more likely to be in the same community. Moreover, MRW allows walkers with similar visiting histories to reinforce each other so that they can better capture the community structure instead of being biased to the query nodes. We provide rigorous theoretical foundations for the proposed method and develop efficient algorithms to identify multiple target local communities simultaneously. Comprehensive experimental evaluations on a variety of real-world datasets demonstrate the effectiveness and efficiency of the proposed method.

Keywords

Local community detection Local clustering Memory-based random walk Visiting history 

Notes

Acknowledgements

This work was partially supported by the National Science Foundation grants IIS-1664629 and CAREER.

References

  1. 1.
    Ahn Y-Y, Ahnert SE, Bagrow JP, Barabási A-L (2011) Flavor network and the principles of food pairing. Sci Rep 1:196CrossRefGoogle Scholar
  2. 2.
    Akakin HC, Gurcan MN (2012) Content-based microscopic image retrieval system for multi-image queries. IEEE Trans Inf Technol Biomed 16(4):758–769CrossRefGoogle Scholar
  3. 3.
    Akbas E, Zhao P (2017) Truss-based community search: a truss-equivalence based indexing approach. Proc VLDB Endow 10(11):1298–1309CrossRefGoogle Scholar
  4. 4.
    Akoglu L, Chau DH, Vreeken J, Tatti N, Tong H, Faloutsos C (2013) Mining connection pathways for marked nodes in large graphs. In: SDMGoogle Scholar
  5. 5.
    Alamgir M, Von Luxburg U (2010) Multi-agent random walks for local clustering on graphs. In: ICDMGoogle Scholar
  6. 6.
    Andersen R, Chung F, Lang K (2006) Local graph partitioning using pagerank vectors. In: FOCSGoogle Scholar
  7. 7.
    Andersen R, Lang KJ (2006) Communities from seed sets. In: WWWGoogle Scholar
  8. 8.
    Bagrow JP, Bollt EM (2005) Local method for detecting communities. Phys Rev E 72(4):046108CrossRefGoogle Scholar
  9. 9.
    Baranzini SE, Galwey NW, Wang J et al (2009) Pathway and network-based analysis of genome-wide association studies in multiple sclerosis. Human Mol Genet 18(11):2078–2090CrossRefGoogle Scholar
  10. 10.
    Barbieri N, Bonchi F, Galimberti E, Gullo F (2015) Efficient and effective community search. Data Min Knowl Discov 29(5):1406–1433MathSciNetCrossRefGoogle Scholar
  11. 11.
    Barry D, Parlange J-Y, Li L, Prommer H, Cunningham C, Stagnitti F (2000) Analytical approximations for real values of the lambert w-function. Math Comput Simul 53(1):95–103MathSciNetCrossRefGoogle Scholar
  12. 12.
    Benson AR, Gleich DF, Leskovec J (2015) Tensor spectral clustering for partitioning higher-order network structures. In: SDMGoogle Scholar
  13. 13.
    Bian Y, Ni J, Cheng W, Zhang X (2017) Many heads are better than one: local community detection by the multi-walker chain. In: ICDMGoogle Scholar
  14. 14.
    Bian Y, Ni J, Cheng W, Zhang X (2019) The multi-walker chain and its application in local community detection. Knowl Inf Syst 60(3):1663–1691CrossRefGoogle Scholar
  15. 15.
    Cho D-Y, Kim Y-A, Przytycka TM (2012) Network biology approach to complex diseases. PLoS Comput Biol 8(12):e1002820CrossRefGoogle Scholar
  16. 16.
    Clauset A (2005) Finding local community structure in networks. Phys Rev E 72(2):026132CrossRefGoogle Scholar
  17. 17.
    Crossley NA, Mechelli A, Vértes PE, Winton-Brown TT, Patel AX, Ginestet CE, McGuire P, Bullmore ET (2013) Cognitive relevance of the community structure of the human brain functional coactivation network. Proc Natl Acad Sci 110:11583–11588CrossRefGoogle Scholar
  18. 18.
    Cui W, Xiao Y, Wang H, Lu Y, Wang W (2013) Online search of overlapping communities. In: SIGMOD, pp 277–288Google Scholar
  19. 19.
    Fang Y, Cheng R, Li X, Luo S, Hu J (2017) Effective community search over large spatial graphs. Proc VLDB Endow 10(6):709–720CrossRefGoogle Scholar
  20. 20.
    Fortunato S (2010) Community detection in graphs. Phys Rep 486(3–5):75–174MathSciNetCrossRefGoogle Scholar
  21. 21.
    He K, Shi P, Hopcroft JE, Bindel D (2016) Local spectral diffusion for robust community detection. In: 12th workshop on mining and learning with graphsGoogle Scholar
  22. 22.
    He K, Sun Y, Bindel D, Hopcroft J, Li Y (2015) Detecting overlapping communities from local spectral subspaces. In: ICDMGoogle Scholar
  23. 23.
    Huang X, Cheng H, Qin L, Tian W, Yu JX (2014) Querying k-truss community in large and dynamic graphs. In: SIGMODGoogle Scholar
  24. 24.
    Huang X, Lakshmanan LV, Xu J (2017) Community search over big graphs: Models, algorithms, and opportunities. In: ICDEGoogle Scholar
  25. 25.
    Huang X, Lakshmanan LV, Yu JX, Cheng H (2015) Approximate closest community search in networks. Proc VLDB Endow 9(4):276–287CrossRefGoogle Scholar
  26. 26.
    Kloster K, Gleich DF (2014) Heat kernel based community detection. In: KDDGoogle Scholar
  27. 27.
    Kloumann IM, Kleinberg JM (2014) Community membership identification from small seed sets. In: KDDGoogle Scholar
  28. 28.
    Kong X, Yu PS (2014) Brain network analysis: a data mining perspective. ACM SIGKDD Explor Newsl 15(2):30–38CrossRefGoogle Scholar
  29. 29.
    Lee C, Jang W-D, Sim J-Y, Kim C-S (2015) Multiple random walkers and their application to image cosegmentation. In: CVPRGoogle Scholar
  30. 30.
    Lee S-H, Jang W-D, Park BK, Kim C-S (2016) Rgb-d image segmentation based on multiple random walkers. In: ICIPGoogle Scholar
  31. 31.
    Li Y, He K, Bindel D, Hopcroft JE (2015) Uncovering the small community structure in large networks: a local spectral approach. In: WWWGoogle Scholar
  32. 32.
    Newman ME (2001) The structure of scientific collaboration networks. Proc Natl Acad Sci 98(2):404–409MathSciNetCrossRefGoogle Scholar
  33. 33.
    Ruchansky N, Bonchi F, García-Soriano D, Gullo F, Kourtellis N (2015) The minimum wiener connector problem. In: SIGMODGoogle Scholar
  34. 34.
    Ruchansky N, Bonchi F, Garcia-Soriano D, Gullo F, Kourtellis N (2017) To be connected, or not to be connected: that is the minimum inefficiency subgraph problem. In: CIKMGoogle Scholar
  35. 35.
    Shan J, Shen D, Nie T, Kou Y, Yu G (2016) Searching overlapping communities for group query. World Wide Web 19(6):1179–1202CrossRefGoogle Scholar
  36. 36.
    Spielman DA, Teng S-H (2013) A local clustering algorithm for massive graphs and its application to nearly-linear time graph partitioning. SIAM J Comput 42(1):1–26MathSciNetCrossRefGoogle Scholar
  37. 37.
    Tong H, Faloutsos C (2006) Center-piece subgraphs: problem definition and fast solutions. In: KDDGoogle Scholar
  38. 38.
    Tong H, Faloutsos C, Pan J-Y (2006) Fast random walk with restart and its applications. In: ICDMGoogle Scholar
  39. 39.
    Wang K, Li M, Hakonarson H (2010) Analysing biological pathways in genome-wide association studies. Nat Rev Genet 11(12):843CrossRefGoogle Scholar
  40. 40.
    Whang JJ, Gleich DF, Dhillon IS (2013) Overlapping community detection using seed set expansion. In: CIKMGoogle Scholar
  41. 41.
    Wu Y, Bian Y, Zhang X (2016) Remember where you came from: on the second-order random walk based proximity measures. Proc VLDB Endow 10(1):13–24CrossRefGoogle Scholar
  42. 42.
    Wu Y, Jin R, Li J, Zhang X (2015) Robust local community detection: on free rider effect and its elimination. In: VLDBGoogle Scholar
  43. 43.
    Wu Y, Zhang X, Bian Y, Cai Z, Lian X, Liao X, Zhao F (2018) Second-order random walk-based proximity measures in graph analysis: formulations and algorithms. VLDB J 27(1):127–152CrossRefGoogle Scholar
  44. 44.
    Xia M, Wang J, He Y (2013) Brainnet viewer: a network visualization tool for human brain connectomics. PLoS ONE 8(7):e68910CrossRefGoogle Scholar
  45. 45.
    Yan Y, Bian Y, Luo D, Lee D, Zhang X (2019) Constrained local graph clustering by colored random walk. In: The world wide web conference, pp 2137–2146Google Scholar
  46. 46.
    Yang J, Leskovec J (2012) Defining and evaluating network communities based on ground-truth. In: ICDMGoogle Scholar
  47. 47.
    Yin H, Benson AR, Leskovec J, Gleich DF (2017) Local higher-order graph clustering. In: KDDGoogle Scholar
  48. 48.
    Yuan L, Qin L, Zhang W, Chang L, Yang J (2018) Index-based densest clique percolation community search in networks. TKDE 30(5):922–935Google Scholar
  49. 49.
    Zhou D, Zhang S, Yildirim MY, Alcorn S, Tong H, Davulcu H, He J (2017) A local algorithm for structure-preserving graph cut. In: KDDGoogle Scholar

Copyright information

© Springer-Verlag London Ltd., part of Springer Nature 2019

Authors and Affiliations

  1. 1.College of Information Sciences and TechnologyThe Pennsylvania State UniversityUniversity ParkUSA
  2. 2.NEC Laboratories AmericaPrincetonUSA
  3. 3.Department of Computer ScienceUniversity of CaliforniaLos AngelesUSA

Personalised recommendations