PERBANDINGAN PENERAPAN ALGORITMA K-MEANS DAN FUZZY C-MEANS DALAM ANALISIS CLUSTERING TERHADAP PERGERAKAN HARGA HISTORIS SAHAM BANK RAKYAT INDONESIA

This study aims to analyze and compare the application of K-Means and Fuzzy C-Means algorithms for clustering historical stock price movements of Bank Rakyat Indonesia (BRI). Clustering is a method that groups data based on similarities, crucial in stock data analysis to aid more precise investment decision-making. The K-Means algorithm deterministically assigns each data point to a single cluster, while Fuzzy C-Means allows partial membership across multiple clusters, offering greater flexibility. The research findings indicate that the K-Means algorithm forms three primary clusters with a Silhouette Score of 0.4667, which defines clusters more clearly than Fuzzy C-Means, which has a score of 0.4199. The clusters produced by K-Means provide better-defined separations among stocks with medium, high, and low prices, based on price movements and transaction volume. In contrast, Fuzzy C-Means, despite its ability to handle overlapping data, results in less clearly defined clusters compared to K-Means. Based on these results, the K-Means algorithm is deemed more effective for clustering analysis in the context of BRI stocks. This research is expected to contribute to the development of more comprehensive stock movement analysis models and support investors in making better-informed investment decisions.

Authors

Publication Details

Journal
Jurnal Teknik Informasi dan Komputer (Tekinkom)
Published
2024-12-31
DOI
https://doi.org/10.37600/tekinkom.v7i2.1214
Primary Topic
Data Mining and Machine Learning Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

PERBANDINGAN PENERAPAN ALGORITMA K-MEANS DAN FUZZY C-MEANS DALAM ANALISIS CLUSTERING TERHADAP PERGERAKAN HARGA HISTORIS SAHAM BANK RAKYAT INDONESIA

Windania Purba, Ricky Hartanto
Jurnal Teknik Informasi dan Komputer (Tekinkom)
Data Mining and Machine Learning Applications
article

PERBANDINGAN PENERAPAN ALGORITMA K-MEANS DAN FUZZY C-MEANS DALAM ANALISIS CLUSTERING TERHADAP PERGERAKAN HARGA HISTORIS SAHAM BANK RAKYAT INDONESIA

Windania Purba, Ricky Hartanto
article en

Abstract

This study aims to analyze and compare the application of K-Means and Fuzzy C-Means algorithms for clustering historical stock price movements of Bank Rakyat Indonesia (BRI). Clustering is a method that groups data based on similarities, crucial in stock data analysis to aid more precise investment decision-making. The K-Means algorithm deterministically assigns each data point to a single cluster, while Fuzzy C-Means allows partial membership across multiple clusters, offering greater flexibility. The research findings indicate that the K-Means algorithm forms three primary clusters with a Silhouette Score of 0.4667, which defines clusters more clearly than Fuzzy C-Means, which has a score of 0.4199. The clusters produced by K-Means provide better-defined separations among stocks with medium, high, and low prices, based on price movements and transaction volume. In contrast, Fuzzy C-Means, despite its ability to handle overlapping data, results in less clearly defined clusters compared to K-Means. Based on these results, the K-Means algorithm is deemed more effective for clustering analysis in the context of BRI stocks. This research is expected to contribute to the development of more comprehensive stock movement analysis models and support investors in making better-informed investment decisions.

Jurnal Teknik Informasi dan Komputer (Tekinkom)Vol. 7(2)
Openalex Percentile: Top 55%
Data Mining and Machine Learning Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.