کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1864251 | 1037715 | 2009 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Confidence bounds of recurrence-based complexity measures
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
فیزیک و نجوم
فیزیک و نجوم (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Confidence bounds of recurrence-based complexity measures Confidence bounds of recurrence-based complexity measures](/preview/png/1864251.png)
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Physics Letters A - Volume 373, Issue 26, 15 June 2009, Pages 2245–2250
Journal: Physics Letters A - Volume 373, Issue 26, 15 June 2009, Pages 2245–2250
نویسندگان
Stefan Schinkel, N. Marwan, O. Dimigen, J. Kurths,