IDEAS home Printed from https://ideas.repec.org/a/aif/journl/v3y2019i2p146-166.html
   My bibliography  Save this article

Comparing Clustering Algorithms using Financial Time-series data

Author

Listed:
  • Duangrux Tangsirisakul

Abstract

Data clustering is one of the most popular unsupervised machine learning approaches. Clustering data can help identify the pattern of what seems to be similar data and leads to the best solution for all commercial problems. For example, taxi booking application, customer’s data can be clustered to match supply with demand, to detect fraud pattern of an e-commerce transaction or clustering customers in dating application, etc. In order to carry out the best calculation of clustering certain requirement is needed in each method and approach such as the basic assumption of data. When analyzing data with a wrong assumption, it results in low-quality outcomes. So we would like to study and compare this type of data in an in-depth manner. Time-series analysis is used in many future prediction tasks based on previously observed values, mixing cluster analysis and time-series data to serve the initial purpose that researcher would like to share to the public for better understanding of the clustering, researcher would also like following researchers to refer to this work and develop this theory and apply in wider issues in future. In this paper, the focus is on comparing time-series clustering algorithm with financial time-series data, which is common data such as cryptocurrency, exchange rate currency, the Shanghai Stock Exchange (SSE50), and the stock exchange of Thailand 50 (SET50). The paper introduces the importance of data mining, machine learning, and time-series clustering and some related methods, which lays a theoretical foundation for the formal research of this paper. By analyzing the structure of time-series clustering, that consists of several parts, including distance measurement, time-series prototype, a clustering algorithm, and clustering evaluation. From research result, the hierarchical algorithm is the most efficient algorithm for unequal length of cryptocurrency series and SSE 50. In another hand, the partitional algorithm is the most efficient for an equal length of exchange rate currency and SET 50.

Suggested Citation

  • Duangrux Tangsirisakul, 2019. "Comparing Clustering Algorithms using Financial Time-series data," International Journal of Science and Business, IJSAB International, vol. 3(2), pages 146-166.
  • Handle: RePEc:aif:journl:v:3:y:2019:i:2:p:146-166
    as

    Download full text from publisher

    File URL: https://ijsab.com/wp-content/uploads/334.pdf
    Download Restriction: no

    File URL: https://ijsab.com/volume-3-issue-2/1855
    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:aif:journl:v:3:y:2019:i:2:p:146-166. 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: Farjana Rahman (email available below). General contact details of provider: .

    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.