IDEAS home Printed from https://ideas.repec.org/a/wsi/ijitdm/v20y2021i06ns0219622021500449.html
   My bibliography  Save this article

A Hybrid Validity Index to Determine K Parameter Value of k-Means Algorithm for Time Series Clustering

Author

Listed:
  • Fatma Ozge Ozkok

    (Department of Computer Engineering, Erciyes University, Kayseri, 38039, Turkey)

  • Mete Celik

    (Department of Computer Engineering, Erciyes University, Kayseri, 38039, Turkey)

Abstract

Time series is a set of sequential data point in time order. The sizes and dimensions of the time series datasets are increasing day by day. Clustering is an unsupervised data mining technique that groups objects based on their similarities. It is used to analyze various datasets, such as finance, climate, and bioinformatics datasets. k-means is one of the most used clustering algorithms. However, it is challenging to determine the value of k parameter, which is the number of clusters. One of the most used methods to determine the number of clusters (such as k) is cluster validity indexes. Several internal and external validity indexes are used to find suitable cluster numbers based on characteristics of datasets. In this study, we propose a hybrid validity index to determine the value of k parameter of k-means algorithm. The proposed hybrid validity index comprises four internal validity indexes, such as Dunn, Silhouette, C index, and Davies–Bouldin indexes. The proposed method was applied to nine real-life finance and benchmarks time series datasets. The financial dataset was obtained from Yahoo Finance, consisting of daily closing data of stocks. The other eight benchmark datasets were obtained from UCR time series classification archive. Experimental results showed that the proposed hybrid validity index is promising for finding the suitable number of clusters with respect to the other indexes for clustering time-series datasets.

Suggested Citation

  • Fatma Ozge Ozkok & Mete Celik, 2021. "A Hybrid Validity Index to Determine K Parameter Value of k-Means Algorithm for Time Series Clustering," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 20(06), pages 1615-1636, November.
  • Handle: RePEc:wsi:ijitdm:v:20:y:2021:i:06:n:s0219622021500449
    DOI: 10.1142/S0219622021500449
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219622021500449
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0219622021500449?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:wsi:ijitdm:v:20:y:2021:i:06:n:s0219622021500449. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijitdm/ijitdm.shtml .

    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.