Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 83 tok/s
Gemini 2.5 Pro 34 tok/s Pro
GPT-5 Medium 24 tok/s Pro
GPT-5 High 21 tok/s Pro
GPT-4o 130 tok/s Pro
Kimi K2 207 tok/s Pro
GPT OSS 120B 460 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Characterizing unstructured data with the nearest neighbor permutation entropy (2403.13122v1)

Published 19 Mar 2024 in physics.data-an

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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (51)
  1. C. A. Mattmann, “A vision for data science,” Nature 493, 473–475 (2013).
  2. World Bank, “World development report 2021: Data for better lives,”  (2021).
  3. C. Bandt and B. Pompe, “Permutation entropy: A natural complexity measure for time series,” Physical Review Letters 88, 174102 (2002).
  4. R. Yan, Y. Liu, and R. X. Gao, “Permutation entropy: A nonlinear statistical measure for status characterization of rotary machines,” Mechanical Systems and Signal Processing 29, 474–484 (2012).
  5. N. Nicolaou and J. Georgiou, “Detection of epileptic electroencephalogram based on permutation entropy and support vector machines,” Expert Systems with Applications 39, 202–209 (2012).
  6. L. d. Santos, D. C. Corrêa, D. M. Walker, M. F. de Godoy, E. E. Macau, and M. Small, “Characterisation of neonatal cardiac dynamics using ordinal partition network,” Medical & Biological Engineering & Computing 60, 829–842 (2022).
  7. L. Zunino, M. Zanin, B. M. Tabak, D. G. Pérez, and O. A. Rosso, “Forbidden patterns, permutation entropy and stock market inefficiency,” Physica A 388, 2854–2864 (2009).
  8. J. Garland, T. R. Jones, M. Neuder, V. Morris, J. W. White, and E. Bradley, “Anomaly detection in paleoclimate records using permutation entropy,” Entropy 20, 931 (2018).
  9. A. A. B. Pessa, M. Perc, and H. V. Ribeiro, “Clustering free-falling paper motion with complexity and entropy,” EPL 138, 30003 (2022).
  10. H. Y. D. Sigaki, R. F. De Souza, R. T. de Souza, R. S. Zola, and H. V. Ribeiro, “Estimating physical properties from liquid crystal textures via machine learning and complexity-entropy methods,” Physical Review E 99, 013311 (2019).
  11. A. A. B. Pessa, R. S. Zola, M. Perc, and H. V. Ribeiro, “Determining liquid crystal properties with ordinal networks and machine learning,” Chaos, Solitons & Fractals 154, 111607 (2022).
  12. H. Y. D. Sigaki, M. Perc, and H. V. Ribeiro, “History of art paintings through the lens of entropy and complexity,” Proceedings of the National Academy of Sciences 115, E8585–E8594 (2018).
  13. M. Zanin, L. Zunino, O. A. Rosso, and D. Papo, “Permutation entropy and its main biomedical and econophysics applications: A review,” Entropy 14, 1553–1577 (2012).
  14. M. Riedl, A. Müller, and N. Wessel, “Practical considerations of permutation entropy,” The European Physical Journal Special Topics 222, 249–262 (2013).
  15. J. M. Amigó, K. Keller, and V. A. Unakafova, “Ordinal symbolic analysis and its application to biomedical recordings,” Philosophical Transactions of the Royal Society A 373, 20140091 (2015).
  16. K. Keller, T. Mangold, I. Stolz, and J. Werner, “Permutation entropy: New ideas and challenges,” Entropy 19, 134 (2017).
  17. A. A. B. Pessa and H. V. Ribeiro, “ordpy: A python package for data analysis with permutation entropy and ordinal network methods,” Chaos 31, 063110 (2021).
  18. J. M. Amigó and O. A. Rosso, “Ordinal methods: Concepts, applications, new developments, and challenges,” Chaos 33, 080401 (2023).
  19. A. M. Unakafov and K. Keller, “Conditional entropy of ordinal patterns,” Physica D 269, 94–102 (2014).
  20. O. A. Rosso, H. Larrondo, M. T. Martin, A. Plastino, and M. A. Fuentes, “Distinguishing noise from chaos,” Physical Review Letters 99, 154102 (2007).
  21. J. M. Amigó, L. Kocarev, and J. Szczepanski, “Order patterns and chaos,” Physics Letters A 355, 27–31 (2006).
  22. J. M. Amigó, S. Zambrano, and M. A. Sanjuán, “True and false forbidden patterns in deterministic and random dynamics,” EPL 79, 50001 (2007).
  23. C. Bian, C. Qin, Q. D. Y. Ma, and Q. Shen, “Modified permutation-entropy analysis of heartbeat dynamics,” Physical Review E 85, 021906 (2012).
  24. D. Cuesta-Frau, M. Varela-Entrecanales, A. Molina-Picó, and B. Vargas, “Patterns with equal values in permutation entropy: Do they really matter for biosignal classification?” Complexity 2018, 1324696 (2018).
  25. L. Zunino, M. C. Soriano, I. Fischer, O. A. Rosso, and C. R. Mirasso, “Permutation-information-theory approach to unveil delay dynamics from time-series analysis,” Physical Review E 82, 046212 (2010).
  26. L. Zunino, M. C. Soriano, and O. A. Rosso, “Distinguishing chaotic and stochastic dynamics from time series by using a multiscale symbolic approach,” Physical Review E 86, 046210 (2012).
  27. M. Small, “Complex networks from time series: Capturing dynamics,” in 2013 IEEE International Symposium on Circuits and Systems (ISCAS2013) (2013) pp. 2509–2512.
  28. M. McCullough, M. Small, T. Stemler, and H. H.-C. Iu, “Time lagged ordinal partition networks for capturing dynamics of continuous dynamical systems,” Chaos 25, 053101 (2015).
  29. J. Zhang, J. Zhou, M. Tang, H. Guo, M. Small, and Y. Zou, “Constructing ordinal partition transition networks from multivariate time series,” Scientific Reports 7, 7795 (2017).
  30. M. Small, M. McCullough, and K. Sakellariou, “Ordinal network measures - Quantifying determinism in data,” in 2018 IEEE International Symposium on Circuits and Systems (ISCAS) (2018) pp. 1–5.
  31. A. A. B. Pessa and H. V. Ribeiro, “Characterizing stochastic time series with ordinal networks,” Physical Review E 100, 042304 (2019).
  32. A. A. B. Pessa and H. V. Ribeiro, “Mapping images into ordinal networks,” Physical Review E 102, 052312 (2020).
  33. L. Zunino and H. V. Ribeiro, “Discriminating image textures with the multiscale two-dimensional complexity-entropy causality plane,” Chaos, Solitons & Fractals 91, 679–688 (2016).
  34. C. Bandt and K. Wittfeld, “Two new parameters for the ordinal analysis of images,” Chaos 33, 043124 (2023).
  35. J. S. Fabila-Carrasco, C. Tan, and J. Escudero, “Permutation entropy for graph signals,” IEEE Transactions on Signal and Information Processing over Networks 8, 288–300 (2022).
  36. A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD ’16 (2016) pp. 855–864.
  37. C. E. Shannon, “A mathematical theory of communication,” The Bell System Technical Journal 27, 379–423 (1948).
  38. L. McInnes, J. Healy, and J. Melville, “UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction,” ArXiv  (2018), 10.48550/arXiv.1802.03426.
  39. L. McInnes, J. Healy, N. Saul, and L. Grossberger, “UMAP: Uniform Manifold Approximation and Projection,” The Journal of Open Source Software 3, 861 (2018).
  40. B. B. Mandelbrot, The Fractal Geometry of Nature (Freeman, New York, San Francisco, 1982).
  41. B. B. Mandelbrot and J. W. Van Ness, “Fractional Brownian motions, fractional noises and applications,” SIAM Review 10, 422–437 (1968).
  42. J. R. M. Hosking, “Modeling persistence in hydrological time series using fractional differencing,” Water Resources Research 20, 1898–1908 (1984).
  43. P. A. Moran, “Notes on continuous stochastic phenomena,” Biometrika 37, 17–23 (1950).
  44. A. Getis, “A history of the concept of spatial autocorrelation: A geographer’s perspective,” Geographical Analysis 40, 297–309 (2008).
  45. P. de Jong, C. Sprenger, and F. van Veen, “On extreme values of Moran’s I𝐼Iitalic_I and Geary’s c𝑐citalic_c,” Geographical Analysis 16, 17–24 (1984).
  46. J. L. Gittleman and M. Kot, “Adaptation: Statistics and a null model for estimating phylogenetic effects,” Systematic Zoology 39, 227–241 (1990).
  47. C.-K. Peng, S. V. Buldyrev, S. Havlin, M. Simons, H. E. Stanley, and A. L. Goldberger, “Mosaic organization of DNA nucleotides,” Physical Review E 49, 1685–1689 (1994).
  48. Y.-H. Shao, G.-F. Gu, Z.-Q. Jiang, W.-X. Zhou, and D. Sornette, “Comparing the performance of FA, DFA and DMA using different synthetic long-range correlated time series,” Scientific Reports 2, 835 (2012).
  49. C. Z. L. Schimansky-Geier, “Harmonic noise: Effect on bistable systems,” Zeitschrift für Physik B 79, 451–460 (1990).
  50. P.-G. De Gennes and J. Prost, The Physics of Liquid Crystals (Oxford University Press, Oxford, 1993).
  51. H. Y. D. Sigaki, E. K. Lenzi, R. S. Zola, M. Perc, and H. V. Ribeiro, “Learning physical properties of liquid crystals with deep convolutional neural networks,” Scientific Reports 10, 7664 (2020).
Citations (3)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up
Github Logo Streamline Icon: https://streamlinehq.com

GitHub

  1. GitHub - hvribeiro/knnpe: knnpe: A Python package implementing the k-nearest neighbor permutation entropy (6 stars)
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets

This paper has been mentioned in 2 posts and received 35 likes.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up to View

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

Explore Trending Papers

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube