A nature-inspired influence propagation model for the community expansion problem

被引:6
|
作者
Bi, Yuanjun [1 ]
Wu, Weili [1 ,2 ]
Zhu, Yuqing [1 ]
Fan, Lidan [1 ]
Wang, Ailian [2 ]
机构
[1] Univ Texas Dallas, Dept Comp Sci, Richardson, TX 75080 USA
[2] TaiYuan Univ Technol, Coll Comp Sci & Technol, Taiyuan 030024, Shanxi, Peoples R China
基金
美国国家科学基金会;
关键词
Community expansion; Physical model; Social influence; Linear programming;
D O I
10.1007/s10878-013-9686-9
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Influence propagation has been widely studied in social networks recently. Most of these existing work mainly focuses on the individual influence or the seed set influence. However, a large range of real world applications are related with the influence from communities. In this paper, we argue that the specific structure of community makes the influence propagation from a community different from previous influence propagation from an individual or a seed set. Inspired by the charged system in the physic, a new community influence propagation model is built, which provides a natural description about the process of influence propagation and explains why the influence makes communities expand. Based on this physical model, we define the community expansion problem. And two objective functions are proposed for choosing proper candidates to enlarge a community, taking into account the cost and benefit. Then a linear programming approach is designed to maximize those two objective functions. To validate our ideas and algorithm, we construct experiments on three real-world networks. The results demonstrate that our model and algorithm are effective in choosing proper candidates for expanding a community, comparing to other two algorithms.
引用
收藏
页码:513 / 528
页数:16
相关论文
共 50 条
  • [41] Nature-inspired total synthesis
    Laura Furst
    Corey R J Stephenson
    Nature Chemical Biology, 2011, 7 : 582 - 583
  • [42] Nature-Inspired Hierarchical Steels
    Cao, Shan Cecilia
    Liu, Jiabin
    Zhu, Linli
    Li, Ling
    Dao, Ming
    Lu, Jian
    Ritchie, Robert O.
    SCIENTIFIC REPORTS, 2018, 8
  • [43] Community Detection in Weighted Directed Networks Using Nature-Inspired Heuristics
    Osaba, Eneko
    Del Ser, Javier
    Camacho, David
    Galvez, Akemi
    Iglesias, Andres
    Fister, Iztok, Jr.
    Fister, Iztok
    INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING (IDEAL 2018), PT II, 2018, 11315 : 325 - 335
  • [44] JMA: Nature-Inspired Java']Java Macaque Algorithm for Optimization Problem
    Karunanidy, Dinesh
    Ramalingam, Subramanian
    Dumka, Ankur
    Singh, Rajesh
    Rashid, Mamoon
    Gehlot, Anita
    Alshamrani, Sultan S.
    AlGhamdi, Ahmed Saeed
    MATHEMATICS, 2022, 10 (05)
  • [45] Nature-inspired metaheuristic optimization algorithms for urban transit routing problem
    Li, Qian
    Guo, Liang
    ENGINEERING RESEARCH EXPRESS, 2023, 5 (01):
  • [46] Nature-inspired algorithms for 0-1 knapsack problem: A survey
    Zhou, Yongquan
    Shi, Yan
    Wei, Yuanfei
    Luo, Qifang
    Tang, Zhonghua
    NEUROCOMPUTING, 2023, 554
  • [47] A Comparison of Three Recent Nature-Inspired Metaheuristics for the Set Covering Problem
    Crawford, Broderick
    Soto, Ricardo
    Pena, Cristian
    Riquelme-Leiva, Marco
    Torres-Rojas, Claudio
    Misra, Sanjay
    Johnson, Franklin
    Paredes, Fernando
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2015, PT IV, 2015, 9158 : 431 - 443
  • [48] Wind Farm Layout Optimization Problem Using Nature-Inspired Algorithms
    Kumar, Mukesh
    Sharma, Ajay
    Sharma, Nirmala
    Sharma, Fani Bhushan
    Bhadu, Mahendra
    JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING, 2024, 2024
  • [49] An Efficient Nature-Inspired Method to Solve the Shortest Path Tour Problem
    Ma, Yi-Ming
    Zhou, Hang
    Hu, Xiao-Bing
    2021 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI 2021), 2021,
  • [50] LEARNING FROM NATURE: NATURE-INSPIRED ALGORITHMS
    Albeanu, Grigore
    Madsen, Henrik
    Popentiu-Vladicescu, Florin
    ELEARNING VISION 2020!, VOL II, 2016, : 477 - 482