Advertisement

Journal of Computer Science and Technology

, Volume 34, Issue 1, pp 170–184 | Cite as

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

  • Yu-Liang MaEmail author
  • Ye Yuan
  • Fei-Da Zhu
  • Guo-Ren Wang
  • Jing Xiao
  • Jian-Zong Wang
Regular Paper
  • 8 Downloads

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.

Keywords

group query k-core social analysis social network 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Supplementary material

11390_2019_1905_MOESM1_ESM.pdf (278 kb)
ESM 1 (PDF 278 kb)

References

  1. [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.Google Scholar
  2. [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.CrossRefGoogle Scholar
  3. [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.Google Scholar
  4. [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.CrossRefGoogle Scholar
  5. [5]
    Sinnen O, Sousa L A. Communication contention in task scheduling. IEEE Transactions on Parallel and Distributed Systems, 2005, 16(6): 503-515.CrossRefGoogle Scholar
  6. [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.CrossRefGoogle Scholar
  7. [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.Google Scholar
  8. [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.Google Scholar
  9. [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.CrossRefGoogle Scholar
  10. [10]
    Scott J. Social Network Analysis (3rd edition). Sage, 2012.Google Scholar
  11. [11]
    Knoke D, Yang S. Social Network Analysis (2nd edition). Sage Publishers, 2007Google Scholar
  12. [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.MathSciNetCrossRefzbMATHGoogle Scholar
  13. [13]
    Tan P N, Steinbach M, Kumar V. Introduction to Data Mining (1st edition). Pearson India, 2006.Google Scholar
  14. [14]
    Guha S, Rastogi R, Shim K. ROCK: A robust clustering algorithm for categorical attributes. Information Systems, 2001, 25(5): 345-366.CrossRefGoogle Scholar
  15. [15]
    Spitzer F. Principles of Random Walk (2nd edition). Springer, 2001Google Scholar
  16. [16]
    Seidman S B. Network structure and minimum degree. Social Networks, 1983, 5(3): 269-287.MathSciNetCrossRefGoogle Scholar
  17. [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.CrossRefGoogle Scholar
  18. [18]
    West D B. Introduction to Graph Theory (2nd edition). Pearson, 2000.Google Scholar
  19. [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.Google Scholar
  20. [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.CrossRefGoogle Scholar
  21. [21]
    Hanneman R A, Riddle M. Introduction to Social Network Methods. University of California, 2005.Google Scholar
  22. [22]
    Luce R D, Perry A D. A method of matrix analysis of group structure. Psychometrika, 1949, 14(2): 95-116.MathSciNetCrossRefGoogle Scholar
  23. [23]
    Bron C. Algorithm 457: Finding all cliques of an undirected graph. Communications of the ACM, 1973, 16(9): 575-576.CrossRefzbMATHGoogle Scholar
  24. [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.Google Scholar
  25. [25]
    Luce R D. Connectivity and generalized cliques in sociometric group structure. Psychometrika, 1950, 15(2): 169-190.MathSciNetCrossRefGoogle Scholar
  26. [26]
    Seidman S B, Foster B L. A graph-theoretic generalization of the clique concept*. Journal of Mathematical Sociology, 1978, 6(1): 139-154.MathSciNetCrossRefzbMATHGoogle Scholar
  27. [27]
    Dorogovtsev S, Goltsev A V, Mendes J F. K-core organization of complex networks. Physical Review Letters, 2006, 96(4): 040601.CrossRefGoogle Scholar
  28. [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. [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.CrossRefGoogle Scholar
  30. [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.CrossRefGoogle Scholar
  31. [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.Google Scholar
  32. [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.Google Scholar
  33. [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.CrossRefGoogle Scholar
  34. [34]
    Cohen J. Graph twiddling in a MapReduce world. Computing in Science & Engineering, 2009, 11(4): 29-41.CrossRefGoogle Scholar
  35. [35]
    Wang J, Cheng J. Truss decomposition in massive networks. Proceedings of the VLDB Endowment, 2012, 5(9): 812-823.CrossRefGoogle Scholar
  36. [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.Google Scholar
  37. [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.Google Scholar
  38. [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.CrossRefGoogle Scholar
  39. [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.CrossRefGoogle Scholar
  40. [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.CrossRefGoogle Scholar
  41. [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.Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  • Yu-Liang Ma
    • 1
    Email author
  • Ye Yuan
    • 1
  • Fei-Da Zhu
    • 2
  • Guo-Ren Wang
    • 3
  • Jing Xiao
    • 4
  • Jian-Zong Wang
    • 4
  1. 1.School of Computer Science and EngineeringNortheastern UniversityShenyangChina
  2. 2.School of Information SystemsSingapore Management UniversitySingaporeSingapore
  3. 3.School of Computer Science and TechnologyBeijing Institute of TechnologyBeijingChina
  4. 4.Ping An Technology (Shenzhen) Co., LtdShenzhenChina

Personalised recommendations