Claim Missing Document
Check
Articles

Found 2 Documents
Search

ANALISIS DATA MINING DALAM PENGELOLAAN PERSEDIAAN STOK DENGAN ALGORITMA RANDOM FOREST DAN APRIORI (STUDI KASUS: TOKO CERIA BABYSHOP) Zalukhu, Anzas Ibezato; Iqbal, Muhammad; Nasution, Darmeli
JOURNAL OF SCIENCE AND SOCIAL RESEARCH Vol 8, No 3 (2025): August 2025
Publisher : Smart Education

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.54314/jssr.v8i3.3544

Abstract

Abstract: This research analyzes inventory management at Toko Ceria Babyshop by applying data mining techniques, specifically Random Forest and Apriori algorithms. Effective inventory management is crucial for aligning product availability with market demand, preventing overstocking or stockouts, and optimizing operational costs. Sales transaction data from June to December 2024, comprising 20,578 sales transactions, 3,593 purchase entries, 2,736 initial stock entries, and 1,331 final stock entries, were divided into 80:20 training and testing sets. The Random Forest implementation showed that weekly purchase quantity predictions were more effective than monthly predictions, evidenced by lower Mean Squared Error (MSE), Mean Absolute Error (MAE), and Root Mean Squared Error (RMSE) values for weekly predictions (16.10, 1.76, 4.01) compared to monthly (39.68, 3.19, 6.30). Furthermore, the R-squared (R²) value was higher for the weekly model (0.21) than the monthly (0.04), indicating better weekly prediction accuracy. The Apriori algorithm successfully identified product association patterns for both 2-itemsets and 3-itemsets, with all rules exhibiting lift values above 1, signifying positive relationships between products. This purchasing pattern information is highly beneficial for developing marketing strategies such as bundling, shelf arrangement, cross-selling promotions, and improved inventory planning. Keywords: Data mining, Random Forest, Apriori, stok Inventory, Toko Ceria Babyshop Abstrak: Penelitian ini berfokus pada analisis pengelolaan persediaan stok di Toko Ceria Babyshop melalui penerapan teknik data mining menggunakan algoritma Random Forest dan Apriori. Efektivitas pengelolaan persediaan sangat krusial dalam bisnis untuk menyelaraskan ketersediaan produk dengan permintaan pasar, mencegah kelebihan atau kekurangan stok, dan mengoptimalkan biaya operasional. Data transaksi penjualan yang dikumpulkan dari Juni hingga Desember 2024 terdiri dari 20.578 transaksi penjualan, 3.593 entri pembelian, 2.736 entri stok awal, dan 1.331 entri stok akhir, yang kemudian dibagi menjadi set pelatihan dan pengujian dengan rasio 80:20. Hasil implementasi algoritma Random Forest menunjukkan prediksi kuantitas pembelian mingguan lebih efektif dibandingkan bulanan, ditunjukkan oleh nilai Mean Squared Error (MSE), Mean Absolute Error (MAE), dan Root Mean Squared Error (RMSE) yang lebih rendah pada prediksi mingguan (16.10, 1.76, 4.01) dibandingkan bulanan (39.68, 3.19, 6.30). Selain itu, nilai R-squared (R²) juga lebih tinggi untuk model mingguan (0.21) dibandingkan bulanan (0.04), mengindikasikan akurasi prediksi mingguan yang lebih baik. Algoritma Apriori berhasil mengidentifikasi pola asosiasi produk, baik untuk 2-itemset maupun 3-itemset, dengan semua aturan memiliki nilai lift di atas 1, yang menunjukkan hubungan positif antar produk. Informasi mengenai pola pembelian ini sangat bermanfaat untuk pengembangan strategi pemasaran seperti bundling, penataan rak, promosi cross-selling, serta perencanaan persediaan stok yang lebih baik. Kata kunci: Data mining, Random Forest, Apriori, Persediaan stok, Toko Ceria  Babyshop
Penerapan Algoritma Dijkstra Dan Metode Topsis Dalam Sistem Rekomendasi Barbershop Berbasis Android Hulu, Adil Priman Hati; Zalukhu, Anzas Ibezato
Jurnal Armada Informatika Vol 9 No 2 (2025)
Publisher : STMIK Methodist Binjai

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36520/jai.v9i2.193

Abstract

The rapid growth of modern barbershops in Medan City has increased user difficulties in determining the nearest location while selecting the best barbershop based on multiple service criteria. The main problems involve finding optimal routes and selecting the best alternatives based on price, service quality, style, health protocols, and distance. This study develops an Android-based barbershop recommendation system by integrating the Dijkstra algorithm for shortest path search and the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) method for alternative ranking. Dijkstra calculates the shortest distance from the user's location, while TOPSIS determines the best recommendation using weighted criteria. The results show that the system effectively provides the fastest routes and optimal recommendations according to user preferences, improving search efficiency and decision-making accuracy.