Skip to main content
SpringerLink
Log in

Who Should Be Invited to My Party: A Size-Constrained k-Core Problem in Social Networks

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 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.

  2. She J, Tong Y, Chen L, Cao C C. Conflict-aware eventparticipant arrangement and its variant for online setting. IEEE Transactions on Knowledge and Data Engineering, 2016, 28(9): 2281-2295.

    Article  Google Scholar 

  3. 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.

  4. Tong Y, She J, Meng R. Bottleneck-aware arrangement over event-based social networks: The max-min approach. World Wide Web, 2016, 19(6): 1151-1177.

    Article  Google Scholar 

  5. Sinnen O, Sousa L A. Communication contention in task scheduling. IEEE Transactions on Parallel and Distributed Systems, 2005, 16(6): 503-515.

    Article  Google Scholar 

  6. Tong Y, Wang L, Zhou Z, Ding B, Chen L, Ye J, Xu K. Flexible online task assignment in real-time spatial data. Proceedings of the VLDB Endowment 2017, 10(11): 1334-1345.

    Article  Google Scholar 

  7. 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.

  8. 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.

  9. Tong Y, Chen L, Zhou Z, Jagadish H V, Shou L, Lv W. SLADE: A smart large-scale task decomposer in crowdsourcing. IEEE Transactions on Knowledge and Data Engineering, 2018, 30(8): 1588-1601.

    Article  Google Scholar 

  10. Scott J. Social Network Analysis (3rd edition). Sage, 2012.

  11. Knoke D, Yang S. Social Network Analysis (2nd edition). Sage Publishers, 2007

  12. Downey R G, Fellows M R. Fixed parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science, 1995, 141(1/2): 109-131.

    Article  MathSciNet  MATH  Google Scholar 

  13. Tan P N, Steinbach M, Kumar V. Introduction to Data Mining (1st edition). Pearson India, 2006.

  14. Guha S, Rastogi R, Shim K. ROCK: A robust clustering algorithm for categorical attributes. Information Systems, 2001, 25(5): 345-366.

    Article  Google Scholar 

  15. Spitzer F. Principles of Random Walk (2nd edition). Springer, 2001

  16. Seidman S B. Network structure and minimum degree. Social Networks, 1983, 5(3): 269-287.

    Article  MathSciNet  Google Scholar 

  17. Khaouid W, Barsky M, Srinivasan V, Thomo A. K-core decomposition of large networks on a single PC. Proceedings of the VLDB Endowment, 2015, 9(1): 13-23.

    Article  Google Scholar 

  18. West D B. Introduction to Graph Theory (2nd edition). Pearson, 2000.

  19. 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.

  20. Yuan Y, Lian X, Chen L, Yu J X,Wang G, Sun Y. Keyword search over distributed graphs with compressed signature. IEEE Transactions on Knowledge and Data Engineering, 2017, 29(6): 1212-1225.

    Article  Google Scholar 

  21. Hanneman R A, Riddle M. Introduction to Social Network Methods. University of California, 2005.

  22. Luce R D, Perry A D. A method of matrix analysis of group structure. Psychometrika, 1949, 14(2): 95-116.

    Article  MathSciNet  Google Scholar 

  23. Bron C. Algorithm 457: Finding all cliques of an undirected graph. Communications of the ACM, 1973, 16(9): 575-576.

    Article  MATH  Google Scholar 

  24. 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.

  25. Luce R D. Connectivity and generalized cliques in sociometric group structure. Psychometrika, 1950, 15(2): 169-190.

    Article  MathSciNet  Google Scholar 

  26. Seidman S B, Foster B L. A graph-theoretic generalization of the clique concept*. Journal of Mathematical Sociology, 1978, 6(1): 139-154.

    Article  MathSciNet  MATH  Google Scholar 

  27. Dorogovtsev S, Goltsev A V, Mendes J F. K-core organization of complex networks. Physical Review Letters, 2006, 96(4): 040601.

    Article  Google Scholar 

  28. 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.

  29. Zhang H, Zhao H, Cai W, Liu J, Zhou W. Using the k-core decomposition to analyze the static structure of large-scale software systems. The Journal of Supercomputing, 2010, 53(2): 352-369.

    Article  Google Scholar 

  30. Saríyüce A E, Gedik B, Jacques-Silva G, Wu K L, Catalyürek Ü V. Streaming algorithms for k-core decomposition. Proceedings of the VLDB Endowment, 2013, 6(6): 433-444.

    Article  Google Scholar 

  31. 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.

  32. 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.

  33. Zhang F, Zhang Y, Qin L, Zhang W, Lin X. When engagement meets similarity: Efficient (k, r)-core computation on social networks. Proceedings of the VLDB Endowment, 2017, 10(10): 998-1009.

    Article  Google Scholar 

  34. Cohen J. Graph twiddling in a MapReduce world. Computing in Science & Engineering, 2009, 11(4): 29-41.

    Article  Google Scholar 

  35. Wang J, Cheng J. Truss decomposition in massive networks. Proceedings of the VLDB Endowment, 2012, 5(9): 812-823.

    Article  Google Scholar 

  36. 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.

  37. 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.

  38. Deng K, Sadiq S, Zhou X, Xu H, Fung G P C, Lu Y. On group nearest group query processing. IEEE Transactions on Knowledge and Data Engineering, 2012, 24(2): 295-308.

    Article  Google Scholar 

  39. Li Y, Chen R, Xu J, Huang Q, Hu H, Choi B. Geo-social k-cover group queries for collaborative spatial computing. IEEE Transactions on Knowledge and Data Engineering, 2015, 27(10): 2729-2742.

    Article  Google Scholar 

  40. Yang D N, Chen Y L, Lee W C, Chen M S. On socialtemporal group query with acquaintance constraint. Proceedings of the VLDB Endowment, 2011, 4(6): 397-408.

    Article  Google Scholar 

  41. 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.

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Northeastern University, Shenyang, 110169, China

    Yu-Liang Ma & Ye Yuan

  2. School of Information Systems, Singapore Management University, Singapore, 188065, Singapore

    Fei-Da Zhu

  3. School of Computer Science and Technology, Beijing Institute of Technology, Beijing, 100081, China

    Guo-Ren Wang

  4. Ping An Technology (Shenzhen) Co., Ltd, Shenzhen, 518048, China

    Jing Xiao & Jian-Zong Wang

Authors
  1. Yu-Liang Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ye Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fei-Da Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Guo-Ren Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jing Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Jian-Zong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu-Liang Ma.

Electronic supplementary material

ESM 1

(PDF 278 kb)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ma, YL., Yuan, Y., Zhu, FD. et al. Who Should Be Invited to My Party: A Size-Constrained k-Core Problem in Social Networks. J. Comput. Sci. Technol. 34, 170–184 (2019). https://doi.org/10.1007/s11390-019-1905-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-019-1905-0

Keywords

Search

Navigation