Related papers: The electrostatic graph algorithm: a physics-defin…
Time series has attracted a lot of attention in many fields today. Time series forecasting algorithm based on complex network analysis is a research hotspot. How to use time series information to achieve more accurate forecasting is a…
We introduce a general framework for leveraging graph stream data for temporal prediction-based applications. Our proposed framework includes novel methods for learning an appropriate graph time-series representation, modeling and weighting…
In this work we present a simple and fast computational method, the visibility algorithm, that converts a time series into a graph. The constructed graph inherits several properties of the series in its structure. Thereby, periodic series…
This study aims to offer a new perspective on complex network representation of real-world systems. Currently, the most well-known transformation algorithms in the literature treat each data point in a time series as a node and transform…
We consider a setting where multiple entities inter-act with each other over time and the time-varying statuses of the entities are represented as multiple correlated time series. For example, speed sensors are deployed in different…
Nonlinear time series analysis is an active field of research that studies the structure of complex signals in order to derive information of the process that generated those series, for understanding, modeling and forecasting purposes. In…
Time series and signals are attracting more attention across statistics, machine learning and pattern recognition as it appears widely in the industry especially in sensor and IoT related research and applications, but few advances has been…
Visibility algorithms are a family of methods to map time series into networks, with the aim of describing the structure of time series and their underlying dynamical properties in graph-theoretical terms. Here we explore some properties of…
Many applications collect a large number of time series, for example, the financial data of companies quoted in a stock exchange, the health care data of all patients that visit the emergency room of a hospital, or the temperature sequences…
This paper introduces a novel Graph Neural Network (GNN) architecture for time series classification, based on visibility graph representations. Traditional time series classification methods often struggle with high computational…
Increased attention has been paid over the last four years to dynamic network embedding. Existing dynamic embedding methods, however, consider the problem as limited to the evolution of a topology over a sequence of global, discrete states.…
Electromyography (EMG) refers to a biomedical signal indicating neuromuscular activity and muscle morphology. Experts accurately diagnose neuromuscular disorders using this time series. Modern data analysis techniques have recently led to…
Introduced the quantitative measure of the structural complexity of the graph (complex network, etc.) based on a procedure similar to the renormalization process, considering the difference between actual and averaged graph structures on…
A new alternative method to approximate the Visibility Graph (VG) of a time series has been introduced here. It exploits the fact that most of the nodes in the resulting network are not connected to those that are far away from them. This…
We present the modification of natural visibility graph (NVG) algorithm used for the mapping of the time series to the complex networks (graphs). We propose the parametric natural visibility graph (PNVG) algorithm. The PNVG consists of NVG…
Graphs are essential representations of many real-world data such as social networks. Recent years have witnessed the increasing efforts made to extend the neural network models to graph-structured data. These methods, which are usually…
Many real world networks are considered temporal networks, in which the chronological ordering of the edges has importance to the meaning of the data. Performing temporal subgraph matching on such graphs requires the edges in the subgraphs…
In this brief paper, a simple and fast computational method, the Planar Visibility Graph Networks Algorithm was proposed based on the famous Visibility Graph Algorithm, which can fulfill converting two dimensional timeseries into a planar…
We consider the problem of graph generation guided by network statistics, i.e., the generation of graphs which have given values of various numerical measures that characterize networks, such as the clustering coefficient and the number of…
The visibility algorithm has been recently introduced as a mapping between time series and complex networks. This procedure allows to apply methods of complex network theory for characterizing time series. In this work we present the…