A SIMPLE CLUSTERING TECHNIQUE TO EXTRACT MOST REPRESENTATIVE DATA FROM NOISY CHAOTIC TIME SERIES

2004 ◽  
pp. 1613-1620
Author(s):  
D. S. K. KARUNASINGHA ◽  
S. Y. LIONG
2000 ◽  
Vol 10 (07) ◽  
pp. 1773-1779 ◽  
Author(s):  
N. RADHAKRISHNAN ◽  
JAMES D. WILSON ◽  
PHILIPOS C. LOIZOU

In this paper we use the concepts of information theory to analyze the time series obtained from complex systems. The procedure discussed here can be applied to quantify the regularity of chaotic time series, although it might not certify chaos. The main idea is to map the time series into a finite sequence of symbols using an efficient partitioning technique, and quantify the regularity of the resulting sequence by a chosen complexity measure. A proper partitioning technique is essential for any meaningful analysis of the resulting sequence. We have used a clustering technique to partition the time series into a finite sequence and the Lempel–Ziv complexity measure to quantify the regularity of this sequence.


2012 ◽  
Vol 197 ◽  
pp. 271-277
Author(s):  
Zhu Ping Gong

Small data set approach is used for the estimation of Largest Lyapunov Exponent (LLE). Primarily, the mean period drawback of Small data set was corrected. On this base, the LLEs of daily qualified rate time series of HZ, an electronic manufacturing enterprise, were estimated and all positive LLEs were taken which indicate that this time series is a chaotic time series and the corresponding produce process is a chaotic process. The variance of the LLEs revealed the struggle between the divergence nature of quality system and quality control effort. LLEs showed sharp increase in getting worse quality level coincide with the company shutdown. HZ’s daily qualified rate, a chaotic time series, shows us the predictable nature of quality system in a short-run.


Sign in / Sign up

Export Citation Format

Share Document