Communities serve as basic structural building blocks for understanding the organization of many real-world networks, including social, biological, collaboration, and communication networks. Recently, community search over graphs has attracted significantly increasing attention, from small, simple, and static graphs to big, evolving, attributed, and location-based graphs. In this book, we first review the basic concepts of networks, communities, and various kinds of dense subgraph models. We then survey the state of the art in community search techniques on various kinds of networks across different application areas. Specifically, we discuss cohesive community search, attributed community search, social circle discovery, and geo-social group search. We highlight the challenges posed by different community search problems. We present their motivations, principles, methodologies, algorithms, and applications, and provide a comprehensive comparison of the existing techniques. This book finally concludes by listing publicly available real-world datasets and useful tools for facilitating further research, and by offering further readings and future directions of research in this important and growing area.
Cited By
- Talebirad Y, Zafarmand M, Zaiane O and Largeron C USIWO: A Local Community Search Algorithm for Uncertain Graphs Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, (187-194)
- Lou Y, Wang C, Gu T, Feng H, Chen J and Yu J (2023). Time-topology analysis on temporal graphs, The VLDB Journal — The International Journal on Very Large Data Bases, 32:4, (815-843), Online publication date: 1-Jul-2023.
- Ma C, Fang Y, Cheng R, Lakshmanan L, Zhang W and Lin X (2021). On Directed Densest Subgraph Discovery, ACM Transactions on Database Systems, 46:4, (1-45), Online publication date: 31-Dec-2022.
- Sun X, Huang X, Sun Z and Jin D Budget-constrained Truss Maximization over Large Graphs Proceedings of the 30th ACM International Conference on Information & Knowledge Management, (1754-1763)
- Lou Y, Wang C, Gu T, Feng H, Chen J and Yu J (2021). Time-topology analysis, Proceedings of the VLDB Endowment, 14:13, (3322-3334), Online publication date: 1-Sep-2021.
- Dong Z, Huang X, Yuan G, Zhu H and Xiong H (2021). Butterfly-core community search over labeled graphs, Proceedings of the VLDB Endowment, 14:11, (2006-2018), Online publication date: 1-Jul-2021.
- Liu Q, Zhu X, Huang X and Xu J (2021). Local algorithms for distance-generalized core decomposition over large dynamic graphs, Proceedings of the VLDB Endowment, 14:9, (1531-1543), Online publication date: 1-May-2021.
- Yao K and Chang L (2021). Efficient size-bounded community search over large networks, Proceedings of the VLDB Endowment, 14:8, (1441-1453), Online publication date: 1-Apr-2021.
Index Terms
- Community Search over Big Graphs
Recommendations
A survey of community search over big graphs
AbstractWith 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 ...
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 ...
Truss-based community search: a truss-equivalence based indexing approach
We consider the community search problem defined upon a large graph G: given a query vertex q in G, to find as output all the densely connected subgraphs of G, each of which contains the query v. As an online, query-dependent variant of the well-known ...