.png){kind=icon}
.png){kind=icon}
Return
Online visibility graphs: Encoding visibility in a binary search tree
.png){kind=icon}
OA
AI
DOI：10.1103/PhysRevResearch.2.023069.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A visibility algorithm maps time series into complex networks following a simple criterion, and the resulting visibility graphs have recently proven to be a powerful tool for time series analysis. However, their direct computation is time-consuming and rigid, motivating the development of more efficient algorithms. Here we introduce a description of a method to compute visibility graphs online, which is highly efficient, compatible with batchwise progressive updates, and capable of assimilating new data without having to recompute the graph from scratch. We use a binary search tree to encode and store visibility relations, which can be decoded at a later stage into a visibility graph. The proposed encoder/decoder approach offers an online computation solution at no additional computational cost and makes it possible to use visibility graphs for large-scale time series analysis and for applications where online data assimilation is required.
Keywords:
TIME-SERIES
NETWORKS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.2
Papers:
7.6K
Citations:
2.7W