摘要
为研究基于统计复杂度在测度二维数组时,面临计算复杂和符号化时的序列脱节等问题,提出了以重构距离数组为基础的改进算法.首先,在理论上说明改进算法能够一定程度解决原统计复杂度算法的两方面问题.然后,以不同状态Lorenz方程为对象检验改进算法.结果表明,改进算法的CFC能够准确、有效地刻画不同状态Lorenz方程生成的二维数组的复杂度.
Aimed at the too much complex calculation and the sequence dislocation for statistical complexity in measuring the complexity of a two-dimensional array,an improved algorithm was developed based on the reconfiguration of distance array.Firstly,it was theoretically illustrated that this improved algorithm was able to resolve the two problems of the original statistical complexity algorithm to a certain extent.Then Lorenz equations with different parameters were used to test the improved algorithm.Results show that CVc of the improved algorithm is capable of accurately and effectively depicting the complexities of two-dimensional arrays coming from the Lorenz equations with different parameters.
出处
《哈尔滨工业大学学报》
EI
CAS
CSCD
北大核心
2009年第10期150-153,共4页
Journal of Harbin Institute of Technology
基金
国家自然科学基金资助项目(50478088)
关键词
复杂性测度
统计复杂度
二维数组
complexity measure
statistical complexity
two-dimensional arrays
