Planar visibility graph network algorithm for two dimensional timeseries

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 graph. The constructed planar graph inherits several properti...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Chinese Control and Decision Conference s. 1352 - 1357
Hlavní autoři: Jie Liu, Qingqing Li
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.05.2017
Témata:
Algorithm design and analysis
Chaotic series
Classification algorithms
Clustering algorithms
Complex networks
Heuristic algorithms
Periodic series
Planar Visibility Graph Networks Algorithm
Random series
Time series analysis
Transmission line matrix methods
Visibility Graph Algorithm
ISSN:1948-9447
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 graph. The constructed planar graph inherits several properties of the series in its structure. Thereby, periodic series, random series, and chaotic series convert into quite different networks with different average degree, characteristic path length, diameter, clustering coefficient, different degree distribution, and modularity, etc. By means of this new approach, with such different networks measures, one can characterize two dimensional timeseries from a new viewpoint of complex networks.
ISSN:1948-9447
DOI:10.1109/CCDC.2017.7978727