A new greedy method based on cascade model for the influence maximization problem in social networks.
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social networks that maximize the influential spreading. Recently, there is a quick growing in studying on and diffusion. In recent years, several algorithms have been proposed for influence maximization problem. These studies include viral marketing, spreading of rumors, innovation, spread of diseases, etc. In this paper we present a new method for solving the for influence maximization problem that is called ICIM-GREEDY algorithm. In the proposed algorithm, we consider two important criteria that are not considered in previous work, one is strength of influence and another is sensitivity to influence. The proposed method is evaluated on standard datasets. The results show that the proposed method compared to other comparable algorithms has a better quality in finding the 50 influential nodes (seeds). Furthermore, ICIM-GREEDY often has better time complexity than other compared algorithms due to relatively fast convergence.
پرداخت حق اشتراک به معنای پذیرش "شرایط خدمات" پایگاه مگیران از سوی شماست.
اگر عضو مگیران هستید:
اگر مقاله ای از شما در مگیران نمایه شده، برای استفاده از اعتبار اهدایی سامانه نویسندگان با ایمیل منتشرشده ثبت نام کنید. ثبت نام
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.