Implementation of the Prefixspan Algorithm for Recommended Cinema Showings
Bilah Samping Artikel
Isi Artikel Utama
Abstrak
Along with technological developments that cause the amount of information available is also getting closer, at this time there are approximately 16.3 ZB data or the equivalent of one trillion GB. The purpose of this research is to see how the application of the Prefixspan algorithm for Sequential Pattern Mining (a method for obtaining an ordered pattern). The data used is Movie Meta Data in which there are several columns including genre, director, film etc. With this data, we purpose viewers to present recommendation films to be shown in theaters based on audience enthusiasm from the processed data.
Unduhan
Rincian Artikel
Artikel ini berlisensi Creative Commons Attribution 4.0 International License.
Referensi
M. F. Zamroni and A. Wibisono, “Analisis Frekuensi Kemunculan Fase Dalam Sales Process Pada Penjualan Perlengkapan Masak Berbasis Mobile Chat (Studi Kasus: Forbento.Com),†J. Tek. ITS, vol. 6, no. 2, 2017, doi: 10.12962/j23373539.v6i2.23178.
P. N. Sabrina, “Penerapan Sequential Pattern Mining pada Data Pemesanan untuk Strategi Penawaran dan Pemasaran Produk Dengan Pendekatan Metode PrefixSpan,†in Annual Research Seminar (ARS), 2017, vol. 2, no. 1, pp. 449–455.
M. N. Wulandari, “Penggalian Pola Sekuensial Interval Waktu Fuzzy Pada Pergerakan Harga Saham Di Indonesia Menggunakan Algoritma Fp-Growth-Prefixspan.†Institut Teknologi Sepuluh Nopember, 2016.
L. Lenny, “Rancang Bangun Fitur Rekomendasi Buku Menggunakan Algoritma PrefixSpan pada Sistem Peminjaman Buku Berbasis Web di Perpustakaan Universitas Ciputra,†J. Ilm. Teknol. Inf. dan Multimed., vol. 3, no. 1, pp. 1–16, 2017.
H. Jiawei, M. Kamber, J. Han, M. Kamber, and J. Pei, Data Mining: Concepts and Techniques. 2006.
D. S. Maylawati, H. Aulawi, and M. A. Ramdhani, “The concept of sequential pattern mining for text,†in IOP Conference Series: Materials Science and Engineering, 2018, doi: 10.1088/1757-899X/434/1/012042.
J. Pei et al., “Mining sequential patterns by pattern-growth: The prefixspan approach,†IEEE Trans. Knowl. Data Eng., vol. 16, no. 11, pp. 1424–1440, 2004, doi: 10.1109/TKDE.2004.77.