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

A Co-Optimization Algorithm Utilizing Particle Swarm Optimization for Linguistic Time Series

Author

Listed:
  • Nguyen Duy Hieu

    (Faculty of Natural Sciences and Technology, Tay Bac University, Sonla 360000, Vietnam)

  • Mai Van Linh

    (Faculty of Information Technology, East Asia University of Technology, Bacninh 220000, Vietnam
    Graduate University of Sciences and Technology, Vietnam Academy of Science and Technology, Hanoi 100000, Vietnam)

  • Pham Dinh Phong

    (Faculty of Information Technology, University of Transport and Communications, Hanoi 100000, Vietnam)

Abstract

The linguistic time-series forecasting model (LTS-FM), which has been recently proposed, uses linguistic words of linguistic variable domains generated by hedge algebras (HAs) to describe historical numeric time-series data. Then, the LTS-FM was established by utilizing real numeric semantics of words induced by the fuzziness parameter values (FPVs) of HAs. In the existing LTS-FMs, just the FPVs of HAs are optimized, while the used word set is still chosen by human experts. This paper proposes a co-optimization method of selecting the optimal used word set that best describes numeric time-series data in parallel with choosing the best FPVs of HAs to improve the accuracy of LTS-FMs by utilizing particle swarm optimization (PSO). In this co-optimization method, the outer loop optimizes the FPVs of HAs, while the inner loop optimizes the used word set. The experimental results on three datasets, i.e., the “enrollments of the University of Alabama” (EUA), the “killed in car road accidents in Belgium” (CAB), and the “spot gold in Turkey” (SGT), showed that our proposed forecasting model outperformed the existing forecasting models in terms of forecast accuracy.

Suggested Citation

  • Nguyen Duy Hieu & Mai Van Linh & Pham Dinh Phong, 2023. "A Co-Optimization Algorithm Utilizing Particle Swarm Optimization for Linguistic Time Series," Mathematics, MDPI, vol. 11(7), pages 1-14, March.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:7:p:1597-:d:1107505
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/7/1597/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/7/1597/
    Download Restriction: no
    ---><---

    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:11:y:2023:i:7:p:1597-:d:1107505. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.