Continuous Influence-Based Community Partition for Social Networks

• Published in: IEEE transactions on network science and engineering Vol. 9; no. 3; pp. 1187 - 1197
• Main Authors: Ni, Qiufen, Guo, Jianxiong, Wu, Weili, Wang, Huan, Wu, Jigang
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 01.05.2022; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Approximation algorithms; Combinatorial analysis; Community partition; Detection algorithms; Greedy algorithms; Heuristic algorithms; Influence functions; influence maximization; Integrated circuit modeling; Lov<inline-formula xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"> <tex-math notation="LaTeX"> acute{a}</tex-math> </inline-formula>sz extension; matroid polytope; Optimization; Partitioning algorithms; Propagation; Rounding; Social networking (online); Social networks
• ISSN: 2327-4697; 2334-329X
• DOI: 10.1109/TNSE.2021.3137353

Community partition is of great importance in social networks because of the rapid increasing network scale, data and applications. We consider the community partition problem under Linear Threshold (LT) model in social networks, which is a combinatorial optimization problem that divides the social network to disjoint <inline-formula><tex-math notation="LaTeX">m</tex-math></inline-formula> communities. Our goal is to maximize the sum of influence propagation within each community. As the influence propagation function of community partition problem is supermodular under LT model, we use the method of Lov<inline-formula><tex-math notation="LaTeX">{\acute{a}}</tex-math></inline-formula>sz Extension to relax the target influence function and transfer our goal to maximize the relaxed function over a matroid polytope. Next, we propose a continuous greedy algorithm using the properties of the relaxed function to solve our problem, which needs to be discretized in concrete implementation. Then, random rounding technique is used to convert the fractional solution to the integer solution. We present a theoretical analysis with <inline-formula><tex-math notation="LaTeX">1-1/e</tex-math></inline-formula> approximation ratio for the proposed algorithms. Extensive experiments are conducted to evaluate the performance of the proposed continuous greedy algorithms on real-world online social networks datasets. The results demonstrate that continuous community partition method can improve influence spread and accuracy of the community partition effectively.