-
Notifications
You must be signed in to change notification settings - Fork 11
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Calculation of RQA parameters for "white vertical structures" #24
Comments
@pucicu: what parameters should be included?
On the other hand, what estimate to recurrence times do you recommend? Both are easy to calculate and can be provided if necessary, but I wonder whether that would be complicating the interface too much... EDIT: or we can calculate the average of (a) and (b), as a tradeoff. |
The best would be to use the middle point of the vertical recurrence lines in the RP (see Fig. 1.4 in the book chapter N. Marwan, C. L. Webber, Jr.: Mathematical and Computational Foundations of Recurrence Quantifications, Recurrence Quantification Analysis – Theory and Best Practices, Eds.: C. L. Webber, Jr. and N. Marwan, Springer, Cham, 3–43 (2015). DOI:10.1007/978-3-319-07155-8_1 <http://dx.doi.org/10.1007/978-3-319-07155-8_1>). This corresponds more or less to an average of (a) and (b) – but it is not really the average, therefore, just averaging of both would not work.
Regarding the other question: I suggest to include Mean recurrence time, Recurrence time entropy, but also the most probable recurrence time.
Thanks for your great work! It is really exciting to see this rapid progress!
… Am 03.01.2019 um 03:03 schrieb Helios De Rosario ***@***.***>:
@pucicu <https://github.com/pucicu>: what parameters should be included?
Mean recurrence time
Recurrence time entropy
Maximum recurrence time
... other?
On the other hand, what estimate to recurrence times do you recommend?
(a) distance between starting points of vertical recurrent structures
(b) length of vertical "white lines"
Both are easy to calculate and can be provided if necessary, but I wonder whether that would be complicating the interface too much...
—
You are receiving this because you were mentioned.
Reply to this email directly, view it on GitHub <#24 (comment)>, or mute the thread <https://github.com/notifications/unsubscribe-auth/AA7WkN7Z_fX8x5JMJJPCd9zhWh_CiqAtks5u_WUBgaJpZM4Zld93>.
|
About the most probable recurrence time: what is the criterion when there are ties? (i.e. an histogram of recurrence times with two or more bins equal to the maximum) |
hm, good question. I haven’t thought about this. perhaps just average the both values? would make sense, in my opinion.
… Am 05.01.2019 um 19:25 schrieb Helios De Rosario ***@***.***>:
About the most probable recurrence time: what is the criterion when there are ties? (i.e. an histogram of recurrence times with two or more bins equal to the maximum)
—
You are receiving this because you were mentioned.
Reply to this email directly, view it on GitHub <#24 (comment)>, or mute the thread <https://github.com/notifications/unsubscribe-auth/AA7WkIRzkfM3fJQT_86PmfGR0zMs2Zmtks5vAO4VgaJpZM4Zld93>.
|
Well, I have read Ngamga's paper (DOI: 10.1103/PhysRevE.75.036222), and realized that there is no such ambiguity: it is not the "most probable recurrence time", but the "number of the most probable recurrence time", i.e. the size of the maximum bin in the histogram, not its position. So ties are not an issue anymore. |
I'm about finishing this. My main remaining doubt is about the names of the functions to calculate those parameters. Following Julia's style guide I propose this:
The "N" in the last key comes is present in the acronym given in Ngnamga's paper, standing for "number of the most probable recurrence time" (NMPRT), which is a more accurate description. (To be consistent the function name should be something like Yet another doubt is if, to keep consistency between names, we should use |
I'd propose to name the function For the entropy, I suggest Honestly, the functions offered by |
hi,
i agree with george. well done!
best
norbert
… Am 07.01.2019 um 13:22 schrieb George Datseris ***@***.***>:
I'd propose to name the function nmprt instead of the current long names. Maybe not very readable, true, but the other names suffer from extreme verbosity. Coupling two words together (or using a 3rd small like is or mean) is the limit I've found from experience. For more than that, it becomes too verbose and lengthy to be beneficial. This also means that I think meanrecurrencetime is okay.
For the entropy, I suggest rt_entropy. And taking the opportunity, maybe it is worth also changing rqaentropy not to rqa_entropy but instead to dl_entropy from "diagonal lengths entropy".
Honestly, the functions offered by RecurrenceAnalysis are so many that I think one should always have a tab of the documentation page open just to be on the safe side :D so I wouldn't be too concerned with this in the end of the day!
—
You are receiving this because you were mentioned.
Reply to this email directly, view it on GitHub <#24 (comment)>, or mute the thread <https://github.com/notifications/unsubscribe-auth/AA7WkLPsGAFPJnk46Gsv7gyPXlx488Umks5vAzwUgaJpZM4Zld93>.
|
Create the dedicated functions, and extend
rqa
to support the new related keys.The text was updated successfully, but these errors were encountered: