Refine
Has Fulltext
- no (1)
Year of publication
- 2009 (1)
Document Type
- Article (1)
Language
- English (1)
Is part of the Bibliography
- yes (1)
Institute
In the recent past, recurrence quantification analysis (RQA) has gained an increasing interest in various research areas. The complexity measures the RQA provides have been useful in describing and analysing a broad range of data. It is known to be rather robust to noise and nonstationarities. Yet, one key question in empirical research concerns the confidence bounds of measured data. In the present Letter we suggest a method for estimating the confidence bounds of recurrence-based complexity measures. We study the applicability of the suggested method with model and real- life data.