Sorry, you need to enable JavaScript to visit this website.

Permutation Entropy (PE) is a powerful nonlinear analysis technique for univariate time series. Recently, Permutation Entropy for Graph signals (PE_G) has been proposed to extend PE to data residing on irregular domains. However, PE_G is limited as it provides a single value to characterise a whole graph signal. Here, we introduce a novel approach to evaluate graph signals at the vertex level: graph-based permutation patterns. Synthetic datasets show the efficacy of our method.

Categories:
46 Views