Claim Missing Document
Check
Articles

Found 3 Documents
Search

Determination of Film Recommendations using the Generalized Sequence Pattern (GSP) Association Method Acep Razif Andriyan; Dinda Meysya Rochma; Melani Nur Mudyawati; Miftahul Jannah; Siti Lufia Dwi Agustini; Arham Aulia Nugraha
Gunung Djati Conference Series Vol. 3 (2021): Mini Seminar Kelas Data Mining 2020
Publisher : UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (207.618 KB)

Abstract

Along with the development of the times, films are used as a medium of communication and as a medium of entertainment that can be watched by fans everywhere. The high level of film enthusiasts makes viewing patterns that can be used as recommendation data. Besides, this system can provide benefits to the company concerned. This study used the Generalized Sequential Pattern (GSP) Algorithm with the Association Mining method. The primary function is to find the sequence or sequential of a set of attributes that often appear together to see the results to find out the recommendation data information after the previous film runs out.
Implementation of the Prefixspan Algorithm for Recommended Cinema Showings Adellia Rahmasari; Dimas Adi Putra Pratama; Nisvy Sya`'bana Nugraha; Risnandy Maulana; Dinda Meysya Rochma
Gunung Djati Conference Series Vol. 3 (2021): Mini Seminar Kelas Data Mining 2020
Publisher : UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (233.936 KB)

Abstract

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.
Fuzzy C-Means Algorithm for Clusterization of Credit Card Usage Miftahul Jannah; Melani Nur Mudyawati; Acep Razif Andriyan; Dinda Meysya Rochma; Siti Lufia Dwi Agustini
Gunung Djati Conference Series Vol. 3 (2021): Mini Seminar Kelas Data Mining 2020
Publisher : UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (628.965 KB)

Abstract

Credit cards are now familiar to the public. A credit card is a means of payment in lieu of cash in the form of a card issued by the bank to facilitate transactions for customers. Currently, there are various kinds of credit card issuing financial service companies in the world, including Indonesia. With various benefits so that credit is loved by all groups, so that everyone competes to use credit by choosing the desired bank. Data mining methods can provide solutions to extract knowledge from data by looking for certain patterns or rules from large amounts of data. One of the data mining methods is clustering, in which clustering is used to group data by grouping the data into several clusters. By using the credit card data set is divided into 3 clusters using the Fuzzy C-Means algorithm. Of the 3 clusters, the ones that are prioritized with the largest value are the clusters that are widely used by many people, which have a medium value, while the cluster with the smallest value is the cluster with the least interest.