Results 251 to 260 of about 6,507,474 (284)

Stability and Robustness in Influence Maximization [PDF]

open access: yesACM Transactions on Knowledge Discovery From Data, 2018
In the well-studied Influence Maximization problem, the goal is to identify a set of k nodes in a social network whose joint influence on the network is maximized. A large body of recent work has justified research on Influence Maximization models and algorithms with their potential to create societal or economic ...
Xinran He
exaly   +3 more sources

Collective Influence Maximization

Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2019
The omnipresence of cascading process in complex phenomena makes the identification of a small set of influential units, which is widely believed to trigger the outbreak, always an crucial issue in network science. Formulated as Influence maximization (IM) in 2003, this NP-hard problem has received a multitude of heuristic solutions with diverse angles.
Xudong Wu   +5 more
openaire   +1 more source

Influence maximization with partial feedback

Operations Research Letters, 2020
Abstract The goal of Influence maximization (IM) is to select a set of most influential users in a social network subject to a budget constraint. In this work, we propose to study the adaptive IM problem under partial-feedback model. Our main contribution in this paper is to introduce a novel adaptive policy with bounded approximation ratio. One nice
Shaojie Tang 0001, Jing Yuan 0002
openaire   +2 more sources

A Survey on Influence Maximization Models

Expert Systems With Applications
Myriam Jaouadi, Lotfi Ben Romdhane
exaly   +2 more sources

No influence of ACTH on maximal performance

Psychopharmacology, 1995
Although it is generally accepted in the sporting world that adrenocorticotropic hormones (ACTH) and corticosteroids enhance maximal performance, this claim has never been scientifically corroborated. In a counterbalanced, double-blind design, 1 mg ACTH or placebo was injected into 16 professional cyclists. They cycled for 1 h on a bicycle ergometer at
Soetens, Eric   +2 more
openaire   +4 more sources

Influence Maximization

ACM Transactions on Knowledge Discovery from Data, 2020
Influence maximization problem attempts to find a small subset of nodes in a social network that makes the expected influence maximized, which has been researched intensively before. Most of the existing literature focus only on maximizing total influence, but it ignores whether the influential distribution is balanced through the network.
Jianxiong Guo, Weili Wu 0001
openaire   +2 more sources

Maximizing Influence

2017
This chapter describes the prerequisites—independence and expertise—that intermediaries must possess to perform their crucial functions, exert power over producers and consumers, and influence the market. Independence has structural, economic, and cognitive dimensions.
openaire   +2 more sources

Influence Maximization in Trajectory Databases

IEEE Transactions on Knowledge and Data Engineering, 2017
In this paper, we study a novel problem of influence maximization in trajectory databases that is very useful in precise location-aware advertising. It finds $k$ best trajectories to be attached with a given advertisement and maximizes the expected influence among a large group of audience. We show that the problem is NP-hard and propose both exact and
Long Guo   +4 more
openaire   +3 more sources

Banzhaf Index for Influence Maximization

2015
Social media has changed the way people communicate with each other and has brought people together. Enterprises are increasingly using it as a medium for marketing activities. However, due to the size of these networks, marketers often look for key customers (influencers) to drive the campaign to the community.
Balaji Vasan Srinivasan, Arava Sai Kumar
openaire   +1 more source

Robustness to Dependency in Influence Maximization

Management Science
In this paper, we pursue a correlation-robust study of the influence maximization problem. Departing from the classic independent cascade model, we study a diffusion process adversarially adapted to the choice of seed set. More precisely, rather than the independent coupling of known individual edge probabilities, we now evaluate a seed set’s expected
Louis Chen   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy