.png){kind=icon}
Return
Energy-efficient recurrence quantification analysis
.png){kind=icon}
OA
AI
DOI：10.1140/epjs/s11734-025-02121-w.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recurrence quantification analysis (RQA) is a widely used tool for studying complex dynamical systems, but its standard implementation requires computationally expensive calculations of recurrence plots (RPs) and line length histograms. This study introduces strategies to compute RQA measures directly from time series or phase space vectors, avoiding the need to construct RPs. The calculations can be further accelerated and optimised by applying a random sampling procedure, in which only a subset of line structures is evaluated. These modifications result in shorter run times, less memory use and access, and lower overall energy consumption during analysis whilst maintaining accuracy. This makes them especially appealing for large-scale data analysis and machine learning applications. The ideas are not limited to diagonal line measures, but can likewise be applied to vertical line-based measures and to recurrence network measures. By lowering computational costs, the proposed strategies contribute to energy saving and sustainable data analysis, and broaden the applicability of recurrence-based methods in modern research contexts.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
T
IF:
0
Papers:
446
Citations:
0
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSaveRecurrence-plot-based measures of complexity and their application to heart-rate-variability dataOAAI
OAAIShareSaveShareSave
View more