Advertisement

Social Network Community Detection Using Strongly Connected Components

  • Wookey Lee
  • James J. Lee
  • Jinho KimEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8643)

Abstract

The hasty information growth of social network poses the information searching efficiency trials for network mining research. Social network graphs and web graphs are huge sources of highly densely connected hypertext links so that the social networks can be described by a directed graph. This kind of network has inherent structural characteristics such as overly expanded, duplicated, connectedness, and circuit paths, which could generate serious challenges for structured searching for sub-network isomorphism and community detection. In this paper, an efficient searching algorithm is suggested to discover social network communities for overcoming the circuit path issue embedded in the social network environment. Experimental results indicate that the proposed algorithm has better performance than the traditional circuit searching algorithms in terms of the time complexity as well as performance criteria.

Keywords

Strongly connected component Circuit path Information communities 

Notes

Acknowledgement

This work was supported by Defense Acquisition Program Administration and Agency for Defense Development under the Contract UD080042AD, Korea.

References

  1. 1.
    Amer-Yahia, S., Huang, J., Yu C.: Building community-centric information exploration applications on social content sites. In: SIGMOD, pp. 947–952 (2009)Google Scholar
  2. 2.
    Arora, N.R., Lee, W.: Graph based ranked answers for keyword graph structure. New Gener. Comput. 31(2), 115–134 (2013)CrossRefGoogle Scholar
  3. 3.
    Chakrabarti, S., Chakrabarti, S., Pathak, A., Gupta, M.: Index design and query processing for graph conductance search. VLDB J. 20(3), 445–470 (2011)CrossRefGoogle Scholar
  4. 4.
    Hajibagheri, A., Alvari, H., Hamzeh, A., Hashemi, S.: Community detection in social networks using information diffusion. In: ASONAM, pp. 702–703 (2012)Google Scholar
  5. 5.
    Lee, W., Loh, W., Sohn, M.: Searching Steiner trees for social network query. CANDIE 62(3), 732–739 (2012)Google Scholar
  6. 6.
    Lee, W., Leung, Carson K.-S., Lee, J.: Mobile web navigation in digital ecosystems using rooted directed trees. IEEE TIE 58(6), 2154–2162 (2011)Google Scholar
  7. 7.
    Lee, W., Lee, J., Kim, Y., Leung, C.: AnchorWoman: top-k structured mobile web search engine. In: CIKM, pp. 2089–2090 (2009)Google Scholar
  8. 8.
    Maserrat, H., Pei, J.: Community preserving lossy compression of social networks. In: ICDM, pp. 509–518 (2012)Google Scholar
  9. 9.
    Nivasch, G.: Circuit detection using a stack. Inf. Process. Lett. 90, 135–140 (2004)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Korula, N., Lattanzi, S.: An efficient reconciliation algorithm for social networks. PVLDB 7(5), 377–388 (2014)Google Scholar
  11. 11.
    Rautenbach, D., Szwarcfiter, J.: Unit interval graphs of open and closed intervals. J. Graph Theor. 72(4), 418–429 (2013)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Stevens, B., Williams, A.: Hamilton cycles in restricted and incomplete rotator graphs. J. Graph Algorithms Appl. 16(4), 785–810 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Tarjan, R.: Depth-first search and linear graph algorithms. In: FOCS, pp. 114–121 (1971)Google Scholar
  14. 14.
    Qi, X., Tang, W., Wu, Y., Guo, G., Fuller, E., Zhang, C.-Q.: Optimal local community detection in social networks based on density drop of subgraphs. Pattern Recogn. Lett. 36, 46–53 (2014)CrossRefGoogle Scholar
  15. 15.
    Xie, J., Szymanski, B.K.: Towards linear time overlapping community detection in social networks. In: PAKDD, pp. 25–36 (2012)Google Scholar
  16. 16.
    Zhang, X., Cheng, J., Yuan, T., Niu, B., Lu, H.: TopRec: domain-specific recommendation through community topic mining in social network. In: WWW, pp. 1501–1510 (2013)Google Scholar
  17. 17.
    Zhou, Y., Liu, L.: Social influence based clustering of heterogeneous information networks. In: KDD, pp. 338–346 (2013)Google Scholar
  18. 18.
    Zhu, Y., Zhong, E., Pan, S., Wang, X., Zhou, M., Yang, Q.: Predicting user activity level in social networks. In: CIKM, pp. 159–168 (2013)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Informatics Laboratory, Department of I.EINHA UniversityIncheonSouth Korea
  2. 2.Department of Computer ScienceKangwon National UniversityChuncheonSouth Korea

Personalised recommendations