The DOI matches its Crossref record; 157 of the 157 references it cites were found in a registry or an index.
A survey of community search over big graphs
Open accessAbstract
With the rapid development of information technologies, various big graphs are prevalent in many real applications (e.g., social media and knowledge bases). An important component of these graphs is the network community. Essentially, a community is a group of vertices which are densely connected internally. Community retrieval can be used in many real applications, such as event organization, friend recommendation, and so on. Consequently, how to efficiently find high-quality communities from big graphs is an important research topic in the era of big data. Recently, a large group of research works, called community search, have been proposed. They aim to provide efficient solutions for searching high-quality communities from large networks in real time. Nevertheless, these works focus on different types of graphs and formulate communities in different manners, and thus, it is desirable to have a comprehensive review of these works. In this survey, we conduct a thorough review of existing community search works. Moreover, we analyze and compare the quality of communities under their models, and the performance of different solutions. Furthermore, we point out new research directions. This survey does not only help researchers to have better understanding of existing community search solutions, but also provides practitioners a better judgment on choosing the proper solutions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293 · cited 1×
“plex [43]); 14.multi-commodity ow-based methods (e.g., [123]); 15.hybrid-based methods (e.g., [91]). For a detailed survey of CD, please refer to the following survey and empirical evaluation papers: [159, 195,71,153,49,83,45,155,157,111,9,113,164,124,88,198]. Although these CD solutions are able to discover communiti…”
MethodA tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
DeepWalk: online learning of social representations
Perozzi, B., Al-Rfou, R., & Skiena, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623732 · Cited by 10,123
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Fast algorithm for detecting community structure in networks
Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.69.066133 · Cited by 5,406
Uncovering the overlapping community structure of complex networks in nature and society
Palla, G., Derényi, I., Farkas, I., & Vicsek, T. (2005) · Nature · doi:10.1038/nature03607 · Cited by 5,373
Functional cartography of complex metabolic networks
Guimerà, R., & Nunes Amaral, L. A. (2005) · Nature · doi:10.1038/nature03288 · Cited by 3,983 · cited 1×
“…example, in Facebook, communities consist of users that are with strong friendship [4]; on the World Wide Web, communities contain web sites which share similar topics [23]; in protein-protein interaction networks [152] and metabolic networks [82], communities correspond to functionality modules.”
BackgroundWu, F. Y. (1982) · Reviews of Modern Physics · doi:10.1103/revmodphys.54.235 · Cited by 3,570
Pregel: a system for large-scale graph processing
Malewicz, G., Austern, M. H., Bik, A. J. C., Dehnert, J. C., Horn, I., Leiser, N., & Czajkowski, G. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807184 · Cited by 3,515
Comparing community structure identification
Danon, L., Díaz-Guilera, A., Duch, J., & Arenas, A. (2005) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2005/09/p09008 · Cited by 2,872
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810 · cited 1×
“For example, in Facebook, communities consist of users that are with strong friendship [3]; on the World Wide Web, communities contain web sites which share similar topics [22]; in protein-protein interaction networks [151] and metabolic networks [82], communities correspond to functionality modules.”
BackgroundBarthélemy, M. (2011) · Physics Reports · doi:10.1016/j.physrep.2010.11.002 · Cited by 2,469
An Algorithm for Subgraph Isomorphism
Ullmann, J. R. (1976) · Journal of the ACM · doi:10.1145/321921.321925 · Cited by 2,277
Computing Communities in Large Networks Using Random Walks
Pons, P., & Latapy, M. (2005) · Lecture Notes in Computer Science · doi:10.1007/11569596_31 · Cited by 2,048
Imagined Communities: Awareness, Information Sharing, and Privacy on the Facebook
Acquisti, A., & Gross, R. (2006) · Lecture Notes in Computer Science · doi:10.1007/11957454_3 · Cited by 1,895 · cited 3×
“In the literature, there are three approaches for computingk-edge connected components of a graph; that is, cut-based approach [25, 31, 34], decomposition-based approach [7], and randomized approach [4]. As the decomposition-based approach has a time complexity of O(h l jEj) wherehandl are usually bounded by small con…”
BackgroundMethodInfluentialNetwork structure and minimum degree
Seidman, S. B. (1983) · Social Networks · doi:10.1016/0378-8733(83)90028-x · Cited by 1,891
R-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · ACM SIGMOD Record · doi:10.1145/971697.602266 · Cited by 1,612
Defining and evaluating network communities based on ground-truth
Yang, J., & Leskovec, J. (2015) · Knowledge and Information Systems · doi:10.1007/s10115-013-0693-z · Cited by 1,411
A fast algorithm for Steiner trees
Kou, L., Markowsky, G., & Berman, L. (1981) · Acta Informatica · doi:10.1007/bf00288961 · Cited by 1,188
Community Structure in Directed Networks
Leicht, E. A., & Newman, M. E. J. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.118703 · Cited by 1,116
A survey of heterogeneous information network analysis
Shi, C., Li, Y., Zhang, J., Sun, Y., & Yu, P. S. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2016.2598561 · Cited by 1,112
Lancichinetti, A., & Fortunato, S. (2009) · Physical Review E · doi:10.1103/physreve.80.016118 · Cited by 1,009
CFinder: locating cliques and overlapping modules in biological networks
Adamcsek, B., Palla, G., Farkas, I. J., Derényi, I., & Vicsek, T. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl039 · Cited by 933
Empirical comparison of algorithms for network community detection
Leskovec, J., Lang, K. J., & Mahoney, M. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772755 · Cited by 918
Keyword searching and browsing in databases using BANKS
Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., & Sudarshan, S. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994756 · Cited by 871
Graph clustering based on structural/attribute similarities
Zhou, Y., Cheng, H., & Yu, J. X. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687709 · Cited by 863
Gibbons, A. (1985) · Cited by 828
Finding overlapping communities in networks by label propagation
Gregory, S. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/10/103018 · Cited by 806
Efficient identification of Web communities
Flake, G. W., Lawrence, S., & Giles, C. L. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347121 · Cited by 804
4 Community Detection in Networks with Node Attributes
Yang, J., McAuley, J., & Leskovec, J. (2013) · Cited by 803
Finding local community structure in networks
Clauset, A. (2005) · Physical Review E · doi:10.1103/physreve.72.026132 · Cited by 788
Amazon Mechanical Turk: Gold Mine or Coal Mine?
Fort, K., Adda, G., & Cohen, K. B. (2011) · Computational Linguistics · doi:10.1162/coli_a_00057 · Cited by 761
Clustering and Community Detection in Directed Networks: A SurveyPreprint
Malliaros, F. D., & Vazirgiannis, M. (2016) · Cited by 641
An O(m) Algorithm for Cores Decomposition of Networks
Batagelj, V., & Zaveršnik, M. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0310049 · Cited by 627
Community detection in Social Media: Performance and application considerations
Papadopoulos, S., Kompatsiaris, Y., Vakali, A., & Spyridonos, P. (2012) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-011-0224-z · Cited by 615
Finding a Maximum Density Subgraph
Goldberg, A. V. (1984) · UC Berkeley · Cited by 598
Clustering and community detection in directed networks: A survey
Malliaros, F. D., & Vazirgiannis, M. (2013) · Physics Reports · doi:10.1016/j.physrep.2013.08.002 · Cited by 591
Community Detection in Networks with Node Attributes
Yang, J., McAuley, J., & Leskovec, J. (2013) · 2013 IEEE 13th International Conference on Data Mining · doi:10.1109/icdm.2013.167 · Cited by 575
Query Recommendation Using Query Logs in Search Engines
Baeza-Yates, R., Hurtado, C., & Mendoza, M. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30192-9_58 · Cited by 537
The community-search problem and how to plan a successful cocktail party
Sozio, M., & Gionis, A. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835923 · Cited by 490
Querying k-truss community in large and dynamic graphs
Huang, X., Cheng, H., Qin, L., Tian, W., & Yu, J. X. (2014) · Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2588555.2610495 · Cited by 488
Self-citationBidirectional expansion for keyword search on graph databases
Kacholia, V., Pandit, S., Chakrabarti, S., Sudarshan, S., Desai, R., & Karambelkar, H. (2005) · Cited by 482
Greedy Approximation Algorithms for Finding Dense Components in a Graph
Charikar, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44436-x_10 · Cited by 479
Community Discovery in Dynamic Networks: A Survey
Rossetti, G., & Cazabet, R. (2019) · ACM Computing Surveys · doi:10.1145/3172867 · Cited by 468
A graph‐theoretic generalization of the clique concept
Seidman, S. B., & Foster, B. L. (1978) · Journal of Mathematical Sociology · doi:10.1080/0022250x.1978.9989883 · Cited by 464
Truss decomposition in massive networks
Wang, J., & Cheng, J. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2311906.2311909 · Cited by 423
A faster approximation algorithm for the Steiner problem in graphs
Mehlhorn, K. (1988) · Information Processing Letters · doi:10.1016/0020-0190(88)90066-x · Cited by 420
Joint latent topic models for text and citations
Nallapati, R. M., Ahmed, A., Xing, E. P., & Cohen, W. W. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401957 · Cited by 408
Leighton, T., & Rao, S. (1988) · [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21958 · Cited by 395
Community Mining from Signed Social Networks
Yang, B., Cheung, W., & Liu, J. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.1061 · Cited by 383
Combining link and content for community detection: a discriminative approach
Yang, T., Jin, R., Chi, Y., & Zhu, S. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557120 · Cited by 364
A classification for community discovery methods in complex networks
Coscia, M., Giannotti, F., & Pedreschi, D. (2011) · Statistical Analysis and Data Mining: The ASA Data Science Journal · doi:10.1002/sam.10133 · Cited by 353
Uncovering space-independent communities in spatial networks
Expert, P., Evans, T. S., Blondel, V. D., & Lambiotte, R. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1018962108 · Cited by 350
Regionalization with dynamically constrained agglomerative clustering and partitioning (REDCAP)
Guo, D. (2008) · International Journal of Geographical Information Systems · doi:10.1080/13658810701674970 · Cited by 336
A model-based approach to attributed graph clustering
Xu, Z., Ke, Y., Wang, Y., Cheng, H., & Cheng, J. (2012) · Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2213836.2213894 · Cited by 332
Finding Top-k Min-Cost Connected Trees in Databases
Ding, B., Yu, J. X., Wang, S., Qin, L., Zhang, X., & Lin, X. (2007) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2007.367929 · Cited by 321
Self-citationEffective community search for large attributed graphs
Fang, Y., Cheng, R., Luo, S., & Hu, J. (2016) · Proceedings of the VLDB Endowment · doi:10.14778/2994509.2994538 · Cited by 317
Self-citationEfficient community detection in large networks using content and links
Ruan, Y., Fuhry, D., & Parthasarathy, S. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488483 · Cited by 304
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
Balasundaram, B., Butenko, S., & Hicks, I. V. (2011) · Operations Research · doi:10.1287/opre.1100.0851 · Cited by 302
Local search of communities in large graphs
Cui, W., Xiao, Y., Wang, H., & Wang, W. (2014) · Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2588555.2612179 · Cited by 299
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
Tsourakakis, C., Bonchi, F., Gionis, A., Gullo, F., & Tsiarli, M. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2487645 · Cited by 294
Topic-link LDA: joint models of topic and author community
Liu, Y., Niculescu-Mizil, A., & Gryc, W. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553460 · Cited by 288
Graph pattern matching: from intractable to polynomial time
Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., & Wu, Y. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920878 · Cited by 285
Efficient core decomposition in massive networks
Cheng, J., Ke, Y., Chu, S., & Ozsu, M. T. (2011) · 2011 IEEE 27th International Conference on Data Engineering · doi:10.1109/icde.2011.5767911 · Cited by 266
Fast best-effort pattern matching in large attributed graphs
Tong, H., Faloutsos, C., Gallagher, B. J., & Eliassi‐Rad, T. (2007) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1281192.1281271 · Cited by 251
Influential community search in large networks
Li, R.-H., Qin, L., Yu, J. X., & Mao, R. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2735479.2735484 · Cited by 243
Self-citationScalable learning of collective behavior based on sparse social dimensions
Tang, L., & Liu, H. (2009) · Proceedings of the 18th ACM conference on Information and knowledge management · doi:10.1145/1645953.1646094 · Cited by 233
Community Detection in Attributed Graphs: An Embedding Approach
Li, Y., Sha, C., Huang, X., & Zhang, Y. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11274 · Cited by 228
Self-citationCommunity detection in large‐scale networks: a survey and empirical evaluation
Harenberg, S., Bello, G., Gjeltema, L., Ranshous, S., Harlalka, J., Seay, R., Padmanabhan, K., & Samatova, N. (2014) · WIREs Computational Statistics · doi:10.1002/wics.1319 · Cited by 227
Online search of overlapping communities
Cui, W., Xiao, Y., Wang, H., Lu, Y., & Wang, W. (2013) · Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2463676.2463722 · Cited by 222
Approximate closest community search in networks
Huang, X., Lakshmanan, L. V. S., Yu, J. X., & Cheng, H. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2856318.2856323 · Cited by 220
Self-citationEffective community search over large spatial graphs
Fang, Y., Cheng, R., Li, X., Luo, S., & Hu, J. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3055330.3055337 · Cited by 214
Self-citationCommunity detection as an inference problem
Hastings, M. B. (2006) · Physical Review E · doi:10.1103/physreve.74.035102 · Cited by 213
K-core decomposition of large networks on a single PC
Khaouid, W., Barsky, M., Srinivasan, V., & Thomo, A. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2850469.2850471 · Cited by 210
Distance-join: pattern match query in a large graph database
Zou, L., Chen, L., & Özsu, M. T. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687727 · Cited by 200
Efficient Core Maintenance in Large Dynamic Graphs
Li, R.-H., Yu, J. X., & Mao, R. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.158 · Cited by 187
Community Detection in Temporal Multilayer Networks, with an Application to Correlation Networks
Bazzi, M., Porter, M. A., Williams, S., McDonald, M., Fenn, D. J., & Howison, S. D. (2016) · Multiscale Modeling & Simulation · doi:10.1137/15m1009615 · Cited by 186
Distributed k-Core Decomposition
Montresor, A., De Pellegrini, F., & Miorandi, D. (2013) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2012.124 · Cited by 181
Finding communities in directed networks
Kim, Y., Son, S.-W., & Jeong, H. (2010) · Physical Review E · doi:10.1103/physreve.81.016103 · Cited by 172
Community membership identification from small seed sets
Kloumann, I. M., & Kleinberg, J. M. (2014) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2623330.2623621 · Cited by 171
Robust local community detection: on free rider effect and its elimination
Wu, Y., Jin, R., Li, J., & Zhang, X. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2752939.2752948 · Cited by 170
Community Detection in Multi-Layer Graphs: A Survey
Kim, J., & Lee, J.-G. (2015) · ACM SIGMOD Record · doi:10.1145/2854006.2854013 · Cited by 170
Survey on Social Community Detection
Plantié, M., & Crampes, M. (2013) · Computer Communications and Networks · doi:10.1007/978-1-4471-4555-4_4 · Cited by 169
Computer Communications and Networks
Freer, J. R. (1988) · Springer eBooks · doi:10.1007/978-1-4613-1041-9 · Cited by 169
Index-Based Densest Clique Percolation Community Search in Networks
Yuan, L., Qin, L., Zhang, W., Chang, L., & Yang, J. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2783933 · Cited by 164
Self-citationUsing content and interactions for discovering communities in social networks
Sachan, M., Contractor, D., Faruquie, T. A., & Subramaniam, L. V. (2012) · International World Wide Web Conference (WWW) · doi:10.1145/2187836.2187882 · Cited by 160
Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions
Sarıyüce, A. E., Seshadhri, C., Pinar, A., & Çatalyürek, Ü. V. (2015) · International World Wide Web Conference (WWW) · doi:10.1145/2736277.2741640 · Cited by 158
Efficient and effective community search
Barbieri, N., Bonchi, F., Galimberti, E., & Gullo, F. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-015-0422-1 · Cited by 150
Network Community Detection: A Review and Visual SurveyPreprint
Khan, B. S., & Niazi, M. A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1708.00977 · Cited by 149
Extracting Analyzing and Visualizing Triangle K-Core Motifs within Networks
Zhang, Y., & Parthasarathy, S. (2012) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2012.35 · Cited by 144
Self-citationTriangle listing in massive networks and its applications
Chu, S., & Cheng, J. S.-C. (2011) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020513 · Cited by 143
Listing k-cliques in Sparse Real-World Graphs*
Danisch, M., Balalau, O., & Sozio, M. (2018) · International World Wide Web Conference (WWW) · doi:10.1145/3178876.3186125 · Cited by 139
Scalable distributed subgraph enumeration
Lai, L., Qin, L., Lin, X., Zhang, Y., Chang, L., & Yang, S. (2016) · Proceedings of the VLDB Endowment · doi:10.14778/3021924.3021937 · Cited by 136
Self-citationLarge scale cohesive subgraphs discovery for social network visual analysis
Zhao, F., & Tung, A. K. H. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2535568.2448942 · Cited by 134
Persistent Community Search in Temporal Networks
Li, R.-H., Su, J. R., Qin, L., Yu, J. X., & Dai, Q. (2018) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2018.00077 · Cited by 126
Self-citationEfficient algorithms for densest subgraph discovery
Fang, Y., Yu, K., Cheng, R. C. K., Lakshmanan, L. V. S., & Lin, X. (2019) · Proceedings of the VLDB Endowment · doi:10.14778/3342263.3342645 · Cited by 122
Self-citationEffective and Efficient Community Search Over Large Directed Graphs
Fang, Y., Wang, Z., Cheng, R. C. K., Wang, H., & Hu, J. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2872982 · Cited by 117
Self-citationLarge scale graph processing systems: survey and an experimental evaluation
Batarfi, O., Shawi, R. E., Fayoumi, A. G., Nouri, R., Beheshti, A., Barnawi, A., & Sakr, S. (2015) · Cluster Computing · doi:10.1007/s10586-015-0472-6 · Cited by 116
Classifying molecular sequences using a linkage graph with their pairwise similarities
Matsuda, H., Ishihara, T., & Hashimoto, A. (1999) · Theoretical Computer Science · doi:10.1016/s0304-3975(98)00091-7 · Cited by 116
The art of community detection
Gulbahce, N., & Lehmann, S. (2008) · BioEssays · doi:10.1002/bies.20820 · Cited by 114
Association rules with graph patterns
Fan, W., Wang, X., Wu, Y., & Xu, J. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2824032.2824048 · Cited by 112
Maximum co-located community search in large scale social networks
Chen, L., Chengfei Liu, A., Zhou, R. H., Li, J., Yang, X., & Wang, B. (2018) · Proceedings of the VLDB Endowment · doi:10.14778/3231751.3231755 · Cited by 112
Effective and efficient attributed community search
Fang, Y., Cheng, R. C. K., Chen, Y., Luo, S., & Hu, J. (2017) · The VLDB Journal · doi:10.1007/s00778-017-0482-5 · Cited by 108
Self-citationExploring Local Community Structures in Large Networks
Luo, F., Wang, J., & Promislow, E. (2006) · IEEE/WIC/ACM International Conference on Web Intelligence · doi:10.1109/wi.2006.72 · Cited by 106
Finding maximal k-edge-connected subgraphs from a large graph
Zhou, R. H., Chengfei Liu, A., Yu, J. X., Liang, W., Chen, B., & Li, J. (2012) · International Conference on Extending Database Technology (EDBT) · doi:10.1145/2247596.2247652 · Cited by 106
Truss Decomposition of Probabilistic Graphs
Huang, X. S., Lu, W., & Lakshmanan, L. V. S. (2016) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2882903.2882913 · Cited by 106
Self-citationCommunity Discovery in Social Networks: Applications, Methods and Emerging Trends
Parthasarathy, S., Ruan, Y., & Satuluri, V. (2011) · Springer eBooks · doi:10.1007/978-1-4419-8462-3_4 · Cited by 104
Most Influential Community Search over Large Social Networks
Li, J., Wang, X., Deng, K., Yang, X., Sellis, T., & Yu, J. X. (2017) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2017.136 · Cited by 102
Incremental k-core decomposition: algorithms and evaluation
Sarıyüce, A. E., Gedik, B., Jacques-Silva, G., Wu, K., & Çatalyürek, Ü. V. (2016) · The VLDB Journal · doi:10.1007/s00778-016-0423-8 · Cited by 100
A general framework for geo-social query processing
Armenatzoglou, N., Papadopoulos, S., & Dimitris Papadias, C. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2536206.2536218 · Cited by 96
A linear-time algorithm for a special case of disjoint set union
Gabow, H. N., & Tarjan, R. E. (1983) · Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 · doi:10.1145/800061.808753 · Cited by 94
On Effectively Finding Maximal Quasi-cliques in Graphs
Brunato, M., Hoos, H. H., & Battiti, R. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-92695-5_4 · Cited by 91
Discovering Communities from Social Networks: Methodologies and Applications
Yang, B. X., Liu, D., & Liu, J. (2010) · Springer eBooks · doi:10.1007/978-1-4419-7142-5_16 · Cited by 88
Subgraph matching: on compression and computation
Qiao, M., Zhang, H., & Cheng, H. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3149193.3149198 · Cited by 87
Detecting cohesive and 2-mode communities indirected and undirected networks
Yang, J., McAuley, J., & Leskovec, J. (2014) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2556195.2556243 · Cited by 84
Geo-social group queries with minimum acquaintance constraints
Zhu, Q., Hu, H., Xu, C. L., Xu, J., & Lee, W.-C. (2017) · The VLDB Journal · doi:10.1007/s00778-017-0473-6 · Cited by 84
Finding community structure in spatially constrained complex networks
Chen, Y., Xu, J., & Xu, M. (2015) · International Journal of Geographical Information Systems · doi:10.1080/13658816.2014.999244 · Cited by 82
A Query Approach for Influence Maximization on Specific Users in Social Networks
Lee, J.-R., & Chung, C. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2330833 · Cited by 78
D-cores: Measuring Collaboration of Directed Graphs Based on Degeneracy
Giatsidis, C., Thilikos, D. M., & Vazirgiannis, M. (2011) · Proceedings · doi:10.1109/icdm.2011.46 · Cited by 78
Fast hierarchy construction for dense subgraphs
Sarıyüce, A. E., & Pınar, A. (2016) · Proceedings of the VLDB Endowment · doi:10.14778/3021924.3021927 · Cited by 77
Top-k graph pattern matching over large graphs
Cheng, J., Zeng, X., & Yu, J. X. (2013) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2013.6544895 · Cited by 71
Hu, J., Cheng, R. C. K., Huang, Z., Fang, Y., & Luo, S. (2017) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3132847.3132885 · Cited by 66
Self-citationDetecting hot topics from Twitter: A multiview approach
Fang, Y., Zhang, H., Ye, Y., & Li, X. (2014) · Journal of Information Science · doi:10.1177/0165551514541614 · Cited by 63
Self-citationHCDF: A Hybrid Community Discovery Framework
Henderson, K. A., Eliassi‐Rad, T., Papadimitriou, S., & Faloutsos, C. (2010) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972801.66 · Cited by 62
A Survey of Algorithms for Keyword Search on Graph Data
Wang, H., & Aggarwal, C. C. (2010) · The Kluwer international series on advances in database systems · doi:10.1007/978-1-4419-6045-0_8 · Cited by 61
Scalable discovery of best clusters on large graphs
Macropol, K., & Singh, A. K. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920930 · Cited by 60
Akiba, T., Iwata, Y., & Yoshida, Y. (2013) · Proceedings of the ... ACM International Conference on Information & Knowledge Management · doi:10.1145/2505515.2505751 · Cited by 60
Top-k overlapping densest subgraphs
Galbrun, E., Gionis, A., & Tatti, N. (2016) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-016-0464-z · Cited by 60
Overlapping Community Discovery Methods: A Survey
Amelio, A., & Pizzuti, C. (2014) · Lecture notes in social networks · doi:10.1007/978-3-7091-1797-2_6 · Cited by 59
PTE: Enumerating Trillion Triangles On Distributed Systems
Park, H.-M., Myaeng, S.-H., & Kang, U. (2016) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2939672.2939757 · Cited by 59
I/O-Efficient Algorithms on Triangle Listing and Counting
Hu, X., Tao, Y., & Chung, C. (2014) · ACM Transactions on Database Systems · doi:10.1145/2691190.2691193 · Cited by 52
Directed Network Community Detection: A Popularity and Productivity Link Model
Yang, T., Chi, Y., Shenghuo Zhu, B., Gong, Y., & Jin, R. (2010) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972801.65 · Cited by 49
Extracting Communities from Complex Networks by the k-Dense Method
Saito, K., Yamada, T., & Kazama, K. (2008) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1093/ietfec/e91-a.11.3304 · Cited by 47
Local Community Detection in Dynamic Networks
DiTursi, D. J., Ghosh, G., & Bogdanov, P. (2017) · Proceedings · doi:10.1109/icdm.2017.103 · Cited by 43
A local seed selection algorithm for overlapping community detection
Moradi, F., Olovsson, T., & Tsigas, P. (2014) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2014.6921552 · Cited by 42
Efficient Algorithms for Public-Private Social Networks
Chierichetti, F., Epasto, A., Kumar, R., Lattanzi, S., & Mirrokni, V. (2015) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2783258.2783354 · Cited by 40
Clustering large attributed information networks: an efficient incremental computing approach
Cheng, H., Zhou, Y., Huang, X., & Yu, J. X. (2012) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-012-0263-0 · Cited by 40
Self-citationQuery Optimal k-Plex Based Community in Graphs
Wang, Y., Jian, X., Yang, Z., & Li, J. (2017) · Data Science and Engineering · doi:10.1007/s41019-017-0051-3 · Cited by 40
Detecting Cohesive and 2-mode Communities in Directed and Undirected NetworksPreprint
Yang, J., McAuley, J., & Leskovec, J. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1401.7375 · Cited by 34
Finding dense and connected subgraphs in dual networks
Wu, Y., Jin, R., Zhu, X., & Zhang, X. (2015) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2015.7113344 · Cited by 31
AutoG: a visual query autocompletion framework for graph databases
Yi, P., Choi, B. K. K., Bhowmick, S. S., & Xu, J. (2017) · The VLDB Journal · doi:10.1007/s00778-017-0454-9 · Cited by 31
A local seed selection algorithm for overlapping community detection
Moradi, F., Olovsson, T., & Tsigas, P. (2014) · doi:10.5555/3191835.3191837 · Cited by 30
Online community detection in social sensing
Qi, G.-J., Aggarwal, C. C., & Huang, T. S. (2013) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/2433396.2433474 · Cited by 27
Expanding network communities from representative examples
Mehler, A., & Skiena, S. (2009) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1514888.1514890 · Cited by 26
An attribute-based community search method with graph refining
Shang, J., Wang, C., Wang, C., Guo, G., & Qian, J. (2017) · The Journal of Supercomputing · doi:10.1007/s11227-017-1976-z · Cited by 26
Yi, P., Choi, B. K. K., Bhowmick, S. S., & Xu, J. (2016) · Proceedings of the VLDB Endowment · doi:10.14778/3007263.3007295 · Cited by 25
Community Detection in Social Networks Using Information Diffusion
Hajibagheri, A., Alvari, H., Hamzeh, A., & Hashemi, S. (2012) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2012.119 · Cited by 24
ExpFinder: Finding experts by graph pattern matching
Fan, W., Wang, X., & Wu, Y. (2013) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2013.6544933 · Cited by 24
(2018) · Lecture notes in computer science · doi:10.1007/978-3-030-04182-3 · Cited by 18
PP-DBLP: Modeling and Generating Attributed Public-Private Networks with DBLP
Huang, X. S., Jiang, J., Choi, B. K. K., Xu, J., Zhang, Z., & Song, Y. (2018) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2018.00142 · Cited by 12
Self-citationScalable Evaluation of k-NN Queries on Large Uncertain Graphs
Li, X., Cheng, R. C. K., Fang, Y., Hu, J., & Maniu, S. (2018) · HAL · doi:10.5441/002/edbt.2018.17 · Cited by 11
Self-citationIndexing Public-Private Graphs
Archer, A. F., Lattanzi, S., Likarish, P., & Vassilvitskii, S. (2017) · International World Wide Web Conference (WWW) · doi:10.1145/3038912.3052683 · Cited by 10
Literature survey on dynamic community detection and models of social networks
Tamimi, I., & Kamili, M. E. (2015) · International Conference on Wireless Networks and Mobile Communications (WINCOM) · doi:10.1109/wincom.2015.7381332 · Cited by 4
Metadata
- Authors
- Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., & Lin, X.
- Venue
- The VLDB Journal
- Published
- 2019-07-20
- Volume
- 29
- Issue
- 1
- Pages
- 353-392
- ISSN
- 0949-877X (ISSN-L)
- 1066-8888
- OpenAlex
- W2962788915
- Cited by
- 339
- References
- 157
- FWCI
- 16.65
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.