Who Should Be Invited to My Party: A Size-Constrained k-Core Problem in Social Networks
- 8 Downloads
In this paper, we investigate the problem of a size-constrained k-core group query (SCCGQ) in social networks, taking both user closeness and network topology into consideration. More specifically, SCCGQ intends to find a group of h users that has the highest social closeness while being a k-core. SCCGQ can be widely applied to event planning, task assignment, social analysis, and many other fields. In contrast to existing work on the k-core detection problem, which aims to find a k-core in a social network, SCCGQ not only focuses on k-core detection but also takes size constraints into consideration. Although the conventional k-core detection problem can be solved in linear time, SCCGQ has a higher complexity. To solve the problem of SCCGQ, we propose a Blast Scatter (BS) algorithm, which appoints the query node as the center to begin outward expansions via breadth search. In each outward expansion, BS finds a new center through a greedy strategy and then selects multiple neighbors of the center. To speed up the BS algorithm, we propose an advanced search algorithm, called Bounded Extension (BE). Specifically, BE combines an effective social distance pruning strategy and a tight upper bound of social closeness to prune the search space considerably. In addition, we propose an offline social-aware index to accelerate the query processing. Finally, our experimental results demonstrate the efficiency and effectiveness of our proposed algorithms on large real-world social networks.
Keywordsgroup query k-core social analysis social network
Unable to display preview. Download preview PDF.
- Allen J. Event Planning: The Ultimate Guide to Successful Meetings, Corporate Events, Fundraising Galas, Conferences, Conventions, Incentives and Other Special Events (2nd edition). Wiley, 2008.Google Scholar
- She J, Tong Y, Chen L, Song T. Feedback-aware social event-participant arrangement. In Proc. ACM SIGMOD International Conference on Management of Data, May 2017, pp.851-865.Google Scholar
- Tong Y, She J, Ding B, Wang L, Chen L. Online mobile micro-task allocation in spatial crowdsourcing. In Proc. the 32nd International Conference on Data Engineering, May 2016, pp.49-60.Google Scholar
- She J, Tong Y, Chen L. Utility-aware social eventparticipant planning. In Proc. ACM SIGMOD International Conference on Management of Data, May 2015, pp.1629-1643.Google Scholar
- Scott J. Social Network Analysis (3rd edition). Sage, 2012.Google Scholar
- Knoke D, Yang S. Social Network Analysis (2nd edition). Sage Publishers, 2007Google Scholar
- Tan P N, Steinbach M, Kumar V. Introduction to Data Mining (1st edition). Pearson India, 2006.Google Scholar
- Spitzer F. Principles of Random Walk (2nd edition). Springer, 2001Google Scholar
- West D B. Introduction to Graph Theory (2nd edition). Pearson, 2000.Google Scholar
- Chakrabarti D, Zhan Y, Faloutsos C. RMAT: A recursive model for graph mining. In Proc. the 4th SIAM International Conference on Data Mining, April 2004, pp.442-446.Google Scholar
- Hanneman R A, Riddle M. Introduction to Social Network Methods. University of California, 2005.Google Scholar
- Cheng J, Ke Y, Fu A W C, Yu J X, Zhu L. Finding maximal cliques in massive networks by h*-graph. In Proc. ACM SIGMOD International Conference on Management of Data, June 2010, pp.447-458.Google Scholar
- Alvarez-Hamelin J I, Dall’Asta L, Barrat A, Vespignani A. k-core decomposition: A tool for the visualization of large scale networks. arXiv:0504107, 2005. https://arxiv.org/abs/cs/0504107, May, 2018.
- Cheng J, Ke Y, Chu S, Özsu M T. Efficient core decomposition in massive networks. In Proc. the 27th International Conference on Data Engineering, April 2011, pp.51-62.Google Scholar
- Wen D, Qin L, Zhang Y, Lin X. I/O efficient core graph decomposition at web scale. In Proc. the 32nd International Conference on Data Engineering, May 2016, pp.133-144.Google Scholar
- Huang X, Cheng H, Qin L, Tian W, Yu J X. Querying k-truss community in large and dynamic graphs. In Proc. ACM SIGMOD International Conference on Management of Data, June 2014, pp.1311-1322.Google Scholar
- Chen P L, Chou C K, Chen M S. Distributed algorithms for k-truss decomposition. In Proc. the 2014 IEEE International Conference on Big Data, October 2015, pp.471-480.Google Scholar
- Yang D N, Shen C Y, Lee W C, Chen M S. On sociospatial group query for location-based social networks. In Proc. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, July 2012, pp.949-957.Google Scholar