Open AccessOptimization of scaled probabilistic cleaning methods
Author(s) -
Keyu Jiang,
Cai Zhiming
Publication year - 2005
Publication title -
wuli xuebao
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.199
H-Index - 47
ISSN - 1000-3290
DOI - 10.7498/aps.54.4596
Subject(s) - computer science , probabilistic logic , series (stratigraphy) , reduction (mathematics) , chaotic , embedding , noise (video) , dimension (graph theory) , algorithm , nonlinear system , noise reduction , dimensionality reduction , data point , mathematical optimization , mathematics , artificial intelligence , paleontology , physics , geometry , quantum mechanics , pure mathematics , image (mathematics) , biology
The scaled probabilistic cleaning method is one of nonlinear noise reduction methods for chaotic time series, whose calculation quantity and needed memory volume increase exponentially with the number of reference points and the embedding dimension because of the joint processing of all data points in phase space. An optimized method, which modifies the estimation of forward probabilities and transition probabilities is proposed, and the computing workload is reduced to about 0.27 times that of the original method without degradation in noise reduction performance. The implementation of the method for the long time series also reduces the needed memory size.