scispace - formally typeset
Journal ArticleDOI

Recurrence network modeling and analysis of spatial data.

Cheng Bang Chen, +2 more
- 01 Aug 2018 - 
- Vol. 28, Iss: 8, pp 085714-085714
TLDR
Experimental results show that the generalized recurrence network approach yields superior performance in the visualization of recurrence patterns in spatial data and in the extraction of salient features to characterize recurrence dynamics in spatial systems.
Abstract
Nonlinear dynamical systems exhibit complex recurrence behaviors. Recurrence plot is widely used to graphically represent the patterns of recurrence dynamics and further facilitates the quantification of recurrence patterns, namely, recurrence quantification analysis. However, traditional recurrence methods tend to be limited in their ability to handle spatial data due to high dimensionality and geometric characteristics. Prior efforts have been made to generalize the recurrence plot to a four-dimensional space for spatial data analysis, but this framework can only provide graphical visualization of recurrence patterns in the projected reduced-dimension space (i.e., two- or three- dimensions). In this paper, we propose a new weighted recurrence network approach for spatial data analysis. A weighted network model is introduced to represent the recurrence patterns in spatial data, which account for both pixel intensities and spatial distance simultaneously. Note that each network node represents a location in the high-dimensional spatial data. Network edges and weights preserve complex spatial structures and recurrence patterns. Network representation is shown to be an effective means to provide a complete picture of recurrence patterns in the spatial data. Furthermore, we leverage network statistics to characterize and quantify recurrence properties and features in the spatial data. Experimental results in both simulation and real-world case studies show that the generalized recurrence network approach yields superior performance in the visualization of recurrence patterns in spatial data and in the extraction of salient features to characterize recurrence dynamics in spatial systems.

read more

Citations
More filters
Journal ArticleDOI

Development of the method for rapid detection of hazardous atmospheric pollution of cities with the help of recurrence measures

TL;DR: In this article, a method for rapid detection of hazardous pollution of the atmosphere of cities, which is based on dynamic measures of recurrence (repeatability) of the states of the pollution concentration vector, was developed.
Journal ArticleDOI

Heterogeneous Recurrence Analysis of Disease-Altered Spatiotemporal Patterns in Multi-Channel Cardiac Signals

TL;DR: The proposed method of heterogeneous recurrence analysis shows strong potential to be further extended for the analysis of other physiological signals such as electroencephalogram (EEG) and electromyography (EMG) signals towards medical decision making.
Journal ArticleDOI

Recurrence network analysis of design-quality interactions in additive manufacturing

TL;DR: In this article, a generalized recurrence network (GRN) was developed to represent the AM spatial image data and quantifiers, namely degree, betweenness, pagerank, closeness, and eigenvector centralities, were extracted to characterize the quality of layerwise builds.
Journal ArticleDOI

Trends in recurrence analysis of dynamical systems

TL;DR: The last decade has witnessed a number of important and exciting developments that had been achieved for improving recurrence plot-based data analysis and to widen its application potential as discussed by the authors , such as computational improvements, alternative recurrence definitions (event-like, multiscale, heterogeneous, and spatio-temporal recurrences) and ideas for parameter selection.
References
More filters
Journal ArticleDOI

Statistical mechanics of complex networks

TL;DR: In this paper, a simple model based on the power-law degree distribution of real networks was proposed, which was able to reproduce the power law degree distribution in real networks and to capture the evolution of networks, not just their static topology.
Book

Networks: An Introduction

Mark Newman
TL;DR: This book brings together for the first time the most important breakthroughs in each of these fields and presents them in a coherent fashion, highlighting the strong interconnections between work in different areas.
Journal ArticleDOI

A faster algorithm for betweenness centrality

TL;DR: New algorithms for betweenness are introduced in this paper and require O(n + m) space and run in O(nm) and O( nm + n2 log n) time on unweighted and weighted networks, respectively, where m is the number of links.
Journal ArticleDOI

Recurrence plots for the analysis of complex systems

TL;DR: The aim of this work is to provide the readers with the know how for the application of recurrence plot based methods in their own field of research, and detail the analysis of data and indicate possible difficulties and pitfalls.
Journal ArticleDOI

A measure of betweenness centrality based on random walks

TL;DR: In this paper, the authors propose a measure of betweenness based on random walks, counting how often a node is traversed by a random walk between two other nodes, not just the shortest paths.
Related Papers (5)