论文标题
计算置换熵而无需排列
Calculating permutation entropy without permutations
论文作者
论文摘要
讨论了一种分析顺序数据集的方法，类似于置换熵一个。该方法的特征特征如下：它保留有关嵌入向量中相等值（如果有）的信息；它是合并学的豁免；它提供与置换方法相同的熵值，前提是嵌入向量没有相等的组件。在后一种情况下，可以使用此方法代替置换方法。如果嵌入向量具有相等的组件，则该方法在区分相似数据集时可能更精确。
A method for analyzing sequential data sets, similar to the permutation entropy one, is discussed. The characteristic features of this method are as follows: it preserves information about equal values, if any, in the embedding vectors; it is exempt of combinatorics; it delivers the same entropy value as does the permutation method, provided the embedding vectors do not have equal components. In the latter case this method can be used instead of the permutation one. If embedding vectors have equal components this method could be more precise in discriminating between similar data sets.
