THP: Topological Hawkes Processes for Learning Granger Causality on Event Sequences

• URL: http://arxiv.org/abs/2105.10884v1
• Date: Sun, 23 May 2021 08:33:46 GMT
• Title: THP: Topological Hawkes Processes for Learning Granger Causality on Event Sequences
• Authors: Ruichu Cai, Siyu Wu, Jie Qiao, Zhifeng Hao, Keli Zhang, Xi Zhang
• Abstract summary: We propose a Granger causality learning method on Topological Hawkes processes (THP) in a likelihood framework. The proposed method is featured with the graph convolution-based likelihood function of THP and a sparse optimization scheme with an Expectation-Maximization of the likelihood function.
• Score: 31.895008425796792
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Learning Granger causality among event types on multi-type event sequences is an important but challenging task. Existing methods, such as the Multivariate Hawkes processes, mostly assumed that each sequence is independent and identically distributed. However, in many real-world applications, it is commonplace to encounter a topological network behind the event sequences such that an event is excited or inhibited not only by its history but also by its topological neighbors. Consequently, the failure in describing the topological dependency among the event sequences leads to the error detection of the causal structure. By considering the Hawkes processes from the view of temporal convolution, we propose a Topological Hawkes processes (THP) to draw a connection between the graph convolution in topology domain and the temporal convolution in time domains. We further propose a Granger causality learning method on THP in a likelihood framework. The proposed method is featured with the graph convolution-based likelihood function of THP and a sparse optimization scheme with an Expectation-Maximization of the likelihood function. Theoretical analysis and experiments on both synthetic and real-world data demonstrate the effectiveness of the proposed method.

Related papers

• TNPAR: Topological Neural Poisson Auto-Regressive Model for Learning Granger Causal Structure from Event Sequences [27.289511320823895]
  Learning Granger causality from event sequences is a challenging but essential task across various applications. We devise a unified topological neural Poisson auto-regressive model with two processes. Experiments on simulated and real-world data demonstrate the effectiveness of our approach.
  arXiv  Detail & Related papers  (2023-06-25T03:31:47Z)
• Structural Hawkes Processes for Learning Causal Structure from Discrete-Time Event Sequences [36.76562861154494]
  The proposed method is featured with the minorization-maximization of the likelihood function and a sparse optimization scheme. Results show that the instantaneous effect is a blessing rather than a curse, and the causal structure is identifiable under the existence of the instantaneous effect.
  arXiv  Detail & Related papers  (2023-05-10T08:52:07Z)
• FaDIn: Fast Discretized Inference for Hawkes Processes with General Parametric Kernels [82.53569355337586]
  This work offers an efficient solution to temporal point processes inference using general parametric kernels with finite support. The method's effectiveness is evaluated by modeling the occurrence of stimuli-induced patterns from brain signals recorded with magnetoencephalography (MEG) Results show that the proposed approach leads to an improved estimation of pattern latency than the state-of-the-art.
  arXiv  Detail & Related papers  (2022-10-10T12:35:02Z)
• Causality-Based Multivariate Time Series Anomaly Detection [63.799474860969156]
  We formulate the anomaly detection problem from a causal perspective and view anomalies as instances that do not follow the regular causal mechanism to generate the multivariate data. We then propose a causality-based anomaly detection approach, which first learns the causal structure from data and then infers whether an instance is an anomaly relative to the local causal mechanism. We evaluate our approach with both simulated and public datasets as well as a case study on real-world AIOps applications.
  arXiv  Detail & Related papers  (2022-06-30T06:00:13Z)
• Causal Discovery in Hawkes Processes by Minimum Description Length [11.627871646343502]
  Hawkes processes are a class of temporal point processes which exhibit a natural notion of causality. This paper approaches the problem of learning Granger-causal network in multi-dimensional Hawkes processes. We compare our algorithm with the state-of-the-art baseline methods on synthetic and real-world financial data.
  arXiv  Detail & Related papers  (2022-06-10T10:16:03Z)
• An Empirical Study: Extensive Deep Temporal Point Process [23.9359814366167]
  We first review recent research emphasis and difficulties in modeling asynchronous event sequences with deep temporal pointprocess. We propose a Granger causality discovery framework for exploiting the relations among multi-types of events.
  arXiv  Detail & Related papers  (2021-10-19T10:15:00Z)
• Hawkes Processes on Graphons [85.6759041284472]
  We study Hawkes processes and their variants that are associated with Granger causality graphs. We can generate the corresponding Hawkes processes and simulate event sequences. We learn the proposed model by minimizing the hierarchical optimal transport distance between the generated event sequences and the observed ones.
  arXiv  Detail & Related papers  (2021-02-04T17:09:50Z)
• Supporting Optimal Phase Space Reconstructions Using Neural Network Architecture for Time Series Modeling [68.8204255655161]
  We propose an artificial neural network with a mechanism to implicitly learn the phase spaces properties. Our approach is either as competitive as or better than most state-of-the-art strategies.
  arXiv  Detail & Related papers  (2020-06-19T21:04:47Z)
• Semiparametric Bayesian Forecasting of Spatial Earthquake Occurrences [77.68028443709338]
  We propose a fully Bayesian formulation of the Epidemic Type Aftershock Sequence (ETAS) model. The occurrence of the mainshock earthquakes in a geographical region is assumed to follow an inhomogeneous spatial point process.
  arXiv  Detail & Related papers  (2020-02-05T10:11:26Z)
• Polynomial-Time Exact MAP Inference on Discrete Models with Global Dependencies [83.05591911173332]
  junction tree algorithm is the most general solution for exact MAP inference with run-time guarantees. We propose a new graph transformation technique via node cloning which ensures a run-time for solving our target problem independently of the form of a corresponding clique tree.
  arXiv  Detail & Related papers  (2019-12-27T13:30:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.