Hawkes Processes are a type of point process for modeling self-excitation, i.e., when the occurrence of an event makes future events more likely to occur. The corresponding self-triggering function of this type of process may be inferred through an Unconstrained Optimization-based method for maximization of its corresponding Loglikelihood function. Unfortunately, the non-convexity of this procedure, along with the ill-conditioning of the initialization of the self- triggering function parameters, may lead to a consequent instability of this method. Here, we introduce Renormalization Factors, over four types of parametric kernels, as a solution to this instability. These factors are derived for each of the self-triggering function parameters, and also for more than one parameter considered jointly. Experimental results show that the Maximum Likelihood Estimation method shows improved performance with Renormalization Factors over sets of sequences of several different lengths.
Regarding the the utilization of parametric functions for modeling SEKs in HPs: @cite_15 uses exponential kernels for modeling quick-decay in finance or web data. @cite_10 models slow decay influence with power-law kernels in earthquake, while @cite_11 performs power law modeling experiments with social media-related data.
@cite_15 @cite_10 @cite_11
2299902744 2949377321
Learning the influence structure of multiple time series data is of great interest to many disciplines. This paper studies the problem of recovering the causal structure in network of multivariate linear Hawkes processes. In such processes, the occurrence of an event in one process affects the probability of occurrence of new events in some other processes. Thus, a natural notion of causality exists between such processes captured by the support of the excitation matrix. We show that the resulting causal influence network is equivalent to the Directed Information graph (DIG) of the processes, which encodes the causal factorization of the joint distribution of the processes. Furthermore, we present an algorithm for learning the support of excitation matrix (or equivalently the DIG). The performance of the algorithm is evaluated on synthesized multivariate Hawkes networks as well as a stock market and MemeTracker real-world dataset. 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 behaviors 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 processes to develop a statistical model that allows us to make accurate predictions. Our model requires no training or expensive feature 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 observing it for just one hour.