Frequent Pattern Mining in Continuous-time Temporal Networks
- URL: http://arxiv.org/abs/2105.06399v1
- Date: Wed, 12 May 2021 02:47:24 GMT
- Title: Frequent Pattern Mining in Continuous-time Temporal Networks
- Authors: Ali Jazayeri and Christopher C. Yang
- Abstract summary: We develop a series of algorithms for mining the complete set of frequent temporal patterns in a temporal network data set.
Implementing the algorithm for three real-world data sets proves the practicality of the proposed algorithm.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Networks are used as highly expressive tools in different disciplines. In
recent years, the analysis and mining of temporal networks have attracted
substantial attention. Frequent pattern mining is considered an essential task
in the network science literature. In addition to the numerous applications,
the investigation of frequent pattern mining in networks directly impacts other
analytical approaches, such as clustering, quasi-clique and clique mining, and
link prediction. In nearly all the algorithms proposed for frequent pattern
mining in temporal networks, the networks are represented as sequences of
static networks. Then, the inter- or intra-network patterns are mined. This
type of representation imposes a computation-expressiveness trade-off to the
mining problem. In this paper, we propose a novel representation that can
preserve the temporal aspects of the network losslessly. Then, we introduce the
concept of constrained interval graphs (CIGs). Next, we develop a series of
algorithms for mining the complete set of frequent temporal patterns in a
temporal network data set. We also consider four different definitions of
isomorphism to allow noise tolerance in temporal data collection. Implementing
the algorithm for three real-world data sets proves the practicality of the
proposed algorithm and its capability to discover unknown patterns in various
settings.
Related papers
- How neural networks learn to classify chaotic time series [77.34726150561087]
We study the inner workings of neural networks trained to classify regular-versus-chaotic time series.
We find that the relation between input periodicity and activation periodicity is key for the performance of LKCNN models.
arXiv Detail & Related papers (2023-06-04T08:53:27Z) - Temporal Aggregation and Propagation Graph Neural Networks for Dynamic
Representation [67.26422477327179]
Temporal graphs exhibit dynamic interactions between nodes over continuous time.
We propose a novel method of temporal graph convolution with the whole neighborhood.
Our proposed TAP-GNN outperforms existing temporal graph methods by a large margin in terms of both predictive performance and online inference latency.
arXiv Detail & Related papers (2023-04-15T08:17:18Z) - Scalable Spatiotemporal Graph Neural Networks [14.415967477487692]
Graph neural networks (GNNs) are often the core component of the forecasting architecture.
In most pretemporal GNNs, the computational complexity scales up to a quadratic factor with the length of the sequence times the number of links in the graph.
We propose a scalable architecture that exploits an efficient encoding of both temporal and spatial dynamics.
arXiv Detail & Related papers (2022-09-14T09:47:38Z) - Generating fine-grained surrogate temporal networks [12.7211231166069]
We propose a novel and simple method for generating surrogate temporal networks.
Our method decomposes the input network into star-like structures evolving in time.
Then those structures are used as building blocks to generate a surrogate temporal network.
arXiv Detail & Related papers (2022-05-18T09:38:22Z) - Novel Features for Time Series Analysis: A Complex Networks Approach [62.997667081978825]
Time series data are ubiquitous in several domains as climate, economics and health care.
Recent conceptual approach relies on time series mapping to complex networks.
Network analysis can be used to characterize different types of time series.
arXiv Detail & Related papers (2021-10-11T13:46:28Z) - Time Series Analysis via Network Science: Concepts and Algorithms [62.997667081978825]
This review provides a comprehensive overview of existing mapping methods for transforming time series into networks.
We describe the main conceptual approaches, provide authoritative references and give insight into their advantages and limitations in a unified notation and language.
Although still very recent, this research area has much potential and with this survey we intend to pave the way for future research on the topic.
arXiv Detail & Related papers (2021-10-11T13:33:18Z) - Temporal Graph Network Embedding with Causal Anonymous Walks
Representations [54.05212871508062]
We propose a novel approach for dynamic network representation learning based on Temporal Graph Network.
For evaluation, we provide a benchmark pipeline for the evaluation of temporal network embeddings.
We show the applicability and superior performance of our model in the real-world downstream graph machine learning task provided by one of the top European banks.
arXiv Detail & Related papers (2021-08-19T15:39:52Z) - Consistency of mechanistic causal discovery in continuous-time using
Neural ODEs [85.7910042199734]
We consider causal discovery in continuous-time for the study of dynamical systems.
We propose a causal discovery algorithm based on penalized Neural ODEs.
arXiv Detail & Related papers (2021-05-06T08:48:02Z) - PRESTO: Simple and Scalable Sampling Techniques for the Rigorous
Approximation of Temporal Motif Counts [7.025709586759655]
We present an efficient and scalable algorithm to obtain rigorous approximations of the count of temporal motifs.
Our algorithm is based on a simple but effective sampling approach, which renders our algorithm practical for very large datasets.
arXiv Detail & Related papers (2021-01-18T16:35:12Z) - TempNodeEmb:Temporal Node Embedding considering temporal edge influence
matrix [0.8941624592392746]
Predicting future links among the nodes in temporal networks reveals an important aspect of the evolution of temporal networks.
Some approaches consider a simplified representation of temporal networks but in high-dimensional and generally sparse matrices.
We propose a new node embedding technique which exploits the evolving nature of the networks considering a simple three-layer graph neural network at each time step.
arXiv Detail & Related papers (2020-08-16T15:39:07Z)
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.