An Effective Method for Community Search in Large Directed Attributed Graphs

  • Zezhong Wang
  • Ye Yuan
  • Guoren Wang
  • Hongchao Qin
  • Yuliang Ma
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 747)


Recently there is an increasing need for online community analysis on large scale graphs. Community search (CS), which can retrieve communities efficiently on a query request, has received significant research attention. However, existing CS methods leave edge direction and vertex attributes out of consideration, which results in poor performance of community accuracy and cohesiveness. In this paper, we propose DACQ (directed attribute community query), a novel framework of retrieving effective communities in directed attributed graphs. DACQ first supplements attributes according to the topological structure and generate attribute combinations, after which DACQ finds the strongly connected k-cores (k-SCS) with attributes in the directed graph. Finally, DACQ retrieves effective communities, which are cohesive in terms of the structure and attributes. Extensive experiments demonstrate the efficiency and effectiveness of our proposed algorithms in large scale directed attributed graphs.


Community search Directed graph Attributed graph Effective community 


  1. 1.
    Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., Sudarshan, S.: Keyword searching and browsing in databases using banks. In: 2002 Proceedings of 18th International Conference on Data Engineering, pp. 431–440. IEEE (2002)Google Scholar
  2. 2.
    Cui, W., Xiao, Y., Wang, H., Lu, Y., Wang, W.: Online search of overlapping communities. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 277–288. ACM (2013)Google Scholar
  3. 3.
    Cui, W., Xiao, Y., Wang, H., Wang, W.: Local search of communities in large graphs. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 991–1002. ACM (2014)Google Scholar
  4. 4.
    Ding, B., Yu, J.X., Wang, S., Qin, L., Zhang, X., Lin, X.: Finding top-k min-cost connected trees in databases. In: 2007 IEEE 23rd International Conference on Data Engineering, ICDE 2007, pp. 836–845. IEEE (2007)Google Scholar
  5. 5.
    Fang, Y., Cheng, R., Luo, S., Hu, J.: Effective community search for large attributed graphs. Proc. VLDB Endow. 9(12), 1233–1244 (2016)CrossRefGoogle Scholar
  6. 6.
    Fang, Y., Chang, K.C.C., Lauw, H.W.: Roundtriprank: graph-based proximity with importance and specificity? In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 613–624. IEEE (2013)Google Scholar
  7. 7.
    Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75–174 (2010)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 1311–1322. ACM (2014)Google Scholar
  9. 9.
    Huang, X., Lakshmanan, L.V., Yu, J.X., Cheng, H.: Approximate closest community search in networks. Proc. VLDB Endow. 9(4), 276–287 (2015)CrossRefGoogle Scholar
  10. 10.
    Kacholia, V., Pandit, S., Chakrabarti, S., Sudarshan, S., Desai, R., Karambelkar, H.: Bidirectional expansion for keyword search on graph databases. In: Proceedings of the 31st International Conference on Very Large Data Bases, VLDB Endowment, pp. 505–516 (2005)Google Scholar
  11. 11.
    Kargar, M., An, A.: Keyword search in graphs: Finding r-cliques. Proc. VLDB Endow. 4(10), 681–692 (2011)CrossRefGoogle Scholar
  12. 12.
    Khaouid, W., Barsky, M., Srinivasan, V., Thomo, A.: K-core decomposition of large networks on a single PC. Proc. VLDB Endow. 9(1), 13–23 (2015)CrossRefGoogle Scholar
  13. 13.
    Li, R.H., Qin, L., Yu, J.X., Mao, R.: Influential community search in large networks. Proc. VLDB Endow. 8(5), 509–520 (2015)CrossRefGoogle Scholar
  14. 14.
    Li, Y., Chen, J., Liu, R., Wu, J.: A spectral clustering-based adaptive hybrid multi-objective harmony search algorithm for community detection. In: 2012 IEEE Congress on Evolutionary Computation (CEC), pp. 1–8. IEEE (2012)Google Scholar
  15. 15.
    Malliaros, F.D., Vazirgiannis, M.: Clustering and community detection in directed networks: a survey. Phys. Rep. 533(4), 95–142 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)CrossRefGoogle Scholar
  17. 17.
    Qiu, J., Peng, J., Zhai, Y.: Network community detection based on spectral clustering. In: 2014 International Conference on Machine Learning and Cybernetics (ICMLC), vol. 2, pp. 648–652. IEEE (2014)Google Scholar
  18. 18.
    Ruan, Y., Fuhry, D., Parthasarathy, S.: Efficient community detection in large networks using content and links. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 1089–1098. ACM (2013)Google Scholar
  19. 19.
    Shang, J., Wang, C., Wang, C., Guo, G., Qian, J.: An attribute-based community search method with graph refining. J. Supercomput. pp. 1–28 (2017)Google Scholar
  20. 20.
    Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 939–948. ACM (2010)Google Scholar
  21. 21.
    Tong, Y., Chen, L., Shahabi, C.: Spatial crowdsourcing: challenges, techniques, and applications. Proc. VLDB Endow. 10(12), 1988–1991 (2017)CrossRefGoogle Scholar
  22. 22.
    Tong, Y., She, J., Ding, B., Chen, L., Wo, T., Xu, K.: Online minimum matching in real-time spatial data: experiments and analysis. Proc. VLDB Endow. 9(12), 1053–1064 (2016)CrossRefGoogle Scholar
  23. 23.
    Wu, Y., Jin, R., Li, J., Zhang, X.: Robust local community detection: on free rider effect and its elimination. Proc. VLDB Endow. 8(7), 798–809 (2015)CrossRefGoogle Scholar
  24. 24.
    Xu, Z., Ke, Y., Wang, Y., Cheng, H., Cheng, J.: A model-based approach to attributed graph clustering. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, pp. 505–516. ACM (2012)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  • Zezhong Wang
    • 1
  • Ye Yuan
    • 1
  • Guoren Wang
    • 1
  • Hongchao Qin
    • 1
  • Yuliang Ma
    • 1
  1. 1.School of Computer Science and EngineeringNortheastern UniversityShenyangChina

Personalised recommendations