All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

On Entropic Learning from Noisy Time Series in the Small Data Regime

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27120%2F24%3A10255905" target="_blank" >RIV/61989100:27120/24:10255905 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.mdpi.com/1099-4300/26/7/553" target="_blank" >https://www.mdpi.com/1099-4300/26/7/553</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.3390/e26070553" target="_blank" >10.3390/e26070553</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    On Entropic Learning from Noisy Time Series in the Small Data Regime

  • Original language description

    In this work, we present a novel methodology for performing the supervised classification of time-ordered noisy data; we call this methodology Entropic Sparse Probabilistic Approximation with Markov regularization (eSPA-Markov). It is an extension of entropic learning methodologies, allowing the simultaneous learning of segmentation patterns, entropy-optimal feature space discretizations, and Bayesian classification rules. We prove the conditions for the existence and uniqueness of the learning problem solution and propose a one-shot numerical learning algorithm that-in the leading order-scales linearly in dimension. We show how this technique can be used for the computationally scalable identification of persistent (metastable) regime affiliations and regime switches from high-dimensional non-stationary and noisy time series, i.e., when the size of the data statistics is small compared to their dimensionality and when the noise variance is larger than the variance in the signal. We demonstrate its performance on a set of toy learning problems, comparing eSPA-Markov to state-of-the-art techniques, including deep learning and random forests. We show how this technique can be used for the analysis of noisy time series from DNA and RNA Nanopore sequencing. (C) 2024 by the authors.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10103 - Statistics and probability

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2024

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Entropy

  • ISSN

    1099-4300

  • e-ISSN

  • Volume of the periodical

    26

  • Issue of the periodical within the volume

    7

  • Country of publishing house

    CH - SWITZERLAND

  • Number of pages

    25

  • Pages from-to

    "neuvedeno"

  • UT code for WoS article

    001277280300001

  • EID of the result in the Scopus database

    2-s2.0-85199885289