IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i7p938-d1362118.html
   My bibliography  Save this article

Exploring the Entropy-Based Classification of Time Series Using Visibility Graphs from Chaotic Maps

Author

Listed:
  • J. Alberto Conejero

    (Instituto Universitario Matemática Pura y Aplicada, Universitat Politècnica de València, 46022 Valencia, Spain)

  • Andrei Velichko

    (Institute of Physics and Technology, Petrozavodsk State University, 185910 Petrozavodsk, Russia)

  • Òscar Garibo-i-Orts

    (Instituto Universitario Matemática Pura y Aplicada, Universitat Politècnica de València, 46022 Valencia, Spain
    GRID—Grupo de Investigación en Ciencia de Datos, Valencian International University—VIU, Carrer Pintor Sorolla 21, 46002 Valencia, Spain)

  • Yuriy Izotov

    (Institute of Physics and Technology, Petrozavodsk State University, 185910 Petrozavodsk, Russia)

  • Viet-Thanh Pham

    (Faculty of Electrical and Electronics Engineering, Ton Duc Thang University, Ho Chi Minh City 758307, Vietnam)

Abstract

The classification of time series using machine learning (ML) analysis and entropy-based features is an urgent task for the study of nonlinear signals in the fields of finance, biology and medicine, including EEG analysis and Brain–Computer Interfacing. As several entropy measures exist, the problem is assessing the effectiveness of entropies used as features for the ML classification of nonlinear dynamics of time series. We propose a method, called global efficiency (GEFMCC), for assessing the effectiveness of entropy features using several chaotic mappings. GEFMCC is a fitness function for optimizing the type and parameters of entropies for time series classification problems. We analyze fuzzy entropy (FuzzyEn) and neural network entropy (NNetEn) for four discrete mappings, the logistic map, the sine map, the Planck map, and the two-memristor-based map, with a base length time series of 300 elements. FuzzyEn has greater GEFMCC in the classification task compared to NNetEn. However, NNetEn classification efficiency is higher than FuzzyEn for some local areas of the time series dynamics. The results of using horizontal visibility graphs (HVG) instead of the raw time series demonstrate the GEFMCC decrease after HVG time series transformation. However, the GEFMCC increases after applying the HVG for some local areas of time series dynamics. The scientific community can use the results to explore the efficiency of the entropy-based classification of time series in “The Entropy Universe”. An implementation of the algorithms in Python is presented.

Suggested Citation

  • J. Alberto Conejero & Andrei Velichko & Òscar Garibo-i-Orts & Yuriy Izotov & Viet-Thanh Pham, 2024. "Exploring the Entropy-Based Classification of Time Series Using Visibility Graphs from Chaotic Maps," Mathematics, MDPI, vol. 12(7), pages 1-23, March.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:7:p:938-:d:1362118
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/7/938/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/7/938/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Li, Sange & Shang, Pengjian, 2021. "Analysis of nonlinear time series using discrete generalized past entropy based on amplitude difference distribution of horizontal visibility graph," Chaos, Solitons & Fractals, Elsevier, vol. 144(C).
    2. Ahmed Sedik & Ahmed A. Abd El-Latif & Mudasir Ahmad Wani & Fathi E. Abd El-Samie & Nariman Abdel-Salam Bauomy & Fatma G. Hashad, 2023. "Efficient Multi-Biometric Secure-Storage Scheme Based on Deep Learning and Crypto-Mapping Techniques," Mathematics, MDPI, vol. 11(3), pages 1-26, January.
    3. Ömer Akgüller & Mehmet Ali Balcı & Larissa M. Batrancea & Lucian Gaban, 2023. "Path-Based Visibility Graph Kernel and Application for the Borsa Istanbul Stock Network," Mathematics, MDPI, vol. 11(6), pages 1-25, March.
    4. Li, Sange & Shang, Pengjian, 2022. "A new complexity measure: Modified discrete generalized past entropy based on grain exponent," Chaos, Solitons & Fractals, Elsevier, vol. 157(C).
    5. Gao, Meng & Ge, Ruijun, 2024. "Mapping time series into signed networks via horizontal visibility graph," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 633(C).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kamer-Ainur Aivaz & Ionela Florea Munteanu & Flavius Valentin Jakubowicz, 2023. "Bitcoin in Conventional Markets: A Study on Blockchain-Induced Reliability, Investment Slopes, Financial and Accounting Aspects," Mathematics, MDPI, vol. 11(21), pages 1-20, November.
    2. Pejman Peykani & Mostafa Sargolzaei & Mohammad Hashem Botshekan & Camelia Oprean-Stan & Amir Takaloo, 2023. "Optimization of Asset and Liability Management of Banks with Minimum Possible Changes," Mathematics, MDPI, vol. 11(12), pages 1-24, June.
    3. Bai, Shiwei & Niu, Min, 2022. "The visibility graph of n-bonacci sequence," Chaos, Solitons & Fractals, Elsevier, vol. 163(C).
    4. Wang, Fang & Wang, Lin & Chen, Yuming, 2022. "Multi-affine visible height correlation analysis for revealing rich structures of fractal time series," Chaos, Solitons & Fractals, Elsevier, vol. 157(C).
    5. Hu, Xiaohua & Niu, Min, 2023. "Horizontal visibility graphs mapped from multifractal trinomial measures," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 626(C).
    6. Ren, Weikai & Jin, Zhijun, 2023. "Phase space visibility graph," Chaos, Solitons & Fractals, Elsevier, vol. 176(C).
    7. Li, Sange & Shang, Pengjian, 2022. "A new complexity measure: Modified discrete generalized past entropy based on grain exponent," Chaos, Solitons & Fractals, Elsevier, vol. 157(C).
    8. Lin, Guancen & Lin, Aijing, 2022. "Modified multiscale sample entropy and cross-sample entropy based on horizontal visibility graph," Chaos, Solitons & Fractals, Elsevier, vol. 165(P1).
    9. Chafi, Mohammadreza Shafiee & Narm, Hossein Gholizade & Kalat, Ali Akbarzadeh, 2023. "Chaotic and stochastic evaluation in Fluxgate magnetic sensors," Chaos, Solitons & Fractals, Elsevier, vol. 176(C).
    10. Gao, Meng & Ge, Ruijun, 2024. "Mapping time series into signed networks via horizontal visibility graph," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 633(C).
    11. Hu, Xiaohua & Niu, Min, 2023. "Degree distributions and motif profiles of Thue–Morse complex network," Chaos, Solitons & Fractals, Elsevier, vol. 176(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:7:p:938-:d:1362118. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.