• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Mixture of mutually exciting processes for viral diffusion. ICML, (2013)

by SH Yang, H Zha
Add To MetaCart

Tools

Sorted by:
Results 1 - 10 of 12
Next 10 →

Scalable influence estimation in continuous-time diffusion networks

by Nan Du, Le Song, Manuel Gomez-rodriguez, Hongyuan Zha - In , 2013
"... If a piece of information is released from a media site, can we predict whether it may spread to one million web pages, in a month? This influence estimation problem is very challenging since both the time-sensitive nature of the task and the requirement of scalability need to be addressed simultane ..."
Abstract - Cited by 23 (6 self) - Add to MetaCart
If a piece of information is released from a media site, can we predict whether it may spread to one million web pages, in a month? This influence estimation problem is very challenging since both the time-sensitive nature of the task and the requirement of scalability need to be addressed simultaneously. In this paper, we propose a randomized algorithm for influence estimation in continuous-time diffusion networks. Our algorithm can estimate the influence of every node in a network with |V | nodes and |E | edges to an accuracy of using n = O(1/2) randomizations and up to logarithmic factorsO(n|E|+n|V|) computations. When used as a subroutine in a greedy influence maximization approach, our proposed algorithm is guaranteed to find a set of C nodes with the influence of at least (1 − 1/e) OPT−2C, where OPT is the optimal value. Experiments on both synthetic and real-world data show that the proposed algorithm can easily scale up to networks of millions of nodes while significantly improves over previous state-of-the-arts in terms of the accuracy of the estimated influence and the quality of the selected nodes in maximizing the influence. 1
(Show Context)

Citation Context

...equence of recent work has argued that modeling cascade data and information diffusion using continuous-time diffusion networks can provide significantly more accurate models than discretetime models =-=[8, 9, 10, 11, 12, 13, 14, 15]-=-. There is a twofold rationale behind this modeling choice. First, since follow-ups occur asynchronously, continuous variables seem more appropriate to represent them. Artificially discretizing the ti...

Shaping Social Activity by Incentivizing Users

by Mehrdad Farajtabar, Nan Du, Manuel Gomez Rodriguez, Isabel Valera, Hongyuan Zha, Le Song
"... Events in an online social network can be categorized roughly into endogenous events, where users just respond to the actions of their neighbors within the network, or exogenous events, where users take actions due to drives external to the network. How much external drive should be provided to each ..."
Abstract - Cited by 10 (7 self) - Add to MetaCart
Events in an online social network can be categorized roughly into endogenous events, where users just respond to the actions of their neighbors within the network, or exogenous events, where users take actions due to drives external to the network. How much external drive should be provided to each user, such that the network activity can be steered towards a target state? In this paper, we model social events using multivariate Hawkes processes, which can capture both endogenous and exogenous event intensities, and derive a time dependent linear relation between the intensity of exogenous events and the overall network activity. Exploiting this connection, we develop a convex optimization framework for determining the required level of external drive in order for the network to reach a desired activity level. We experimented with event data gathered from Twitter, and show that our method can steer the activity of the network more accurately than alternatives. 1
(Show Context)

Citation Context

...citation, where a user simply follows what his neighbors are doing due to peer pressure. These social phenomena have been made analogy to the occurrence of earthquake [18] and the spread of epidemics =-=[19]-=-, and can be well-captured by multivariate Hawkes processes [6] as shown in a number of recent works (e.g., [7, 8, 9, 10, 11, 12]). More specifically, a multivariate Hawkes process is a counting proce...

SEISMIC: A Self-Exciting Point Process Model for Predicting Tweet Popularity

by Qingyuan Zhao, Murat A. Erdogdu, Hera Y. He, Anand Rajaraman, Jure Leskovec
"... Social networking websites allow users to create and share content. Big information cascades of post resharing can form as users of these sites reshare others ’ posts with their friends and followers. One of the central challenges in understanding such cascading be-haviors is in forecasting informat ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Social networking websites allow users to create and share content. Big information cascades of post resharing can form as users of these sites reshare others ’ posts with their friends and followers. One of the central challenges in understanding such cascading be-haviors is in forecasting information outbreaks, where a single post becomes widely popular by being reshared by many users. In this paper, we focus on predicting the final number of reshares of a given post. We build on the theory of self-exciting point pro-cesses to develop a statistical model that allows us to make accu-rate predictions. Our model requires no training or expensive fea-ture engineering. It results in a simple and efficiently computable formula that allows us to answer questions, in real-time, such as: Given a post’s resharing history so far, what is our current estimate of its final number of reshares? Is the post resharing cascade past the initial stage of explosive growth? And, which posts will be the most reshared in the future? We validate our model using one month of complete Twitter data and demonstrate a strong improvement in predictive accuracy over existing approaches. Our model gives only 15 % relative error in predicting final size of an average information cascade after ob-serving it for just one hour.
(Show Context)

Citation Context

...processes assume that all the previous instances (i.e., reshares) influence the future evolution of the process. Self-exciting point processes are frequently used to model “rich get richer” phenomena =-=[22, 23, 33, 36]-=-. They are ideal for modeling information cascades in networks because every new reshare of a post not only increases its cumulative reshare count by one, but also exposes new followers who may furthe...

Hawkes Processes with Stochastic Excitations

by Young Lee , Wai Kar , Lim , Soon Cheng , Ong
"... Abstract We propose an extension to Hawkes processes by treating the levels of self-excitation as a stochastic differential equation. Our new point process allows better approximation in application domains where events and intensities accelerate each other with correlated levels of contagion. We g ..."
Abstract - Add to MetaCart
Abstract We propose an extension to Hawkes processes by treating the levels of self-excitation as a stochastic differential equation. Our new point process allows better approximation in application domains where events and intensities accelerate each other with correlated levels of contagion. We generalize a recent algorithm for simulating draws from Hawkes processes whose levels of excitation are stochastic processes, and propose a hybrid Markov chain Monte Carlo approach for model fitting. Our sampling procedure scales linearly with the number of required events and does not require stationarity of the point process. A modular inference procedure consisting of a combination between Gibbs and Metropolis Hastings steps is put forward. We recover expectation maximization as a special case. Our general approach is illustrated for contagion following geometric Brownian motion and exponential Langevin dynamics.
(Show Context)

Citation Context

...red by their latent variable set-up, we adapted some of their hidden variable formulation within the marked point process framework into our fully Bayesian inference setting. We have leveraged ideas from previous work on self-exciting processes to consequently treating the levels of excitation as random processes. Linderman and Adams (2014) introduced a multivariate point process combining self (Hawkes) and external (Cox) flavors to study latent networks in the data. These processes have also been proposed and applied in analyzing topic diffusion and user interactions (Rodriguez et al., 2011; Yang and Zha, 2013). Farajtabar et al. (2014) put forth a temporal point process model with one intensity being modulated by the other. Bounds of self exciting processes are also studied in (Hansen et al., 2015). Differently from these, we breathe another dimension into Hawkes processes by modeling the contagion parameters as a stochastic differential equation equipped with general procedures for learning. This allows much more latitude in parameterizing the self-exciting processes as a basic building block before incorporating wider families of processes. Studies of inference for continuous SDEs have been launc...

Linear processes in high-dimension: phase space and critical properties

by Iacopo Mastromatteo , Emmanuel Bacry , Jean-François Muzy
"... Abstract In this work we investigate the generic properties of a stochastic linear model in the regime of high-dimensionality. We consider in particular the Vector AutoRegressive model (VAR) and the multivariate Hawkes process. We analyze both deterministic and random versions of these models, show ..."
Abstract - Add to MetaCart
Abstract In this work we investigate the generic properties of a stochastic linear model in the regime of high-dimensionality. We consider in particular the Vector AutoRegressive model (VAR) and the multivariate Hawkes process. We analyze both deterministic and random versions of these models, showing the existence of a stable and an unstable phase. We find that along the transition region separating the two regimes, the correlations of the process decay slowly, and we characterize the conditions under which these slow correlations are expected to become power-laws. We check our findings with numerical simulations showing remarkable agreement with our predictions. We finally argue that real systems with a strong degree of self-interaction are naturally characterized by this type of slow relaxation of the correlations.
(Show Context)

Citation Context

...we consider are Hawkes processes, a class of interacting point processes customarily used to describe self and cross-excitation phenomena [17, 18]. For a long time, Hawkes models have been extensively used to describe the occurrence of earthquakes in some given region [19, 20]. They are getting more and more popular in many other applications in which tracking how information diffuses through different “agents” is the main concern, e.g., neurobiology (neurons activity) [21], sociology (spread of terrorist activity) [22, 23] or processes on the internet (viral diffusion across social networks) [24, 25]. Their application to finance can be 5 traced back to Refs [26, 27], and has been followed by a still-ongoing spree of activity [28, 29, 30, 31, 32, 7, 8, 33, 34, 10, 9]. An N -dimensional Hawkes process is defined by a set of N counting processes evolving in continuous time X(t) = {Xi(t)}Ni=13. The probability for an event to be triggered is expressed by a stochastic intensity function Λ(t) = {Λi(t)}Ni=1 which evolves according to the dynamics: Λ(t) = µ+ ∫ t −∞ Φ(t− t′)dX(t′) , (13) where the components of µ are commonly referred as exogenous intensities (or baseline intensities), and Φ(t) i...

Multistage Campaigning in Social Networks

by Mehrdad Farajtabar , Xiaojing Ye , Sahar Harati , Le Song , Hongyuan Zha
"... Abstract We consider the problem of how to optimize multi-stage campaigning over social networks. The dynamic programming framework is employed to balance the high present reward and large penalty on low future outcome in the presence of extensive uncertainties. In particular, we establish theoreti ..."
Abstract - Add to MetaCart
Abstract We consider the problem of how to optimize multi-stage campaigning over social networks. The dynamic programming framework is employed to balance the high present reward and large penalty on low future outcome in the presence of extensive uncertainties. In particular, we establish theoretical foundations of optimal campaigning over social networks where the user activities are modeled as a multivariate Hawkes process, and we derive a time dependent linear relation between the intensity of exogenous events and several commonly used objective functions of campaigning. We further develop a convex dynamic programming framework for determining the optimal intervention policy that prescribes the required level of external drive at each stage for the desired campaigning result. Experiments on both synthetic data and the real-world MemeTracker dataset show that our algorithm can steer the user activities for optimal campaigning much more accurately than baselines.
(Show Context)

Citation Context

...er user. Given the heterogeneity of the network activity and target shape, this is a significant improvement over the baselines. Appendix F includes further results on varying number of nodes, number of stages, and duration of each stage. Campaigning results on real world networks. We also evaluate the proposed framework on real world data. To this end, we utilize the MemeTracker dataset [9] which contains the information flows captured by hyperlinks between different sites with timestamps during 9 months. This data has been previously used to validate Hawkes process models of social activity [5, 10]. For the real data, we utilize two evaluation procedures. First, similar to the synthetic case, we simulate the network, but now on a network based on the learned parameters from real data. However, the more interesting evaluation scheme would entail carrying out real intervention in a social media platform. Since this is very challenging to do, instead, in this evaluation scheme we used held-out data to mimic such procedure. Second, we form 10 pairs of clusters/cascades by selecting any 2 combinations of 5 largest clusters in the Memetracker data. Each is a cascade of events around a common ...

Modeling Tweet Arrival Times using Log-Gaussian Cox Processes

by unknown authors
"... Research on modeling time series text cor-pora has typically focused on predicting what text will come next, but less well studied is predicting when the next text event will occur. In this paper we ad-dress the latter case, framed as modeling continuous inter-arrival times under a log-Gaussian Cox ..."
Abstract - Add to MetaCart
Research on modeling time series text cor-pora has typically focused on predicting what text will come next, but less well studied is predicting when the next text event will occur. In this paper we ad-dress the latter case, framed as modeling continuous inter-arrival times under a log-Gaussian Cox process, a form of inhomo-geneous Poisson process which captures the varying rate at which the tweets ar-rive over time. In an application to ru-mour modeling of tweets surrounding the 2014 Ferguson riots, we show how inter-arrival times between tweets can be ac-curately predicted, and that incorporating textual features further improves predic-tions. 1

Video Popularity Prediction by Sentiment Propagation via Implicit Network

by Wanying Ding, Yue Shang, Lifan Guo, Xiaohua Hu, Rui Yan, Tingting He
"... Video popularity prediction plays a foundational role in many aspects of life, such as recommendation systems and invest-ment consulting. Because of its technological and economic importance, this problem has been extensively studied for years. However, four constraints have limited most related wor ..."
Abstract - Add to MetaCart
Video popularity prediction plays a foundational role in many aspects of life, such as recommendation systems and invest-ment consulting. Because of its technological and economic importance, this problem has been extensively studied for years. However, four constraints have limited most related works ’ usability. First, most feature oriented models are inadequate in the social media environment, because many videos are published with no specific content features, such as a strong cast or a famous script. Second, many studies assume that there is a linear correlation existing between view counts from early and later days, but this is not the case in every scenario. Third, numerous works just take view counts into consideration, but discount associated sen-timents. Nevertheless, it is the public opinions that directly drive a video’s final success/failure. Also, many related ap-proaches rely on a network topology, but such topologies are unavailable in many situations. Here, we propose a Dual Sentimental Hawkes Process (DSHP) to cope with all the problems above. DSHP’s innovations are reflected in three ways: (1) it breaks the ”Linear Correlation ” assumption, and implements Hawkes Process; (2) it reveals deeper fac-tors that affect a video’s popularity; and (3) it is topology free. We evaluate DSHP on four types of videos: Movies, TV Episodes, Music Videos, and Online News, and compare its performance against 6 widely used models, including Trans-lation Model, Multiple Linear Regression, KNN Regression, ARMA, Reinforced Poisson Process, and Univariate Hawkes Process. Our model outperforms all of the others, which in-dicates a promising application prospect.
(Show Context)

Citation Context

...ynamics, and proved that the Hawkes process has a promising predictive power. Inspired by this work, many derivative models have been proposed in recent years to solve various problems in social media=-=[17, 32, 16, 34, 1]-=-. Most models just implement a single self-excited Hawkes process, while the real world is too complicated to be comprehensively represented by a single process This paper also implements Hawkes proce...

HIGH DIMENSIONAL HAWKES PROCESSES

by Sylvain Delattre, Nicolas Fournier, Marc Hoffmann
"... ar ..."
Abstract - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

... et al. [3], Jaisson-Rosenbaum [21]), social networks interactions (Blundell et al. [7], Simma-Jordan [36], Zhou et al. [38]) and epidemiology like for instance viral diffusion on a network (Hang-Zha =-=[37]-=-), to name but a few. In all these contexts, observations are often represented as events (like spikes or features) associated to agents or nodes on a given network, and that arrive randomly through t...

Algorithms, Theory

by Julio Cesar, Louzada Pinto, Telecom Sudparis, Tijani Chahed, Telecom Sudparis
"... We present in this paper a framework to model informa-tion diffusion in social networks based on linear multivariate Hawkes processes. Our model exploits the effective broad-casting times of information by users, which guarantees a more realistic view of the information diffusion process. The propos ..."
Abstract - Add to MetaCart
We present in this paper a framework to model informa-tion diffusion in social networks based on linear multivariate Hawkes processes. Our model exploits the effective broad-casting times of information by users, which guarantees a more realistic view of the information diffusion process. The proposed model takes into consideration not only interac-tions between users but also interactions between topics, which provides a deeper analysis of influences in social net-works. We provide an estimation algorithm based on non-negative matrix factorization techniques, which together with a dimensionality reduction argument is able to discover, in addition, the latent community structure of the social network. We also provide several numerical results of our method.
(Show Context)

Citation Context

...Social networks, Hawkes processes, nonnegative matrix factorization 1. INTRODUCTION There has been a steady increase of interest in point processes for modeling information diffusion in networks (see =-=[16, 25, 29, 31, 32]-=-). Information diffusion is a phenomenon in social networks where users broadcast information to others in the network; for example on Twitter, users can ”tweet”. By tweeting, users broadcast informat...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University