Winning entry of the K. U. Leuven time-series prediction competition

International Journal of Bifurcation and Chaos in Applied Sciences and Engineering

Volumn 9, Issue 8, 1999, Pages 1485-1500

  McNames, J ^a   Suykens, J A K ^b   Vandewalle, J ^b  

^a Stanford University   (United States)

^b Katholieke Universiteit Leuven   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033177289     PISSN: 02181274     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218127499001048     Document Type: Article

References (44)

1. Arena, P., Baglio, S., Fortuna, L. & Manganaro, G. [1996a] "Generation of n-double scrolls via cellular neural networks," Int. J. Circuit Th. Appl. 24, 241-252.
2. Arena, P., Baglio, S., Fortuna, L. & Manganaro, G. [1996b] "State controlled CNN: A new strategy for generating high complex dynamics," IEICE Trans. Fundamentals E79-A, 1647-1657.
3. Atkeson, C. G., Moore, A. W. & Schaal, S. [1997] "Locally weighted learning," Artif. Intell. Rev. 11(1-5), 11-73.
4. Bakamidis, S. G. [1993] "An exact fast nearest neighbor identification technique," in 1993 IEEE Int. Conf. Acoustics, Speech, and Signal Processing, Vol. 5, pp. 658-661.
5. Casdagli, M. C., Des Jardins, D., Eubank, S., Farmer, J. D., Gibson, J. & Theiler, J. [1992] "Nonlinear modeling of chaotic time-series: Theory and applications," in Applied Chaos, eds. Kim, J. H. & Stringer, J. (John Wiley & Sons), pp. 335-380.
6. Casdagli, M. C. & Weigend, A. S. [1994] "Exploring the continuum between deterministic and stochastic modeling," in Time-Series Prediction, eds. Weigend, A. S. & Gershenfeld, N. A., Santa Fe Institute Studies in the Sciences of Complexity (Addison-Wesley), pp. 347-366.
7. Chua, L. [1994] "Chua's circuit: An overview ten years later," J. Circuits Syst. Comput. 4(2), 117-159.
8. Chua, L., Komuro, M. & Matsumoto, T. [1986] "The double scroll family," IEEE Trans. Circuits Syst. I 33(11), 1072-1118.
9. Farmer, J. D. & Sidorowich, J. J. [1987] "Predicting chaotic time-series," Phys. Rev. Lett. 59(8), 845-848.
10. Farmer, J. D. & Sidorowich, J. J. [1988] "Exploiting chaos to predict the future and reduce noise," in Evolution, Learning and Cognition, ed. Lee, Y. C. (World Scientific), pp. 277-330.
11. Friedman, J. H. [1991] "An overview of predictive learning and function approximation," in From Statistics to Neural Networks, eds. Cherkassky, V., Friedman, J. H. & Wechsler, H., Computer and Systems Sciences (Springer-Verlag), Vol. 13, pp. 1-61.
12. Friedman, J. H., Bentley, J. L. & Finkel, R. A. [1977] "An algorithm for finding best matches in logarithmic expected time," ACM Trans. Math. Software 3(3), 209-226.
13. Fukunaga, K. & Narendra, P. M. [1975] "A branch and bound algorithm for computing k-nearest neighbors," IEEE Trans. Comput. C-24, 750-753.
14. García, P., Jiménez, J., Marcano, A. & Moleiro, F. [1996] "Local optimal metrics and nonlinear modeling of chaotic time-series," Phys. Rev. Lett. 76(9), 1449-1452.
15. Gershenfeld, N. A. & Weigend, A. S. [1994] "The future of time-series: Learning and understanding," in Time-Series Prediction, eds. Weigend, A. S. & Gershenfeld, N. A., Santa Fe Institue Studies in the Sciences of Complexity (Addison-Wesley), pp. 1-70.
16. Kalantari, I. & McDonald, G. [1983] "A data structure and an algorithm for the nearest point problem," IEEE Trans. Software Engin. SE-9(5), 631-634.
17. Kamgar-Parsi, B. & Kanal, L. N. [1985] "An improved branch and bound algorithm for computing k-nearest neighbors," Patt. Recogn. Lett. 3, 7-12.
18. Kants, H. & Jaeger, L. [1997] "Improved cost functions for modeling of noisy chaotic time-series," Physica D109, 59-69.
19. Kim, B. S. & Park, S. B. [1986] "A fast k-nearest neighbor finding algorithm based on the ordered partition," IEEE Trans. Patt. Anal. Mach. Intell. 8(6), 761-766.
20. Kugiumtzis, D., Lingjærde, N. & Christophersen, N. [1998] "Regularized local linear prediction of chaotic time-series," Physica D112, 344-360.
21. Lillekjendlie, D. K. & Christophersen, N. [1994] "Chaotic time-series. Part II. System identification and prediction," Modeling, Identification and Control 15(4), 225-243.
22. Liu, Z., Ren, X. & Zhu, Z. [1997] "Equivalence between different local prediction methods of chaotic time-series," Phys. Lett. A227, 37-40.
23. Madan, R. [1993] Chua's Circuit: A Paradigm for Chaos (World Scientific, Singapore).
24. McNames, J. [1998] "A nearest trajectory strategy for time-series prediction," in Proc. Int. Workshop on Advanced Black-Box Techniques for Nonlinear Modeling, Katholieke Universiteit Leuven, Belgium, pp. 112-128.
25. Micó, L., Oncina, J. & Carrasco, R. C. [1996] "A fast branch & bound nearest neighbor classifier in metric spaces," Patt. Recogn. Lett. 17, 731-739.
26. Murray, D. B. [1993] "Forecasting a chaotic time-series using an improved metric for embedding space," Physica D68, 318-325.
27. Nene, S. A. & Nayar, S. K. [1997] "A simple algorithm for nearest neighbor search in high dimensions," IEEE Trans. Patt. Anal. Mach. Intell. 19(9), 989-1003.
28. Niemann, H. & Goppert, R. [1988] "An efficient branch-and-bound nearest neighbor classifier," Patt. Recogn. Lett. 7, 67-72.
29. Sauer, T. [1994] "Time-series prediction by using delay coordinate embedding," in Time-Series Prediction eds. Weigend, A. S. & Gershenfeld, N. A., Santa Fe Institue Studies in the Sciences of Complexity (Addison-Wesley), pp. 175-193.
30. Sauer, T., Yorke, J. A. & Casdagli, M. [1991] "Embedology," J. Stat. Phys. 65(3), 579-616.
31. Short, K. M. [1994] "Steps toward unmasking secure communications," Int. J. Bifurcation and Chaos 4(4), 957-977.
32. Short, K. M. [1996] "Unmasking a modulated chaotic communications scheme," Int. J. Bifurcation and Chaos 6(2), 367-375.
33. Smith, L. A. [1994] "Local optimal prediction: Exploiting strangeness and the variation of sensitivity to initial condition," Philos. Trans. R. Soc. A348, 371-381.
34. Suykens, J. A. K. & Chua, L. O. [1997] "n-double scroll hypercubes in 1D-CNNS," Int. J. Bifurcation and Chaos 7(8), 1873-1885.
35. Suykens, J. A. K., Curran, P., Vandewalle, J. & Chua, L. O. [1997] "Robust nonlinear h∞ synchronization of chaotic lur'e systems," IEEE Trans. Circuits Syst. I, Special Issue on Chaos Synchronization, Control and Applications 44(10), 891-904.
36. Suykens, J. A. K., Huang, A. & Chua, L. O. [1997] "A family of n-scroll attractors from a generalized Chua's circuit," Archiv fur Elektronik und Ubertragungstechnik, Int. J. Electron. Commun. 51(3), 131-138.
37. Suykens, J. A. K. & Vandewalle, J. (eds.) [1998a] Proc. Int. Workshop on Advanced Black-Box Techniques for Nonlinear Modelings, Katholieke Universiteit Leuven, Belgium.
38. Suykens, J. A. K., Vandewalle, J. & Chua, L. O. [1997] "Nonlinear h∞ synchronization of chaotic lur'e systems," Int. J. Bifurcation and Chaos 7(6), 1323-1335.
39. Suykens, J. A. K. & Vandewalle, J. [1998b] Nonlinear Modeling Advanced Black-Box Techniques (Kluwer Academic Publishers).
40. Tai, S. C., Lai, C. C. & Lin, Y. C. [1996] "Two fast nearest neighbor searching algorithms for image vector quantization," IEEE Trans. Commun. 44(12), 1623-1628.
41. Takens, F. [1981] "Detecting strange attractors in turbulence," in Dynamical Systems and Turbulence, eds. Rand, D. A. & Young, L. S., Lecture Notes in Mathematics 898 (Springer-Verlag), pp. 336-381.
42. Tanaka, N., Okamoto, H. & Naito, M. [1995] "An optimal metric for predicting chaotic time-series," Jpn. J. Appl. Phys. 34(1), 388-394.
43. Vidal, E. [1986] "An algorithm for finding nearest neighbors in (approximately) constant average time," Patt. Recogn. Lett. 4, 145-157.
44. Yang, T. [1995] "Recovery of digital signal from chaotic switching," Int J. Circuit Th. Appl. 33(6), 611-615.