کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
394449 | 665805 | 2010 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Minimizing the expected complete influence time of a social network
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Minimizing the expected complete influence time of a social network Minimizing the expected complete influence time of a social network](/preview/png/394449.png)
چکیده انگلیسی
Complete influence time specifies how long it takes to influence all individuals in a social network, which plays an important role in many real-life applications. In this paper, we study the problem of minimizing the expected complete influence time of social networks. We propose the incremental chance model to characterize the diffusion of influence, which is progressive and able to achieve complete influence. Theoretical properties of the expected complete influence time under the incremental chance model are presented. In order to trade off between optimality and complexity, we design a framework of greedy algorithms. Finally, we carry out experiments to show the effectiveness of the proposed algorithms.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 180, Issue 13, 1 July 2010, Pages 2514–2527
Journal: Information Sciences - Volume 180, Issue 13, 1 July 2010, Pages 2514–2527
نویسندگان
Yaodong Ni, Lei Xie, Zhi-Qiang Liu,