So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Phân tích Định lượng Hồi quy (RQA)× | Entropy Chuyển Giao× | |
|---|---|---|
| Lĩnh vực≠ | Hệ thống phức hợp | Suy luận nhân quả |
| Họ | Machine learning | Machine learning |
| Năm ra đời≠ | 2007 | 2000 |
| Người khởi xướng≠ | Marwan, Romano, Thiel & Kurths | Thomas Schreiber |
| Loại≠ | Nonlinear time-series characterization | Non-parametric information-theoretic measure |
| Công trình gốc≠ | Marwan, N., Romano, M. C., Thiel, M., & Kurths, J. (2007). Recurrence plots for the analysis of complex systems. Physics Reports, 438(5–6), 237–329. DOI ↗ | Schreiber, T. (2000). Measuring information transfer. Physical Review Letters, 85(2), 461–464. DOI ↗ |
| Tên gọi khác | RQA, Recurrence Plot Analysis, Nonlinear Recurrence Analysis, Tekrarlama Kantifikasyon Analizi | Schreiber Information Transfer, Directed Information Flow, Conditional Mutual Information (directed), Transfer Entropisi |
| Liên quan≠ | 2 | 3 |
| Tóm tắt≠ | Recurrence Quantification Analysis (RQA) is a nonlinear method for characterizing the dynamics of a time series by quantifying the small-scale structure of its recurrence plot. Introduced in its modern, comprehensive form by Marwan, Romano, Thiel, and Kurths in 2007, RQA extracts scalar measures — such as recurrence rate, determinism, laminarity, and Shannon entropy — that capture periodicity, chaos, stationarity, and transitions in complex dynamical systems. | Transfer Entropy (TE) is a non-parametric, information-theoretic measure of directed statistical dependence between two time series, introduced by Thomas Schreiber in 2000. Grounded in Shannon entropy, it quantifies how much information the past of one process Y reduces uncertainty about the next state of another process X, beyond what X's own past already provides. Unlike linear correlation or Granger causality, TE captures nonlinear interactions and requires no model assumptions about the underlying dynamics. |
| ScholarGateBộ dữ liệu ↗ |
|
|