WINNING ENTRY OF THE K. U. LEUVEN TIME-SERIES PREDICTION COMPETITION

DOI10.1142/S0218127499001048zbMATH Open1192.37110OpenAlexW2045182040MaRDI QIDQ3579292

Joos Vandewalle, James McNames, Johan A. K. Suykens

Publication date: 6 August 2010

Published in: International Journal of Bifurcation and Chaos in Applied Sciences and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218127499001048

Mathematics Subject Classification ID

Time series analysis of dynamical systems (37M10)

Cites Work

• Embedology
• Equivalence between different local prediction methods of chaotic time series
• A Data Structure and an Algorithm for the Nearest Point Problem
• A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition
• n-Double Scroll Hypercubes in 1-D CNNs
• A Branch and Bound Algorithm for Computing k-Nearest Neighbors
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• STEPS TOWARD UNMASKING SECURE COMMUNICATIONS
• UNMASKING A MODULATED CHAOTIC COMMUNICATIONS SCHEME
• Recovery of digital signals from chaotic switching
• Nonlinear H_∞ Synchronization of Chaotic Lur'e Systems
• Chaotic time series. Part II. System Identification and Prediction
• Local optimal prediction: exploiting strangeness and the variation of sensitivity to initial condition

Related Items (1)

Predicting spatio-temporal time series using dimension reduced local states

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Time Series Prediction with Periodic Kernels 👍 👎
• Improved time series prediction with a new method for selection of model parameters 👍 👎
• Predicting Time Series from Short-Term High-Dimensional Data 👍 👎

This page was built for publication: WINNING ENTRY OF THE K. U. LEUVEN TIME-SERIES PREDICTION COMPETITION