A Modified Degree Discount Heuristic for Influence Maximization in Social Networks
نویسندگان
چکیده
منابع مشابه
Heuristic Algorithms for Influence Maximization in Partially Observable Social Networks
We consider the problem of selecting the most influential members within a social network, in order to disseminate a message as widely as possible. This problem, also referred to as seed selection for influence maximization, has been under intensive investigation since the emergence of social networks. Nonetheless, a large body of existing research is based on the assumption that the network is...
متن کاملGoing viral: Optimizing Discount Allocation in Social Networks for Influence Maximization
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...
متن کاملA Pagerank-Inspired Heuristic Scheme for Influence Maximization in Social Networks
This article focused on seeking a new heuristic algorithm for the influence maximization problem in complex social networks, in which a small subset of individuals are intentionally selected as seeds to trigger a large cascade of further adoptions of a new behavior under certain influence cascade models. In literature, degree and other centrality-based heuristics are commonly used to estimate t...
متن کاملIncentive Compatible Influence Maximization in Social Networks
Information diffusion and influence maximization in social networks are well studied problems and various models and algorithms have been proposed. The main assumption in these studies is that the influence probabilities are known to the social planner. The influence probabilities, however can vary significantly with the type of the information and the time at which the information is propagati...
متن کاملStigmergy-Based Influence Maximization in Social Networks
Influence maximization is an important research topic which has been extensively studied in various fields. In this paper, a stigmergybased approach has been proposed to tackle the influence maximization problem. We modelled the influence propagation process as ant’s crawling behaviours, and their communications rely on a kind of biological chemicals, i.e., pheromone. The amount of the pheromon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2020
ISSN: 1877-0509
DOI: 10.1016/j.procs.2020.03.045