Xin Huang
Jeffrey Xu Yu
ABSTRACT
Community detection which discovers densely connected structures in a network has been studied a lot. In this paper, we study online community search which is practically useful but less studied in the literature. Given a query vertex in a graph, the problem is to find meaningful communities that the vertex belongs to in an online manner. We propose a novel community model based on the k-truss concept, which brings nice structural and computational properties. We design a compact and elegant index structure which supports the efficient search of k-truss communities with a linear cost with respect to the community size. In addition, we investigate the k-truss community search problem in a dynamic graph setting with frequent insertions and deletions of graph vertices and edges. Extensive experiments on large real-world networks demonstrate the effectiveness and efficiency of our community model and search algorithms.
- Y.-Y. Ahn, J. P. Bagrow, and S. Lehmann. Link communities reveal multiscale complexity in networks. Nature, 466(7307):761--764, 2010.Google Scholar
Cross Ref
- V. Batagelj and M. Zaversnik. An o (m) algorithm for cores decomposition of networks. arXiv preprint cs/0310049, 2003.Google Scholar
- C. Bron and J. Kerbosch. Finding all cliques of an undirected graph (algorithm 457). Commun. ACM, 16(9):575--576, 1973. Google ScholarDigital Library
- J. Cheng, Y. Ke, S. Chu, and M. T. Özsu. Efficient core decomposition in massive networks. In ICDE, pages 51--62, 2011. Google ScholarDigital Library
- J. Cheng, Y. Ke, A. W.-C. Fu, J. X. Yu, and L. Zhu. Finding maximal cliques in massive networks by h*-graph. In SIGMOD, pages 447--458, 2010. Google ScholarDigital Library
- N. Chiba and T. Nishizeki. Arboricity and subgraph listing algorithms. SIAM J. Comput., 14(1):210--223, 1985. Google ScholarDigital Library
- J. Cohen. Trusses: Cohesive subgraphs for social network analysis. Technical report, National Security Agency, 2008.Google Scholar
- J. Cohen. Graph twiddling in a mapreduce world. Computing in Science and Engineering, 11(4):29--41, 2009. Google ScholarDigital Library
- W. Cui, Y. Xiao, H. Wang, Y. Lu, and W. Wang. Online search of overlapping communities. In SIGMOD, pages 277--288, 2013. Google ScholarDigital Library
- J. Edachery, A. Sen, and F. J. Brandenburg. Graph clustering using distance-k cliques. In Proceedings of the 7th International Symposium on Graph Drawing, pages 98--106, 1999.Google ScholarCross Ref
- M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979. Google ScholarDigital Library
- D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB, pages 721--732, 2005. Google ScholarDigital Library
- E. Hartuv and R. Shamir. A clustering algorithm based on graph connectivity. Information Processing Letters, 76(4--6):175--181, 2000. Google ScholarDigital Library
- J. J. McAuley and J. Leskovec. Learning to discover social circles in ego networks. In NIPS, pages 548--556, 2012.Google ScholarDigital Library
- M. E. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical review E, 69(2):026113, 2004.Google Scholar
- G. Palla, I. Derényi, I. Farkas, and T. Vicsek. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435(7043):814--818, 2005.Google ScholarCross Ref
- M. Rosvall and C. T. Bergstrom. Maps of random walks on complex networks reveal community structure. Proceedings of the National Academy of Sciences, 105(4):1118--1123, 2008.Google ScholarCross Ref
- A. E. Sarıyüce, B. Gedik, G. Jacques-Silva, K.-L. Wu, and Ü. V. Çatalyürek. Streaming algorithms for k-core decomposition. PVLDB, 6(6):433--444, 2013. Google ScholarDigital Library
- C. E. Tsourakakis, F. Bonchi, A. Gionis, F. Gullo, and M. A. Tsiarli. Denser than the densest subgraph: Extracting optimal quasi-cliques with quality guarantees. In KDD, pages 104--112, 2013. Google ScholarDigital Library
- J. Ugander, L. Backstrom, C. Marlow, and J. Kleinberg. Structural diversity in social contagion. Proceedings of the National Academy of Sciences, 109(16):5962--5966, 2012.Google ScholarCross Ref
- J. Wang and J. Cheng. Truss decomposition in massive networks. PVLDB, 5(9):812--823, 2012. Google ScholarDigital Library
- J. Wang, J. Cheng, and A. W.-C. Fu. Redundancy-aware maximal cliques. In KDD, pages 122--130, 2013. Google ScholarDigital Library
- N. Wang, J. Zhang, K.-L. Tan, and A. K. H. Tung. On triangulation-based dense neighborhood graphs discovery. PVLDB, 4(2):58--68, 2010. Google ScholarDigital Library
- J. Xiang, C. Guo, and A. Aboulnaga. Scalable maximum clique computation using mapreduce. In ICDE, pages 74--85, 2013. Google ScholarDigital Library
- J. Xie, S. Kelley, and B. K. Szymanski. Overlapping community detection in networks: The state-of-the-art and comparative study. ACM Comput. Surv., 45(4):43, 2013. Google ScholarDigital Library
- Y. Zhang and S. Parthasarathy. Extracting analyzing and visualizing triangle k-core motifs within networks. In ICDE, pages 1049--1060, 2012. Google ScholarDigital Library
Index Terms
- Querying k-truss community in large and dynamic graphs
Recommendations
Truss-based Community Search over Large Directed Graphs
SIGMOD '20: Proceedings of the 2020 ACM SIGMOD International Conference on Management of DataCommunity search enables personalized community discovery and has wide applications in large real-world graphs. While community search has been extensively studied for undirected graphs, the problem for directed graphs has received attention only ...
Local search of communities in large graphs
SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of DataCommunity search is important in social network analysis. For a given vertex in a graph, the goal is to find the best community the vertex belongs to. Intuitively, the best community for a given vertex should be in the vicinity of the vertex. However, ...
I/O efficient k-truss community search in massive graphs
AbstractCommunity detection that discovers all densely connected communities in a network has been studied a lot. In this paper, we study online communitysearch for query-dependent communities, which is a different but practically useful task. Given a ...
Comments