IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/5365673.html
   My bibliography  Save this article

Time Series Symbolization Method for the Data Mining K-Means Algorithm

Author

Listed:
  • Guisheng Wang
  • Ahmed Farouk

Abstract

Time series is a data type frequently encountered in data analysis. With the current depth and breadth of the data and the improvement in computer processing capabilities, the dimensionality and the complexity of time series are getting higher and higher. Time series symbolization is to cluster and assign complex and lengthy time series in the form of symbols to achieve the purpose of reducing the dimensionality of the sequence or making the sequence easier to process. Considering the excellent performance of the K-means algorithm in data mining and processing, as well as in the allocation algorithm for clustering, we plan to develop a simple method for the symbolization of time series for the K-means algorithm and hope that this method can realize the high-dimensional time series dimensionality reduction, processing of the special points in time series, and so on. Based on this, this article proposes an improved sans algorithm based on the K-means algorithm and discusses the representation method and the data processing of time series symbolization. Experimental results show that this method can effectively reduce the dimensionality of high-dimensional time series. After dimensionality reduction, the information retention rate contained in the elevation of the sequence can reach more than 90%, which is very effective for the detection of outliers in low-dimensional sequences.

Suggested Citation

  • Guisheng Wang & Ahmed Farouk, 2023. "Time Series Symbolization Method for the Data Mining K-Means Algorithm," Discrete Dynamics in Nature and Society, Hindawi, vol. 2023, pages 1-11, April.
  • Handle: RePEc:hin:jnddns:5365673
    DOI: 10.1155/2023/5365673
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/ddns/2023/5365673.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/ddns/2023/5365673.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2023/5365673?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnddns:5365673. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.