TsFSIM: a three-step fast selection algorithm for influence maximisation in social network
Influence maximisation is the problem of selecting a specific number of nodes which can maximise the influence spread of social networks. For its significant practical applications, the influence maximisation problem has been widely used in many fields, such as network marketing and rumour control....
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2021-10-01
|
| Series: | Connection Science |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1080/09540091.2021.1904206 |
| _version_ | 1797684058825687040 |
|---|---|
| author | Liqing Qiu Shiqi Sai Xiangbo Tian |
| author_facet | Liqing Qiu Shiqi Sai Xiangbo Tian |
| author_sort | Liqing Qiu |
| collection | DOAJ |
| description | Influence maximisation is the problem of selecting a specific number of nodes which can maximise the influence spread of social networks. For its significant practical applications, the influence maximisation problem has been widely used in many fields, such as network marketing and rumour control. However, most existing algorithms tend to select accuracy or efficiency to optimise, which leads to their poor performance. Therefore, a Three-step Fast Selection algorithm for Influence Maximisation (TsFSIM) is proposed in this paper. Firstly, a new method to evaluate nodes' influence spread is proposed, called Influence Estimation Value. Influence Estimation Value (IEV) combines the node's and its neighbours' degree to estimate its influence. This can improve the efficiency of our algorithm. Afterwards, based on IEV, a three-stage filtering strategy is proposed. This strategy can improve the accuracy of our algorithm greatly. Finally, experimental results on seven real-world networks show that the proposed method is more accurate than other methods while keeping competitive efficiency. |
| first_indexed | 2024-03-12T00:23:54Z |
| format | Article |
| id | doaj.art-3891fccec940469199b982878354afb2 |
| institution | Directory Open Access Journal |
| issn | 0954-0091 1360-0494 |
| language | English |
| last_indexed | 2024-03-12T00:23:54Z |
| publishDate | 2021-10-01 |
| publisher | Taylor & Francis Group |
| record_format | Article |
| series | Connection Science |
| spelling | doaj.art-3891fccec940469199b982878354afb22023-09-15T10:47:59ZengTaylor & Francis GroupConnection Science0954-00911360-04942021-10-0133485486910.1080/09540091.2021.19042061904206TsFSIM: a three-step fast selection algorithm for influence maximisation in social networkLiqing Qiu0Shiqi Sai1Xiangbo Tian2Shandong University of Science and TechnologyShandong University of Science and TechnologyShandong University of Science and TechnologyInfluence maximisation is the problem of selecting a specific number of nodes which can maximise the influence spread of social networks. For its significant practical applications, the influence maximisation problem has been widely used in many fields, such as network marketing and rumour control. However, most existing algorithms tend to select accuracy or efficiency to optimise, which leads to their poor performance. Therefore, a Three-step Fast Selection algorithm for Influence Maximisation (TsFSIM) is proposed in this paper. Firstly, a new method to evaluate nodes' influence spread is proposed, called Influence Estimation Value. Influence Estimation Value (IEV) combines the node's and its neighbours' degree to estimate its influence. This can improve the efficiency of our algorithm. Afterwards, based on IEV, a three-stage filtering strategy is proposed. This strategy can improve the accuracy of our algorithm greatly. Finally, experimental results on seven real-world networks show that the proposed method is more accurate than other methods while keeping competitive efficiency.http://dx.doi.org/10.1080/09540091.2021.1904206social networksinfluence maximisationthree-stage filterfast selection |
| spellingShingle | Liqing Qiu Shiqi Sai Xiangbo Tian TsFSIM: a three-step fast selection algorithm for influence maximisation in social network Connection Science social networks influence maximisation three-stage filter fast selection |
| title | TsFSIM: a three-step fast selection algorithm for influence maximisation in social network |
| title_full | TsFSIM: a three-step fast selection algorithm for influence maximisation in social network |
| title_fullStr | TsFSIM: a three-step fast selection algorithm for influence maximisation in social network |
| title_full_unstemmed | TsFSIM: a three-step fast selection algorithm for influence maximisation in social network |
| title_short | TsFSIM: a three-step fast selection algorithm for influence maximisation in social network |
| title_sort | tsfsim a three step fast selection algorithm for influence maximisation in social network |
| topic | social networks influence maximisation three-stage filter fast selection |
| url | http://dx.doi.org/10.1080/09540091.2021.1904206 |
| work_keys_str_mv | AT liqingqiu tsfsimathreestepfastselectionalgorithmforinfluencemaximisationinsocialnetwork AT shiqisai tsfsimathreestepfastselectionalgorithmforinfluencemaximisationinsocialnetwork AT xiangbotian tsfsimathreestepfastselectionalgorithmforinfluencemaximisationinsocialnetwork |