Teddie Darmizal
Universitas Islam Negeri Sultan Syarif Kasim Riau, Pekanbaru

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : bulletin of computer science research

Implementasi Data Mining K-Means Clustering Untuk Pengelompokan Produk Keramik Berdasarkan Frekuensi, Volume, dan Jangkauan Penjualan Ferdian Arya Dinata; Alwis Nazir; Fadhilah Syafria; Teddie Darmizal; Eka Pandu Cynthia
Bulletin of Computer Science Research Vol. 6 No. 4 (2026): June 2026
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bulletincsr.v6i4.1195

Abstract

Ceramic inventory management at CV. Makmur Bersama has generally relied on intuition or partial sales data, without accounting for purchasing behavior patterns as a whole. This approach simultaneously creates two major risks: overstocking of slow-moving products, which burdens working capital and storage space, and stockouts of high-demand products, which can result in lost sales opportunities. This problem is further compounded by the limitation of stock data, which typically contains only a single quantitative variable such as the number of units sold and is therefore unable to comprehensively capture product demand characteristics, such as how frequently a product is purchased or how broad its customer base is. As a result, restocking decisions and promotional strategies are often poorly targeted. This research applies the K-Means algorithm to cluster ceramic products based on historical sales patterns as a solution to this limitation. Historical sales data from CV. Makmur Bersama for the 2025 period, consisting of 6,328 transactions, was processed into 417 unique products through a feature engineering approach using Frequency, Monetary, and Reach (FMR) namely transaction count, total quantity sold, and unique customer count per product. After outlier detection using the Interquartile Range (IQR) method, 381 products remained for the clustering process. The optimal number of clusters was determined using the Elbow Method, resulting in k=4 as the best cluster count. Evaluation using the Davies-Bouldin Index (DBI) produced a value of 0.8954, categorized as good, and stability testing across five iterations with different random states showed consistent results (DBI standard deviation of 0.0034). The clustering results produced Cluster 1 (190 products, 49.9%) as slow-moving products, Cluster 2 (34 products, 8.9%) as top-performing products with an average transaction frequency of 30.8 times, Cluster 3 (93 products, 24.4%) as potential products, and Cluster 4 (64 products, 16.8%) as products with limited demand. This research provides practical contributions for companies in determining restocking priorities, promotional strategies, and working capital efficiency based on actual sales patterns. This research contributes methodologically through the adaptation of the RFM framework into FMR to better suit real-world data constraints, as well as the integration of the Elbow Method, Davies-Bouldin Index, and stability testing as a comprehensive validation mechanism. Practically, the segmentation results can be directly utilized by the company as a basis for restocking priorities, promotional strategies, and working capital allocation efficiency based on actual sales patterns.
Analisis Kinerja Recursive Feature Elimination pada Support Vector Machine untuk Klasifikasi Penyakit Stroke pada Data Tidak Seimbang Faridatul Jannah; Siska Kurnia Gusti; Elin Haerani; Teddie Darmizal
Bulletin of Computer Science Research Vol. 6 No. 4 (2026): June 2026
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bulletincsr.v6i4.1147

Abstract

Stroke is a non-communicable disease with high mortality and disability rates, necessitating a classification approach that can facilitate more effective detection. Class imbalance in stroke datasets causes classification models to be biased toward the majority class, resulting in suboptimal classification performance. This study aims to analyze the performance of Recursive Feature Elimination (RFE) in a Support Vector Machine (SVM) model with data imbalance handling using Adaptive Synthetic Sampling (ADASYN) in stroke classification. The dataset used is a secondary dataset from Kaggle consisting of 5109 data points after the preprocessing stage. The modeling process was conducted by testing various data split ratios as well as combinations of kernels and SVM parameters using a 5-fold cross-validation approach. The results show that the best model was obtained with an 80:20 split ratio, a polynomial kernel, and a C parameter of 0.1, yielding an accuracy of 0.75, precision of 0.14, recall of 0.82, an F1-score of 0.24, and an AUC of 0.8245. The application of RFE resulted in improved model performance compared to without RFE, although the magnitude of the improvement was relatively small. The still low precision value indicates that the model still produces many false positives, so the classification challenge on the stroke dataset has not been fully resolved. On the other hand, an AUC value of 0.8245 indicates that the model performs reasonably well in distinguishing between the two classes overall, although its application in a clinical context still requires further refinement.