کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10321911 | 660776 | 2015 | 23 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A fast algorithm for finding most influential people based on the linear threshold model
ترجمه فارسی عنوان
الگوریتم سریع برای یافتن افراد با نفوذ بر اساس مدل آستانه خطی
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
شبکه های اجتماعی، بازیابی افراد تاثیرگذار، حداکثر سازی تاثیر، مدل آستانه خطی،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
چکیده انگلیسی
Finding the most influential people is an NP-hard problem that has attracted many researchers in the field of social networks. The problem is also known as influence maximization and aims to find a number of people that are able to maximize the spread of influence through a target social network. In this paper, a new algorithm based on the linear threshold model of influence maximization is proposed. The main benefit of the algorithm is that it reduces the number of investigated nodes without loss of quality to decrease its execution time. Our experimental results based on two well-known datasets show that the proposed algorithm is much faster and at the same time more efficient than the state of the art algorithms.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Expert Systems with Applications - Volume 42, Issue 3, 15 February 2015, Pages 1353-1361
Journal: Expert Systems with Applications - Volume 42, Issue 3, 15 February 2015, Pages 1353-1361
نویسندگان
Khadije Rahimkhani, Abolfazl Aleahmad, Maseud Rahgozar, Ali Moeini,