mlsanityData to 7 Oct 2026

CLPVG: Circular limited penetrable visibility graph as a new network model for time series

arXiv 2104.13772 ↗First posted 1 Mar 2021cs.LG eess.SPcited by 2

Not on the map. Why?

Abstract (arXiv)

Visibility Graph (VG) transforms time series into graphs, facilitating signal processing by advanced graph data mining algorithms. In this paper, based on the classic Limited Penetrable Visibility Graph (LPVG) method, we propose a novel nonlinear mapping method named Circular Limited Penetrable Visibility Graph (CLPVG). The testing on degree distribution and clustering coefficient on the generated graphs of typical time series validates that our CLPVG is able to effectively capture the important features of time series and has better anti-noise ability than traditional LPVG. The experiments on real-world time-series datasets of radio signal and electroencephalogram (EEG) also suggest that the structural features provided by CLPVG, rather than LPVG, are more useful for time-series classification, leading to higher accuracy. And this classification performance can be further enhanced through structural feature expansion by adopting Subgraph Networks (SGN). All of these results validate the effectiveness of our CLPVG model.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 6 of its 36 references that are in the map. First posted on arXiv 1 Mar 2021.

Builds on

6 of 36 references.

References · 6

  1. 2014Distributed Representations of Sentences and Documentscited by 677
  2. 2017graph2vec: Learning Distributed Representations of Graphscited by 228
  3. 2017LSTM Fully Convolutional Networks for Time Series Classificationcited by 135
  4. 2016Convolutional Radio Modulation Recognition Networkscited by 106
  5. 2015Imaging Time-Series to Improve Classification and Imputationcited by 85
  6. 2019Subgraph Networks with Application to Structural Feature Space Expansioncited by 16

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 0; 2025: 1.

2 papers.