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”

Distance-based one-class time-series classification approach using local cluster balance

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18470%2F24%3A50020644" target="_blank" >RIV/62690094:18470/24:50020644 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.sciencedirect.com/science/article/pii/S0957417423017037" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0957417423017037</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.eswa.2023.121201" target="_blank" >10.1016/j.eswa.2023.121201</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Distance-based one-class time-series classification approach using local cluster balance

  • Original language description

    Deciding the signal length is an important challenge for one-class time-series classification (OCTSC). This paper aims to develop an OCTSC algorithm that does not require model retraining for different signal lengths. For this purpose, a distance-based one-class time-series classification approach using local cluster balance (OCLCB) is proposed. OCLCB extracts feature vectors, namely, local cluster balance (LCB), from the clustering results of sliding windows. K-means clustering is applied to the sliding windows extracted from the training signal. Then, the local prototype (LP) is calculated as the average of the local cluster balance (LCB) in the training data. Unseen scores are computed as the distance metrics between LP and LCBs in the testing data. Since the sliding window size is independent of the entire signal size, OCLCB does not need to retrain the model. This aspect gives the benefit of reducing the parameter tuning costs. The source code is uploaded at https://github.com/ToshiHayash i/OCLCB.

  • 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

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

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

    Expert systems with applications

  • ISSN

    0957-4174

  • e-ISSN

    1873-6793

  • Volume of the periodical

    235

  • Issue of the periodical within the volume

    January

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    13

  • Pages from-to

    "Article Number: 121201"

  • UT code for WoS article

    001059416500001

  • EID of the result in the Scopus database

    2-s2.0-85168558271