Social network community detection using strongly connected components

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8643, Issue , 2014, Pages 596-604

  Lee, Wookey ^a   Lee, James J ^a   Kim, Jinho ^b  

^a Inha University   (South Korea)

^b Kangwon National University   (South Korea)

Author keywords

Circuit path; Information Communities; Strongly connected component

Indexed keywords

ALGORITHMS; BIG DATA; BIOINFORMATICS; COMPLEX NETWORKS; DIRECTED GRAPHS; DISTRIBUTED COMPUTER SYSTEMS; HYPERTEXT SYSTEMS; INFORMATION MANAGEMENT; MOBILE COMMERCE; POPULATION DYNAMICS; PUBLIC HEALTH; SOCIAL NETWORKING (ONLINE); SOCIAL SCIENCES COMPUTING;

INFORMATION COMMUNITY; INFORMATION SEARCHING; NETWORK COMMUNITIES; NETWORK ENVIRONMENTS; PERFORMANCE CRITERION; SEARCHING ALGORITHMS; STRONGLY CONNECTED COMPONENT; STRUCTURAL CHARACTERISTICS;

DATA MINING;

EID: 84915788733     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-13186-3_53     Document Type: Conference Paper

References (18)

1. Amer-Yahia, S., Huang, J., Yu C.: Building community-centric information exploration applications on social content sites. In: SIGMOD, pp. 947–952 (2009)
2. Arora, N.R., Lee, W.: Graph based ranked answers for keyword graph structure. New Gener. Comput. 31(2), 115–134 (2013)
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)
4. Hajibagheri, A., Alvari, H., Hamzeh, A., Hashemi, S.: Community detection in social networks using information diffusion. In: ASONAM, pp. 702–703 (2012)
5. Lee, W., Loh, W., Sohn, M.: Searching Steiner trees for social network query. CANDIE 62(3), 732–739 (2012)
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)
7. Lee, W., Lee, J., Kim, Y., Leung, C.: AnchorWoman: top-k structured mobile web search engine. In: CIKM, pp. 2089–2090 (2009)
8. Maserrat, H., Pei, J.: Community preserving lossy compression of social networks. In: ICDM, pp. 509–518 (2012)
9. Nivasch, G.: Circuit detection using a stack. Inf. Process. Lett. 90, 135–140 (2004)
10. Korula, N., Lattanzi, S.: An efficient reconciliation algorithm for social networks. PVLDB 7(5), 377–388 (2014)
11. Rautenbach, D., Szwarcfiter, J.: Unit interval graphs of open and closed intervals. J. Graph Theor. 72(4), 418–429 (2013)
12. Stevens, B., Williams, A.: Hamilton cycles in restricted and incomplete rotator graphs. J. Graph Algorithms Appl. 16(4), 785–810 (2012)
13. Tarjan, R.: Depth-first search and linear graph algorithms. In: FOCS, pp. 114–121 (1971)
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)
15. Xie, J., Szymanski, B.K.: Towards linear time overlapping community detection in social networks. In: PAKDD, pp. 25–36 (2012)
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)
17. Zhou, Y., Liu, L.: Social influence based clustering of heterogeneous information networks. In: KDD, pp. 338–346 (2013)
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)