EFFICIENT NEIGHBOR SEARCHING IN NONLINEAR TIME-SERIES ANALYSIS

被引:46
作者
SCHREIBER, T
机构
来源
INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS | 1995年 / 5卷 / 02期
关键词
D O I
10.1142/S0218127495000296
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We want to encourage the use of fast algorithms to find nearest neighbors in k-dimensional space. We review methods which are particularly useful for the study of time-series data from chaotic systems. As an example, a simple box-assisted method and possible refinements are described in some detail. The efficiency of the method is compared to the naive approach and to a multidimensional tree for some exemplary data sets.
引用
收藏
页码:349 / 358
页数:10
相关论文
共 24 条
[1]  
ASANO T, 1985, COMPUTATIONAL GENOME
[2]   MULTIDIMENSIONAL DIVIDE-AND-CONQUER [J].
BENTLEY, JL .
COMMUNICATIONS OF THE ACM, 1980, 23 (04) :214-229
[3]  
BENTLEY JL, 1990, 1ST P ANN ACM SIAM S, P91
[4]   MULTIDIMENSIONAL TREES, RANGE SEARCHING, AND A CORRELATION DIMENSION ALGORITHM OF REDUCED COMPLEXITY [J].
BINGHAM, S ;
KOT, M .
PHYSICS LETTERS A, 1989, 140 (06) :327-330
[5]  
FARMER JD, 1988, EVOLUTION LEARNING C
[6]  
FINCHAM D, 1985, ADV CHEM PHYSICS, V63
[7]  
FORM W, 1992, VECTORIZED PARALLELI
[8]  
GONNET GH, 1991, HDB ALGORITHMS DATA
[9]   AN OPTIMIZED BOX-ASSISTED ALGORITHM FOR FRACTAL DIMENSIONS [J].
GRASSBERGER, P .
PHYSICS LETTERS A, 1990, 148 (1-2) :63-68
[10]   NONLINEAR TIME SEQUENCE ANALYSIS [J].
Grassberger, Peter ;
Schreiber, Thomas ;
Schaffrath, Carsten .
INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS, 1991, 1 (03) :521-547