Pembentukan Portofolio Saham Menggunakan Klastering Time Series K-Medoid dengan Ukuran Jarak Dynamic Time Warping

Penulis

  • La Gubu Departemen Matematika Universitas Gadjah Mada, Yogyakarta-Indonesia: Jurusan Matematika Universitas Halu Oleo, Kendari-Indonesia
  • Dedi Rosadi
  • Abdurakhman Abdurakhman

DOI:

https://doi.org/10.34123/jurnalasks.v13i2.295

Kata Kunci:

klastering, k-medoids, portofolio saham, estimasi robust, kinerja portofolio

Abstrak

This research will present the formation of stock portfolios by preprocessing data using time series clustering with a distance measure of Dynamic Time Warping (DTW). First, stocks are grouped into several clusters using the Partitioning Around Medoids (PAM) time series cluster based on the DTW distance measure. After the clustering process, stocks are selected to represent each cluster to build the optimum portfolio. The stock selected from each cluster is the one with the highest Sharpe ratio. The optimal portfolio is determined using three portfolio models, namely: the classic MV portfolio model, the FMCD robust MV portfolio model and the S robust portfolio model. Using this procedure, an optimum portfolio can be obtained efficiently if there are many stocks involved in the portfolio formation process. Sharpe ratio is used to measure the performance of the portfolios. The results of the empirical study show that the portfolio performance generated using the PAM time series clustering with DWT distance dissimilarity measure combined with the classic MV portfolio model outperforms the resulting portfolio performance in combination with other models.

Unduhan

Data unduhan tidak tersedia.

Unduhan

Diterbitkan

2021-12-31

Cara Mengutip

Pembentukan Portofolio Saham Menggunakan Klastering Time Series K-Medoid dengan Ukuran Jarak Dynamic Time Warping. (2021). Jurnal Aplikasi Statistika & Komputasi Statistik, 13(2), 35-46. https://doi.org/10.34123/jurnalasks.v13i2.295

Artikel Serupa

1-10 dari 25

Anda juga bisa Mulai pencarian similarity tingkat lanjut untuk artikel ini.

Artikel paling banyak dibaca berdasarkan penulis yang sama