Predictive Analytics on Product Sales at Heva Inc. Using K – Means Method
DOI:
https://doi.org/10.26555/jifo.v16i2.a24754Keywords:
Prediction, Business, Data Mining, K - Means, Clustering, RapidMinerAbstract
Prediction is the process of estimating something that is most likely to happen in the future based on previous and current knowledge that is owned, with the goal of minimizing the error. Prediction allows people to recognize and then solve difficulties that are occurring or are expected to arise.
This study began with preparation, literature review, data collection, and knowledge discovery in databases (KDD). One of the processes is data mining using the K – Means method, which is critical for obtaining the research's results and conclusions. This research also uses the RapidMiner application as a comparison of the results with the results obtained by python coding.
By using 4 clusters, products were categorized into 4 labels, namely very good products, good products, bad products, and very bad products. The research resulted in 11 products in the bad product category, 12 products in the good product category, 10 products in the very good category, and 18 products in the very good product category. The very good product label was further clarified with visualization to show the best time to restock each recommended product.
References
G. D. Rudebusch and J. C. Williams, “Forecasting recessions: The puzzle of the enduring power of the yield curve,” J. Bus. Econ. Stat., vol. 27, no. 4, pp. 492–503, 2009, doi: 10.1198/jbes.2009.07213.
A. Bari, M. Chaouchi, and T. Jung, Predicitve Analytics. 2014.
Herdianto, “Prediksi Kerusakan Motor Induksi Menggunakan Tesis Oleh Herdianto Fakultas Teknik,” (Tesis). Fak. Tek. Univ. Sumatera Utara, Medan, 2013.
G. Atluri, A. Karpatne, and V. Kumar, “Spatio-temporal data mining: A survey of problems and methods,” ACM Computing Surveys, vol. 51, no. 4. Association for Computing Machinery, Jul. 01, 2018, doi: 10.1145/3161602.
E. J. Wolberg, “Prediction Analysis,” in Designing Quantitative Experiments, Springer Berlin Heidelberg, 2010, pp. 90–127.
P. Giudici and S. Figini, “Applied Data Mining for Business and Industry,” Appl. Data Min. Bus. Ind., pp. 1–249, 2009, doi: 10.1002/9780470745830.
D. T. Larose and C. D. Larose, DISCOVERING KNOWLEDGE IN DATA An Introduction to Data Mining Second Edition Wiley Series on Methods and Applications in Data Mining. 2014.
C. Zhang and J. Han, Data Mining and Knowledge Discovery. 2021.
A. Novikov, “PyClustering: Data Mining Library,” J. Open Source Softw., vol. 4, no. 36, p. 1230, Apr. 2019, doi: 10.21105/joss.01230.
A. Nur Khormarudin, “Teknik Data Mining: Algoritma K-Means Clustering,” J. Ilmu Komput., pp. 1–12, 2016, [Online]. Available: https://ilmukomputer.org/category/datamining/.
A. Likas, N. Vlassis, and J. J. Verbeek, “The global k-means clustering algorithm,” Pattern Recognit., vol. 36, no. 2, pp. 451–461, 2003, doi: 10.1016/S0031-3203(02)00060-2.
N. Shi, X. Liu, and Y. Guan, “Research on k-means clustering algorithm: An improved k-means clustering algorithm,” 3rd Int. Symp. Intell. Inf. Technol. Secur. Informatics, IITSI 2010, pp. 63–67, 2010, doi: 10.1109/IITSI.2010.74.
Y. Liu, H. P. Yin, and Y. Chai, “An improved kernel k-means clustering algorithm,” Lect. Notes Electr. Eng., vol. 404, no. m, pp. 275–280, 2016, doi: 10.1007/978-981-10-2338-5_27.
R. L. Thorndike, “Who belongs in the family?,” Psychometrika, vol. 18, no. 4, pp. 267–276, 1953, doi: 10.1007/BF02289263.
M. A. Syakur, B. K. Khotimah, E. M. S. Rochman, and B. D. Satoto, “Integration K-Means Clustering Method and Elbow Method for Identification of the Best Customer Profile Cluster,” IOP Conf. Ser. Mater. Sci. Eng., vol. 336, no. 1, 2018, doi: 10.1088/1757-899X/336/1/012017.
A. Triayudi, Sumiati, T. Nurhadiyan H, and V. Rosalina, “Data mining implementation to predict sales using time series method,” in International Conference on Electrical Engineering, Computer Science and Informatics (EECSI), 2020, vol. 7, pp. 1–6, doi: 10.11591/eecsi.v7.2028.
A. U. Khasanah and Harwati, “A Comparative Study to Predict Student’s Performance Using Educational Data Mining Techniques,” in IOP Conference Series: Materials Science and Engineering, Jul. 2017, vol. 215, no. 1, doi: 10.1088/1757-899X/215/1/012036.
R. M. Sari, V. Tasril, and Y. A. M, “Prediksi Jumlah APBD Kota Payakumbuh dengan Metode K-Means,” IPTEKS Terap., vol. 14, no. 1, pp. 45–50, 2020.
Y. D. Darmi and A. Setiawan, “Penerapan Metode Clustering K-Means Dalam Pengelompokan Penjualan Produk,” J. Media Infotama, vol. 12, no. 2, pp. 148–157, 2017, doi: 10.37676/jmi.v12i2.418.
A. Prasatya, R. R. A. Siregar, and R. Arianto, “Penerapan Metode K-Means Dan C4.5 Untuk Prediksi Penderita Diabetes,” Petir, vol. 13, no. 1, pp. 86–100, 2020, doi: 10.33322/petir.v13i1.925.
M. Hofmann and R. Klinkenberg, Rapid Miner Data Mining Use Cases and Business Analytics Applications. 2013.
T. M. S. Yedla, Madhu, Srinivasa Rao Pathakota, “Enhancing K-means Clustering Algorithm with Improved Initial Center,” Int. J. Comput. Sci. Inf. Technol., vol. 1, no. 2, pp. 121–125, 2010.
F. Corea, “Introduction to Data,” 2019, pp. 1–5.
Downloads
Published
Issue
Section
License
Authors who publish with Jurnal Informatika (JIFO) agree to the following terms:
- Â Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
Â
 
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
