Entropy is a fundamental concept in the field of information theory. During measurement, conventional entropy measures are susceptible to length and amplitude changes in time series. A new entropy metric, neural network entropy (NNetEn), has been developed to overcome these limitations. NNetEn entropy is computed using a modified LogNNet neural network classification model. The algorithm contains a reservoir matrix of N=19625 elements that must be filled with the given data. The contribution of this paper is threefold. Firstly, this work investigates different methods of filling the reservoir with time series (signal) elements. The reservoir filling method determines the accuracy of the entropy estimation by convolution of the study time series and LogNNet test data. The present study proposes 6 methods for filling the reservoir for time series. Two of them (Method 3 and Method 6) employ the novel approach of stretching the time series to create intermediate elements that complement it, but do not change its dynamics. The most reliable methods for short time series are Method 3 and Method 5. The second part of the study examines the influence of noise and constant bias on entropy values. Our study examines three different time series data types (chaotic, periodic, and binary) with different dynamic properties, Signal to Noise Ratio (SNR), and offsets. The NNetEn entropy calculation errors are less than 10% when SNR is greater than 30 dB, and entropy decreases with an increase in the bias component. The third part of the article analyzes real-time biosignal EEG data collected from emotion recognition experiments. The NNetEn measures show robustness under low-amplitude noise using various filters. Thus, NNetEn measures entropy effectively when applied to real-world environments with ambient noise, white noise, and 1/f noise.
翻译:信息理论领域的基本概念是 Entropy 。 在测量过程中, 常规的 Nentropy 测量方法容易在时间序列中发生长度和振幅的变化。 为了克服这些限制, 已经开发了一种新的 entropy 指标, 神经网络( NNetEn) entropy (NNetEN) 。 NNetEntropy 模型使用修改过的 LogNNet 神经网络分类模型来计算 NNet Etropy 。 算法包含一个必须用给定数据来填充 N=1925 元素的储量矩阵矩阵。 本文的贡献是三倍于时间序列, 以时间序列中的时间序列中最可靠的方法是时间序列( 时间序列) 。 储量填充方法的第二个部分是通过研究时间序列( 时间序列中噪音和恒定的 NNet- NNet), 数据序列中不使用不同的时间序列 。 我们的研究用不同的时间序列 将 NREO 的 Ralalalal deal 。