The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Effective community search for large attributed graphs
Abstract
Given a graph G and a vertex q ∈ G , the community search query returns a subgraph of G that contains vertices related to q . Communities, which are prevalent in attributed graphs such as social networks and knowledge bases, can be used in emerging applications such as product advertisement and setting up of social events. In this paper, we investigate the attributed community query (or ACQ), which returns an attributed community (AC) for an attributed graph . The AC is a subgraph of G , which satisfies both structure cohesiveness (i.e., its vertices are tightly connected) and keyword cohesiveness (i.e., its vertices share common keywords). The AC enables a better understanding of how and why a community is formed (e.g., members of an AC have a common interest in music, because they all have the same keyword "music"). An AC can be "personalized"; for example, an ACQ user may specify that an AC returned should be related to some specific keywords like "research" and "sports". To enable efficient AC search, we develop the CL-tree index structure and three algorithms based on it. We evaluate our solutions on four large graphs, namely Flickr, DBLP, Tencent, and DBpedia. Our results show that ACs are more effective and efficient than existing community retrieval approaches. Moreover, an AC contains more precise and personalized information than that of existing community search and detection methods.
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
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
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 · cited 5×
“Non-attributed [22, 11] [26, 5, 4, 15, 18] Attributed [34, 21, 20, 29, 23] ACQ (This paper)”
BackgroundMethodInfluentialIntroduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 11,389
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293 · cited 5×
“Non-attributed [22, 11] [26, 5, 4, 15, 18] Attributed [34, 21, 20, 29, 23] ACQ (This paper)”
BackgroundMethodInfluentialMining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335372 · Cited by 3,216
Network structure and minimum degree
Seidman, S. B. (1983) · Social Networks · doi:10.1016/0378-8733(83)90028-x · Cited by 1,891
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
4 Community Detection in Networks with Node Attributes
Yang, J., McAuley, J., & Leskovec, J. (2013) · Cited by 803
k-Core Organization of Complex Networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.040601 · Cited by 709
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
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
Bidirectional expansion for keyword search on graph databases
Kacholia, V., Pandit, S., Chakrabarti, S., Sudarshan, S., Desai, R., & Karambelkar, H. (2005) · Cited by 482
SPMF: a Java open-source pattern mining library
Fournier‐Viger, P., Gomariz, A., Gueniche, T., Soltani, A., Wu, C., & Tseng, V. S. (2014) · Journal of Machine Learning Research · 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
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 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
Efficient 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
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
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
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
The New Data and New Challenges in Multimedia Research.Preprint
Thomée, B., Shamma, D. A., Friedland, G. H., Elizalde, B., Ni, K. S., Poland, D., Borth, D., & Li, L.-J. (2015) · arXiv (Cornell University) · Cited by 247
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
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
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
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
Using 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
Incremental graph pattern matching
Fan, W., Li, J., Luo, J., Tan, Z., Wang, X., & Wu, Y. (2011) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1989323.1989420 · Cited by 145
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
Community Detection Based on Structure and Content: A Content Propagation Perspective
Liu, L., Xu, L., Wangy, Z., & Chen, E. (2015) · Proceedings · doi:10.1109/icdm.2015.105 · Cited by 78
YFCC100M: The New Data in Multimedia Research
Thomee, B., Shamma, D. A., Friedland, G., Elizalde, B., Ni, K., Poland, D., Borth, D., & Li, L.-J. (2015) · arXiv · doi:10.48550/arxiv.1503.01817 · Cited by 69
Detecting 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-citation
Cited by
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-citation
Metadata
- Authors
- Fang, Y., Cheng, R., Luo, S., & Hu, J.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2016-08
- Volume
- 9
- Issue
- 12
- Pages
- 1233-1244
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2547646153
- Cited by
- 317
- References
- 36
- FWCI
- 19.62
- Type
- journal article
- 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.