Characterizing unstructured data with the nearest neighbor permutation entropy

Abstract

Permutation entropy and its associated frameworks are remarkable examples of physics-inspired techniques adept at processing complex and extensive datasets. Despite substantial progress in developing and applying these tools, their use has been predominantly limited to structured datasets such as time series or images. Here, we introduce the k-nearest neighbor permutation entropy, an innovative extension of the permutation entropy tailored for unstructured data, irrespective of their spatial or temporal configuration and dimensionality. Our approach builds upon nearest neighbor graphs to establish neighborhood relations and uses random walks to extract ordinal patterns and their distribution, thereby defining the k-nearest neighbor permutation entropy. This tool not only adeptly identifies variations in patterns of unstructured data, but also does so with a precision that significantly surpasses conventional measures such as spatial autocorrelation. Additionally, it provides a natural approach for incorporating amplitude information and time gaps when analyzing time series or images, thus significantly enhancing its noise resilience and predictive capabilities compared to the usual permutation entropy. Our research substantially expands the applicability of ordinal methods to more general data types, opening promising research avenues for extending the permutation entropy toolkit for unstructured data.

14 two-column pages, 6 figures

References in corpus (16)

• Comparing the performance of FA, DFA and DMA using different synthetic long-range correlated time series
• Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems
• History of art paintings through the lens of entropy and complexity
• Complexity-Entropy Causality Plane as a Complexity Measure for Two-dimensional Patterns
• ordpy: A Python package for data analysis with permutation entropy and ordinal network methods
• Characterizing Time Series via Complexity-Entropy Curves
• Conditional entropy of ordinal patterns
• Discriminating image textures with the multiscale two-dimensional complexity-entropy causality plane
• Learning physical properties of liquid crystals with deep convolutional neural networks
• Estimating physical properties from liquid crystal textures via machine learning and complexity-entropy methods
• Anomaly Detection in Paleoclimate Records using Permutation Entropy
• Characterizing stochastic time series with ordinal networks
• Determining liquid crystal properties with ordinal networks and machine learning
• Mapping images into ordinal networks
• Two new parameters for the ordinal analysis of images
• Clustering free-falling paper motion with complexity and entropy

Cited by in corpus (3)

• Analysis of the autocorrelation function for time series with higher-order temporal correlations: An exponential case
• Nearest neighbor permutation entropy detects phase transitions in complex high-pressure systems
• Interpretable liquid crystal phase classification via two-by-two ordinal patterns