Can we learn the influence of a set of people in a social network from cascades of information diffusion? This question is often addressed by a two-stage approach: first learn a diffusion model, and then calculate the influence based on the learned model. Thus, the success of this approach relies heavily on the correctness of the diffusion model which is hard to verify for real world data. In this paper, we exploit the insight that the influence functions in many diffusion models are coverage functions, and propose a novel parameterization of such functions using a convex combination of random basis functions. Moreover, we propose an efficient maximum likelihood based algorithm to learn such functions directly from cascade data, and hence b...
Abstract. Information diffusion over a social network is analyzed by model-ing the successive intera...
Influence maximization (IM) is the process of choosing a set of seeds from a social network so that ...
We address a problem of efficiently estimating the influence of a node in information diffusion over...
<p>Can we learn the influence of a set of people in a social network from cascades of information di...
Can we learn the influence of a set of people in a social network from cascades of informa-tion diff...
Can we learn the influence of a set of people in a social network from cascades of informa-tion diff...
Can we learn the influence of a set of people in a social network from cascades of informa-tion diff...
Coverage functions are an important class of discrete functions that capture the law of diminishing ...
We consider the structure learning problem of influence diffusion on social networks from the observ...
International audienceFinding a set of users that can maximize the spread of information in a social...
International audienceFinding a set of users that can maximize the spread of information in a social...
The diffusion of information and spreading influence are ubiquitous in social networks. How to model...
International audienceWe address the problem of influence maximization when the social network is ac...
International audienceWe address the problem of influence maximization when the social network is ac...
International audienceWe address the problem of influence maximization when the social network is ac...
Abstract. Information diffusion over a social network is analyzed by model-ing the successive intera...
Influence maximization (IM) is the process of choosing a set of seeds from a social network so that ...
We address a problem of efficiently estimating the influence of a node in information diffusion over...
<p>Can we learn the influence of a set of people in a social network from cascades of information di...
Can we learn the influence of a set of people in a social network from cascades of informa-tion diff...
Can we learn the influence of a set of people in a social network from cascades of informa-tion diff...
Can we learn the influence of a set of people in a social network from cascades of informa-tion diff...
Coverage functions are an important class of discrete functions that capture the law of diminishing ...
We consider the structure learning problem of influence diffusion on social networks from the observ...
International audienceFinding a set of users that can maximize the spread of information in a social...
International audienceFinding a set of users that can maximize the spread of information in a social...
The diffusion of information and spreading influence are ubiquitous in social networks. How to model...
International audienceWe address the problem of influence maximization when the social network is ac...
International audienceWe address the problem of influence maximization when the social network is ac...
International audienceWe address the problem of influence maximization when the social network is ac...
Abstract. Information diffusion over a social network is analyzed by model-ing the successive intera...
Influence maximization (IM) is the process of choosing a set of seeds from a social network so that ...
We address a problem of efficiently estimating the influence of a node in information diffusion over...