Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Top-L Most Influential Community Detection Over Social Networks (Technical Report) (2311.13162v3)

Published 22 Nov 2023 in cs.SI and cs.DB

Abstract: In many real-world applications such as social network analysis and online marketing/advertising, the community detection is a fundamental task to identify communities (subgraphs) in social networks with high structural cohesiveness. While previous works focus on detecting communities alone, they do not consider the collective influences of users in these communities on other user nodes in social networks. Inspired by this, in this paper, we investigate the influence propagation from some seed communities and their influential effects that result in the influenced communities. We propose a novel problem, named Top-L most Influential Community DEtection (TopL-ICDE) over social networks, which aims to retrieve top-L seed communities with the highest influences, having high structural cohesiveness, and containing user-specified query keywords. In order to efficiently tackle the TopL-ICDE problem, we design effective pruning strategies to filter out false alarms of seed communities and propose an effective index mechanism to facilitate efficient Top-L community retrieval. We develop an efficient TopL-ICDE answering algorithm by traversing the index and applying our proposed pruning strategies. We also formulate and tackle a variant of TopL-ICDE, named diversified top-L most influential community detection (DTopL-ICDE), which returns a set of L diversified communities with the highest diversity score (i.e., collaborative influences by L communities). We prove that DTopL-ICDE is NP-hard, and propose an efficient greedy algorithm with our designed diversity score pruning. Through extensive experiments, we verify the efficiency and effectiveness of our proposed TopL-ICDE and DTopL-ICDE approaches over real/synthetic social networks under various parameter settings.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (39)
  1. W. Chen, C. Wang, and Y. Wang, “Scalable influence maximization for prevalent viral marketing in large-scale social networks,” in Proceedings of the International Conference on Knowledge Discovery and Data Mining (SIGKDD), 2010, pp. 1029–1038.
  2. Y. Tang, Y. Shi, and X. Xiao, “Influence maximization in near-linear time: A martingale approach,” in Proceedings of the International Conference on Management of Data (SIGMOD), 2015, pp. 1539–1554.
  3. S. Tu and S. Neumann, “A viral marketing-based model for opinion dynamics in online social networks,” in Proceedings of the ACM Web Conference 2022, 2022, pp. 1570–1578.
  4. X. Song, J. Lian, H. Huang, M. Wu, H. Jin, and X. Xie, “Friend recommendations with self-rescaling graph neural networks,” in Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2022, pp. 3909–3919.
  5. J. Fan, J. Qiu, Y. Li, Q. Meng, D. Zhang, G. Li, K.-L. Tan, and X. Du, “OCTOPUS: An Online Topic-Aware Influence Analysis System for Social Networks,” in 2018 IEEE 34th International Conference on Data Engineering (ICDE), Apr. 2018, pp. 1569–1572.
  6. K. Wang, S. Wang, X. Cao, and L. Qin, “Efficient Radius-Bounded Community Search in Geo-Social Networks,” IEEE Transactions on Knowledge and Data Engineering, vol. 34, no. 9, pp. 4186–4200, Sep. 2022.
  7. Q. Liu, M. Zhao, X. Huang, J. Xu, and Y. Gao, “Truss-based Community Search over Large Directed Graphs,” in Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, May 2020, pp. 2183–2197.
  8. L. Sun, X. Huang, R.-H. Li, B. Choi, and J. Xu, “Index-based intimate-core community search in large weighted graphs,” IEEE Transactions on Knowledge and Data Engineering, vol. 34, no. 9, pp. 4313–4327, 2020.
  9. B. Liu, F. Zhang, W. Zhang, X. Lin, and Y. Zhang, “Efficient community search with size constraint,” in 2021 IEEE 37th International Conference on Data Engineering (ICDE).   IEEE, 2021, pp. 97–108.
  10. C.-Y. Wang, Y. Chen, and K. R. Liu, “Game-theoretic cross social media analytic: How yelp ratings affect deal selection on groupon?” IEEE Transactions on Knowledge and Data Engineering, vol. 30, no. 5, pp. 908–921, 2017.
  11. X. Huang and L. V. S. Lakshmanan, “Attribute-Driven Community Search,” VLDB-2017, vol. 10, no. 9, pp. 949–960, 2017.
  12. A. Al-Baghdadi and X. Lian, “Topic-based community search over spatial-social networks,” Proceedings of the VLDB Endowment, vol. 13, no. 12, pp. 2104–2117, Aug. 2020.
  13. W. Chen, C. Wang, and Y. Wang, “Scalable influence maximization for prevalent viral marketing in large-scale social networks,” in Proceedings of the International Conference on Knowledge Discovery and Data Mining (SIGKDD), ser. KDD ’10, Jul. 2010, pp. 1029–1038.
  14. D. Kempe, J. Kleinberg, and É. Tardos, “Maximizing the spread of influence through a social network,” in Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Aug. 2003, pp. 137–146.
  15. U. Feige, “A threshold of ln n for approximating set cover,” Journal of the ACM, vol. 45, no. 4, pp. 634–652, Jul. 1998.
  16. J. Cohen, “Trusses: Cohesive subgraphs for social network analysis,” National security agency technical report, vol. 16, no. 3.1, 2008.
  17. U. Feige, “A threshold of ln n for approximating set cover (preliminary version),” in STOC-96, ser. STOC ’96, Jul. 1996, pp. 314–318.
  18. W. Luo, X. Zhou, K. Li, Y. Gao, and K. Li, “Efficient Influential Community Search in Large Uncertain Graphs,” IEEE Transactions on Knowledge and Data Engineering, vol. 35, no. 4, pp. 3779–3793, Apr. 2023.
  19. Y. Zhou, Y. Fang, W. Luo, and Y. Ye, “Influential Community Search over Large Heterogeneous Information Networks,” Proceedings of the VLDB Endowment, vol. 16, no. 8, pp. 2047–2060, Apr. 2023.
  20. S. Chen, J. Fan, G. Li, J. Feng, K.-l. Tan, and J. Tang, “Online topic-aware influence maximization,” Proceedings of the VLDB Endowment, vol. 8, no. 6, pp. 666–677, Feb. 2015.
  21. M. E. J. Newman and D. J. Watts, “Renormalization group analysis of the small-world network model,” Physics Letters A, vol. 263, no. 4, pp. 341–346, Dec. 1999.
  22. X. Huang and L. V. S. Lakshmanan, “Attribute-driven community search,” Proceedings of the VLDB Endowment, vol. 10, no. 9, pp. 949–960, May 2017.
  23. M. Sozio and A. Gionis, “The community-search problem and how to plan a successful cocktail party,” in Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ser. KDD ’10, Jul. 2010, pp. 939–948.
  24. W. Cui, Y. Xiao, H. Wang, and W. Wang, “Local search of communities in large graphs,” in Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, ser. SIGMOD ’14, Jun. 2014, pp. 991–1002.
  25. W. Cui, Y. Xiao, H. Wang, Y. Lu, and W. Wang, “Online search of overlapping communities,” in Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, ser. SIGMOD ’13, Jun. 2013, pp. 277–288.
  26. M. E. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical Review E, vol. 69, no. 2, p. 026113, 2004.
  27. S. Fortunato, “Community detection in graphs,” Physics reports, vol. 486, no. 3-5, pp. 75–174, 2010.
  28. Z. Xu, Y. Ke, Y. Wang, H. Cheng, and J. Cheng, “A model-based approach to attributed graph clustering,” in Proceedings of International Conference on Management of Data (SIGMOD), 2012, pp. 505–516.
  29. A. Conte, T. De Matteis, D. De Sensi, R. Grossi, A. Marino, and L. Versari, “D2k: scalable community detection in massive networks via small-diameter k-plexes,” in Proceedings of ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), 2018, pp. 1272–1281.
  30. N. Veldt, D. F. Gleich, and A. Wirth, “A Correlation Clustering Framework for Community Detection,” in Proceedings of the 2018 World Wide Web Conference, ser. WWW ’18.   Republic and Canton of Geneva, CHE: International World Wide Web Conferences Steering Committee, Apr. 2018, pp. 439–448.
  31. J. Tang, X. Tang, X. Xiao, and J. Yuan, “Online processing algorithms for influence maximization,” in Proceedings of the 2018 International Conference on Management of Data, 2018, pp. 991–1005.
  32. N. Ohsaka, “The solution distribution of influence maximization: A high-level experimental study on three algorithmic approaches,” in Proceedings of the 2020 ACM SIGMOD international conference on management of data, 2020, pp. 2151–2166.
  33. J. Ali, M. Babaei, A. Chakraborty, B. Mirzasoleiman, K. Gummadi, and A. Singla, “On the fairness of time-critical influence maximization in social networks,” IEEE Transactions on Knowledge and Data Engineering, 2021.
  34. D. Li, J. Liu, J. Jeon, S. Hong, T. Le, D. Lee, and N. Park, “Large-scale data-driven airline market influence maximization,” in Proceedings of ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), 2021, pp. 914–924.
  35. J. Li, X. Wang, K. Deng, X. Yang, T. Sellis, and J. X. Yu, “Most influential community search over large social networks,” in 2017 IEEE 33rd international conference on data engineering (ICDE).   IEEE, 2017, pp. 871–882.
  36. Z. Yang, A. W.-C. Fu, and R. Liu, “Diversified Top-k Subgraph Querying in a Large Graph,” in Proceedings of the International Conference on Management of Data (SIGMOD), ser. SIGMOD ’16, Jun. 2016, pp. 1167–1182.
  37. X. Huang, H. Cheng, R.-H. Li, L. Qin, and J. X. Yu, “Top-K structural diversity search in large networks,” The VLDB Journal, vol. 24, no. 3, pp. 319–343, Jun. 2015.
  38. C.-H. Tai, P. S. Yu, D.-N. Yang, and M.-S. Chen, “Structural Diversity for Resisting Community Identification in Published Social Networks,” IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 1, pp. 235–252, Jan. 2014.
  39. A. A. Chowdhary, C. Liu, L. Chen, R. Zhou, and Y. Yang, “Finding attribute diversified community over large attributed networks,” World Wide Web, vol. 25, no. 2, pp. 569–607, Mar. 2022.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now