Thread-based implementations of the false nearest neighbors method

Parallel Computing

Volumn 35, Issue 10-11, 2009, Pages 523-534

  Carrión, I Marín ^a   Antúnez, E Arias ^a   Castillo, M M Artigao ^a   Guerrero, J J Águila ^b   Canals, J J Miralles ^a  

^a UNIVERSITY OF CASTILLA LA MANCHA   (Spain)

^b UNIVERSIDAD DE MAGALLANES   (Chile)

Author keywords

Method of false nearest neighbors; Nonlinear time series analysis; Parallel computing; Physics; POSIX threads

Indexed keywords

EXECUTION TIME; FALSE NEAREST NEIGHBOR; METHOD OF FALSE NEAREST NEIGHBORS; NONLINEAR TIME SERIES ANALYSIS; PARALLEL COMPUTING; PARALLEL IMPLEMENTATIONS; POSIX THREADS; SCIENCE AND ENGINEERING; SEQUENTIAL IMPLEMENTATION; SHARED MEMORY ARCHITECTURE; TIME-SCALES;

BIOLOGICAL SYSTEMS; COMPUTER SCIENCE; OCEANOGRAPHY; PARALLEL ARCHITECTURES; TIME SERIES;

TIME SERIES ANALYSIS;

EID: 70449091789     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2009.09.003     Document Type: Article

References (25)

1. Takens F. Detecting strange attractors in turbulence. In: Dold A., and Eckmann B. (Eds). Lecture Notes in Mathematics vol. 898 (1981), Springer, New York 366-381
2. Packard N.H., Crutchfield J.P., Farmer J.D., and Shaw R.S. Geometry from a time series. Phys. Rev. Lett. 45 (1980) 712-716
3. Hegger R., Kantz H., and Schreiber T. Practical implementation of nonlinear time series methods: The TISEAN package. Chaos 9 (1999) 413-435
4. Kennel M.B., Brown R., and Abarbanel H.D.I. Determining embedding dimension for phase-space reconstruction using a geometrical construction. Phys. Rev. A 45 (1992) 3403-3411
5. Available from: (accessed 26.05.93).
6. Kennel M.B. KDTREE Fortran 95 and C++ software to efficiently search for near neighbors in a multi-dimensional Euclidean space (2004) physics/0408067
7. Sedgewick R. Algorithms in C (1990), Addison-Wesley, Reading, MA
8. Preparata F.P., and Shamos M.I. Computational Geometry. An Introduction (1985), Springer, New York
9. Gonnet G.H., and Baeza-Yates R. Handbook of Algorithms and Data Structures in Pascal and C (1991), Addison-Wesley, Wokingham
10. Mehlhorn K. Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry (1984), Springer, Berlin
11. Arya S., Mount D.M., Netanyahu N.S., Silverman R., and Wu A.Y. An optimal algorithm for approximate nearest neighbor searching. J. ACM 45 (1998) 891-923
12. Omohundro S.M. Efficient algorithms with neural network behavior. Complex Syst. 1 (1987) 273-347
13. Bentley J.L. Multidimensional divide-and-conquer. Commun. ACM 23 (1980) 214-229
14. J.L. Bentley, K-d trees for semidynamic point sets, in: Proc. of the Sixth Annual ACM Symposium on Computational Geometry, San Francisco, 1990, pp. 187-197.
15. Al-furaih I., Aluru S., Goil S., and Ranka S. Parallel construction of multidimensional binary search trees. IEEE Trans. Parallel Distrib. Syst. 11 (2000) 136-148
16. A. Moore, A introductory tutorial on kd-trees, Tech. Report No. 209 (extract from Ph.D. Thesis), Computer Laboratory, University of Cambridge, 1991.
17. Noga M.T., and Allison D.C.S. Sorting in linear expected time. Bit 25 (1985) 451-465
18. Devroye L. Lecture Notes on Bucket Algorithms. Progress in Computer Science vol. 6 (1986), Birkhäuser, Boston
19. Asano T., Edahiro M., Imai H., Iri M., and Murota K. Practical use of bucketing techniques in computational geometry. In: Toussaint G.T. (Ed). Computational Geometry (1985), Elsevier, Amsterdam 153-195
20. Schreiber T. Efficient neighbor searching in nonlinear time series analysis. Int. J. Bifurc. Chaos 5 (1995) 349-358
21. Kantz H., and Schreiber T. Nonlinear Time Series Analysis (1997), Cambridge University Press, Cambridge, MA
22. Grassberger P. An optimized box-assisted algorithm for fractal dimensions. Phys. Lett. A 148 (1990) 63-68
23. Grassberger P., Schreiber T., and Schaffrath C. Nonlinear time sequence analysis. Int. J. Bifurc. Chaos 1 (1991) 521-547
24. F. Mueller, Pthreads library interface, Institut für Informatik Tech. Report, Humboldt-Universität zu Berlin, 1999.
25. Grama A., Gupta A., Karypis G., and Kumar V. Introduction to Parallel Computing (2003), Pearson Education, Harlow