In this paper we present a novel methodology based on a topological entropy, the so-called persistent entropy,\ud for addressing the comparison between discrete piecewise linear functions. The comparison is certified by the\ud stability theorem for persistent entropy that is presented here. The theorem is used in the implementation of a\ud new algorithm. The algorithm transforms a discrete piecewise linear function into a filtered simplicial complex\ud that is analyzed via persistent homology and persistent entropy. Persistent entropy is used as a discriminant\ud feature for solving the supervised classification problem of real long-length noisy signals of DC electrical motors.\ud The quality of classification is stated in terms of the area under receiver operating characteristic curve\ud (AUC=93.87%)

No abstract

No abstract