The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Querying k-truss community in large and dynamic graphs
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.
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
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
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 · cited 1×
“There are two major cat-1321 egories: non-overlapping community detection [15, 17] and over-lapping community detection [16, 1, 25].”
BackgroundMaps of random walks on complex networks reveal community structure
Rosvall, M., & Bergstrom, C. T. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0706851105 · Cited by 4,583
Learning to Discover Social Circles in Ego Networks
Leskovec, J., & McAuley, J. (2012) · neural information processing systems · Cited by 2,492
Algorithm 457: finding all cliques of an undirected graph
Bron, C., & Kerbosch, J. (1973) · Communications of the ACM · doi:10.1145/362342.362367 · Cited by 2,452
Link communities reveal multiscale complexity in networks
Ahn, Y.-Y., Bagrow, J. P., & Lehmann, S. (2010) · Nature · doi:10.1038/nature09182 · Cited by 1,949
Overlapping community detection in networks: The state-of-the-art and comparative study
Xie, J., Kelley, S., & Szymanski, B. K. (2013) · ACM Computing Surveys · doi:10.1145/2501654.2501657 · Cited by 930
Overlapping Community Detection in Networks: the State of the Art and Comparative Study
Xie, J., Kelley, S., & Szymanski, B. K. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1110.5813 · Cited by 865
Structural diversity in social contagion
Ugander, J., Backstrom, L., Marlow, C., & Kleinberg, J. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1116502109 · Cited by 695
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
A clustering algorithm based on graph connectivity
Hartuv, E., & Shamir, R. (2000) · Information Processing Letters · doi:10.1016/s0020-0190(00)00142-3 · Cited by 480
Truss decomposition in massive networks
Wang, J., & Cheng, J. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2311906.2311909 · Cited by 423
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
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
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
Streaming algorithms for k-core decomposition
Sarıyüce, A. E., Gedik, B., Jacques-Silva, G., Wu, K., & Çatalyürek, Ü. V. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2536336.2536344 · Cited by 187
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
Finding maximal cliques in massive networks by H*-graph
Cheng, J. S.-C., Ke, Y., Fu, A. W.-C., et al. (2010) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/1807167.1807217 · Cited by 104
Cited by
Local Higher-Order Graph Clustering
Yin, H., Benson, A. R., Leskovec, J., & Gleich, D. F. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098069 · Cited by 583
A survey of community search over big graphs
Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., & Lin, X. (2020) · The VLDB Journal · doi:10.1007/s00778-019-00556-x · Cited by 339
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
Metadata
- Authors
- Huang, X., Cheng, H., Qin, L., Tian, W., & Yu, J. X.
- Venue
- Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data
- Publisher
- ACM
- Published
- 2014-06-18
- Pages
- 1311-1322
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2125895010
- Cited by
- 488
- References
- 19
- FWCI
- 9.73
- Type
- conference paper
- Language
- en
- Open access
- closed
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.