Prediksi Penjualan Parfum Menggunakan Algoritma Apriori pada Queen Parfume
Abstract
Full Text:
PDFReferences
I.A. Nikmatun and I. Waspada, “Implementasi Data Mining Untuk Klasifikasi Masa Studi Mahasiswa Menggunakan Algoritma K-Nearest Neighbor”, Jurnal SIMETRIS, Vol. 10 No. 2 November 2019, pp. 421-432.
R.R. Putra, and C. Wadisman, “Implementasi Data Mining Pemilihan Pelanggan Potensial Menggunakan Algoritma K-Means”, Journal of Information Technology and Computer Science (INTECOMS), Volume 1 No 1, Maret 2018, pp. 72-77.
S. Jambekar and Z. Saquib, “Application of Data Mining Techniques for Prediction of Crop Production in India,” vol. 7, no. 4, pp. 66–69, 2018.
U. Shafique and H. Qaiser, “A Comparative Study of Data Mining Process Models (KDD, CRISPDM and SEMMA),” Int. J. Innov. Sci. Res. ISSN, vol. 12, no. 1, pp. 2351–8014, 2014.
Han, J., Kamber, M., dan Pei, J., “Data Mining: Concepts and Techniques Third Edition”, Morgan Kaufmann, USA, 2011.
J.R. Gumilang, “Implementasi Algoritma Apriori Untuk Analisis Penjualan Konter Berbasis Web”, Jurnal Informatika dan Rekayasa Perangkat Lunak (JATIKA), Vol. 1 No. 2, Desember 2020, pp. 226~233.
Iswandi, P., Permana, I. and Salisah, F. N. ‘‘Penerapan Algoritma Apriori Pada Data Transaksi Penjualan Hypermart XYZ Lampung Untuk Penentuan Tata Letak Barang’’, Jurnal Ilmiah Rekayasa dan Manajemen Sistem Informasi, 6(1), 2020, pp. 70–74.
DOI: https://doi.org/10.33365/tft.v4i2.4556
Refbacks
- There are currently no refbacks.
Copyright (c) 2024 Ravi Ari Tri Ardani, Jupriyadi Jupriyadi, Styawati Styawati, Rio Andika
![]() | Published by Universitas Teknokrat Indonesia Organized by Fakultas Teknik dan Ilmu Komputer, Universitas Teknokrat Indonesia W: https://ejurnal.teknokrat.ac.id/index.php/telefortech/index E : telefortech@teknokrat.ac.id. Jl. Zainal Abidin Pagaralam, No.9-11, Labuhan Ratu, Bandarlampung |
Jurnal Telematics and Information Technology (TELEFORTECH) is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Support By :
![]() | ![]() | ![]() |
![]() | ![]() |
|
|