Dong G, Wu Q
Beijing University of Science and Technology.
Zhongguo Yi Liao Qi Xie Za Zhi. 1999 Nov;23(6):311-5, 336.
The Paper introduces two algorithms as a complexity measure. One is the algorithm defined by Kaspar and Schuster, the other is a recently developed statistic quantifying regularity and complexity--Approximate entropy (ApEn). They have been applied for the study of sleep EEG. According to the laboratory application and comparison, the result shows that ApEn is a valued complexity measure.
本文介绍了两种作为复杂性度量的算法。一种是由卡斯帕和舒斯特定义的算法,另一种是最近开发的用于量化规律性和复杂性的统计量——近似熵(ApEn)。它们已被应用于睡眠脑电图的研究。根据实验室应用和比较,结果表明ApEn是一种有价值的复杂性度量。