scholarly journals Implementasi Algoritma FG-Growth untuk Sistem Rekomendasi Penjualan Produk

2021 ◽  
Vol 5 (1) ◽  
pp. 41
Author(s):  
Siti Yuliyanti

The variety of stationery marketed, makes business competition increasingly fierce in order to provide the best service to customers. Abundant sales transaction data, triggering piles of data so that it requires data mining processing techniques, namely association rule mining using the FP-Growth algorithm. Algorithm that generates frequent itemset used in the process of determining the rules that can produce an option by taking a product sales transaction data object. The test results show a rule that has the best confidence value and lift ratio of 100%, as well as 80% support with the rules that every purchase of a ballpoint product can be sure to buy a notebook from the dataset used as a sample data in the system trial (50 names). goods and 7 transaction data) with minimum support (5% = 0.05) and minimum confidence (30% = 0.3).

2019 ◽  
Vol 4 (2) ◽  
pp. 83-88
Author(s):  
Ridwan Rismanto ◽  
Lucki Darmawan ◽  
Arief Prasetyo

Progress in Information Technology encourages culinary businesses to innovate, one of them is a computerized system, online-based sales and several interesting features that can increase consumer interest and increase sales to be the most frequently used innovation today. The cafe "Hidden Toast and Float" is a cafe in the City of Kediri. To increase sales from the cafe, a system is needed to facilitate the owner in recording sales and increasing the number of sales by providing automatic menu recommendations to customers. Based on the problem, in this thesis a website-based sales system and sales system will be created that is accompanied by the application of a priori algorithm to determine the purchasing patterns of customers and automatic menu recommendations from the system for customers. The test results of this thesis are two website-based systems with admin systems used to process existing data on the database and customer websites that are used for online purchases, as well as the application of a priori algorithms with the results of testing sample data and real data that produce menu combination recommendations. most often purchased based on all transaction data, namely Dark Choco Jam and Cappucino with a support value of 15% and a confidence value of 45%.


2008 ◽  
pp. 2993-3004
Author(s):  
George Tzanis ◽  
Christos Berberidis

Association rule mining is a popular task that involves the discovery of co-occurences of items in transaction databases. Several extensions of the traditional association rule mining model have been proposed so far; however, the problem of mining for mutually exclusive items has not been directly tackled yet. Such information could be useful in various cases (e.g., when the expression of a gene excludes the expression of another), or it can be used as a serious hint in order to reveal inherent taxonomical information. In this article, we address the problem of mining pairs of items, such that the presence of one excludes the other. First, we provide a concise review of the literature, then we define this problem, we propose a probability-based evaluation metric, and finally a mining algorithm that we test on transaction data.


2021 ◽  
Vol 11 (1) ◽  
pp. 18-37
Author(s):  
Mehmet Bicer ◽  
Daniel Indictor ◽  
Ryan Yang ◽  
Xiaowen Zhang

Association rule mining is a common technique used in discovering interesting frequent patterns in data acquired in various application domains. The search space combinatorically explodes as the size of the data increases. Furthermore, the introduction of new data can invalidate old frequent patterns and introduce new ones. Hence, while finding the association rules efficiently is an important problem, maintaining and updating them is also crucial. Several algorithms have been introduced to find the association rules efficiently. One of them is Apriori. There are also algorithms written to update or maintain the existing association rules. Update with early pruning (UWEP) is one such algorithm. In this paper, the authors propose that in certain conditions it is preferable to use an incremental algorithm as opposed to the classic Apriori algorithm. They also propose new implementation techniques and improvements to the original UWEP paper in an algorithm we call UWEP2. These include the use of memorization and lazy evaluation to reduce scans of the dataset.


2021 ◽  
Author(s):  
Erna Hikmawati ◽  
Nur Ulfa Maulidevi ◽  
Kridanto Surendro

Abstract The process of extracting data to obtain useful information is known as data mining. Furthermore, one of the promising and widely used techniques for this extraction process is association rule mining. This technique is used to identify interesting relationships between sets of items in a dataset and predict associative behavior for new data. The first step in association rule mining is the determination of the frequent item set that will be involved in the rule formation process. In this step, a threshold is used to eliminate items excluded in the frequent itemset which is also known as the minimum support. Furthermore, the threshold provides an important role in determining the number of rules generated. However, setting the wrong threshold leads to the failure of the association rule mining to obtain rules. Currently, the minimum support value is determined by the user. This leads to a challenge that becomes worse for a user that is ignorant of the dataset characteristics. In this study, a method was proposed to determine the minimum support value based on the characteristics of the dataset. Furthermore, this required certain criteria to be used as thresholds which led to more adaptive rules according to the needs of the user. The results of this study showed that 6 from 8 datasets, obtained a rule with lift ratio > 1 using the minimum threshold value that was determined through this method.


2016 ◽  
Vol 2 (1) ◽  
Author(s):  
Fitriyani Fitriyani

Abstract - The set of data can be processed into information or useful knowledge, one of the data that can be processed is data purchases by consumers. However, large data processing will take a long time in the process. So that these data require appropriate methods in the process. The method is often used in data processing transactions are Apriori, but a great deal less precise data using Apriori because in the process repeatedly scanning the database (candidate set generation). In this study using the FP-Growth method for determining frequent itemset with structure of FP-Tree and Association Rule to determine support and confidence in the transaction data so that the results can be known relationships between an item with other items that are frequently purchased by consumers. Keywords : Apriori, FP-Growth, Association Rule, Transaction, Frequent Itemset. Abstrak - Himpunan data yang besar dapat diolah menjadi informasi atau pengetahuan yang bermanfaat, salah satu data yang dapat diolah adalah data transaksi pembelian barang oleh konsumen. Akan tetapi pemrosesan data yang besar akan membutuhkan waktu yang lama dalam prosesnya. Sehingga data tersebut membutuhkan metode yang tepat dalam proses pengolahannya. Metode yang sering digunakan dalam pengolahan data transaksi adalah Apriori, akan tetapi data yang besar kurang tepat menggunakan Apriori karena dalam prosesnya melakukan scanning berulang kali pada database (candidate set generation). Dalam penelitian ini menggunakan metode FP-Growth untuk menentukan frequent itemset dengan struktur FP-Tree dan Association Rule untuk menentukan support dan confidence pada data transaksi sehingga hasilnya dapat diketahui hubungan-hubungan antara suatu barang dengan barang lainnya yang sering dibeli oleh konsumen. Kata Kunci : Apriori, FP-Growth, Association Rule, Transaction, Frequent Itemset.


2022 ◽  
Vol 1 ◽  
Author(s):  
Agostinetto Giulia ◽  
Sandionigi Anna ◽  
Bruno Antonia ◽  
Pescini Dario ◽  
Casiraghi Maurizio

Boosted by the exponential growth of microbiome-based studies, analyzing microbiome patterns is now a hot-topic, finding different fields of application. In particular, the use of machine learning techniques is increasing in microbiome studies, providing deep insights into microbial community composition. In this context, in order to investigate microbial patterns from 16S rRNA metabarcoding data, we explored the effectiveness of Association Rule Mining (ARM) technique, a supervised-machine learning procedure, to extract patterns (in this work, intended as groups of species or taxa) from microbiome data. ARM can generate huge amounts of data, making spurious information removal and visualizing results challenging. Our work sheds light on the strengths and weaknesses of pattern mining strategy into the study of microbial patterns, in particular from 16S rRNA microbiome datasets, applying ARM on real case studies and providing guidelines for future usage. Our results highlighted issues related to the type of input and the use of metadata in microbial pattern extraction, identifying the key steps that must be considered to apply ARM consciously on 16S rRNA microbiome data. To promote the use of ARM and the visualization of microbiome patterns, specifically, we developed microFIM (microbial Frequent Itemset Mining), a versatile Python tool that facilitates the use of ARM integrating common microbiome outputs, such as taxa tables. microFIM implements interest measures to remove spurious information and merges the results of ARM analysis with the common microbiome outputs, providing similar microbiome strategies that help scientists to integrate ARM in microbiome applications. With this work, we aimed at creating a bridge between microbial ecology researchers and ARM technique, making researchers aware about the strength and weaknesses of association rule mining approach.


2019 ◽  
Vol 8 (S2) ◽  
pp. 9-12
Author(s):  
R. Smeeta Mary ◽  
K. Perumal

In data mining finding out the frequent itemsets is one of the very essential topics. Data mining helps in identifying the best knowledge for different decision makers. Frequent itemset generation is the precondition and most time-consuming method for association rule mining. In this paper we suggest a new algorithm for frequent itemset detection that works with datasets in distributed manner. The proposed algorithm brings in a new method to find frequent itemset not including the necessitate to create candidate itemsets. The proposed approach could be implemented using horizontal representation for transaction datasets and allocating prime value. It explores all the frequent itemset that is present in the input and according to the support the maximum frequent itemset is identified. It was applied on different transactions database and compared with well-known algorithms: FP-Growth and Parallel Apriori with different support levels. The try out showed that the proposed algorithm attain major time improvement over both algorithms.


ARM is a significant area of knowledge mining which enables association rules which are essential for decision making. Frequent itemset mining has a challenge against large datasets. As going on the dataset size increases the burden and time to discover rules will increase. In this paper the ARM algorithms with tree structures like FP-tree, FIN with POC tree and PPC tree are discussed for reducing overheads and time consuming. These algorithms use highly competent data structures for mining frequent itemsets from the database. FIN uses nodeset a unique and novel data structure to extract frequent itemsets and POC tree to store frequent itemset information. These techniques are extremely helpful in the marketing fields. The proposed and implemented techniques reveal that they have improved about performance by means of time and efficiency


2017 ◽  
Vol 1 (1) ◽  
pp. 20 ◽  
Author(s):  
Fachrul Kurniawan ◽  
Binti Umayah ◽  
Jihad Hammad ◽  
Supeno Mardi Susiki Nugroho ◽  
Mochammad Hariadi

Transaction data is a set of recording data result in connections with sales-purchase activities at a particular company. In these recent years, transaction data have been prevalently used as research objects in means of discovering new information. One of the possible attempts is to design an application that can be used to analyze the existing transaction data. That application has the quality of market basket analysis. In addition, the application is designed to be desktop-based whose components are able to process as well as re-log the existing transaction data. The used method in designing this application is by way of following the existing steps on data mining technique. The trial result showed that the development and the implementation of market basket analysis application through association rule method using apriori algorithm could work well. With the means of confidence value of 46.69% and support value of 1.78%, and the amount of the generated rule was 30 rules.


2019 ◽  
Vol 7 (2) ◽  
pp. 143-152
Author(s):  
Lusa Indah Prahartiwi ◽  
Wulan Dari

Abstract   Over decades, retail chains and department stores have been selling their products without using the transactional data generated by their sales as a source of knowledge. Abundant data availability, the need for information (or knowledge) as a support for decision making to create business solutions, and infrastructure support in the field of information technology are the embryos of the birth of data mining technology. Association rule mining is a data mining method used to extract useful patterns between data items. In this research, the Apriori algorithm was applied to find frequent itemset in association rule mining. Data processing using Tanagra tools. The dataset used was the Supermarket dataset consisting of 12 attributes and 108.131 transaction. The experimental results obtained by association rules or rules from the combination of item-sets beer wine spirit-frozen foods and snack foods as a Frequent itemset with a support value of 15.489% and a confidence value of 83.719%. Lift ratio value obtained was 2.47766 which means that there were some benefits from the association rule or rules.   Keywords: Apriori, Association Rule Mining.   Abstrak   Selama beberapa dekade rantai ritel dan department store telah menjual produk mereka tanpa menggunakan data transaksional yang dihasilkan oleh penjualan mereka sebagai sumber pengetahuan. Ketersediaan data yang melimpah, kebutuhan akan informasi (atau pengetahuan) sebagai pendukung pengambilan keputusan untuk membuat solusi bisnis, dan dukungan infrastruktur di bidang teknologi informasi merupakan cikal-bakal dari lahirnya teknologi data mining. Data mining menemukan pola yang menarik dari database seperti association rule, correlations, sequences, classifier dan masih banyak lagi yang mana association rule adalah salah satu masalah yang paling popular. Association rule mining merupakan metode data mining yang digunakan untuk mengekstrasi pola yang bermanfaat di antara data barang. Pada penelitian ini diterapkan algoritma Apriori untuk pencarian frequent itemset dalam association rule mining. Pengolahan data menggunakan tools Tanagra. Dataset yang digunakan adalah dataset Supermarket yang terdiri dari 12 atribut dan 108.131 transaksi. Hasil eksperimen diperoleh aturan asosiasi atau rules dari kombinasi itemsets beer wine spirit-frozen foods dan snack foods sebagai Frequent itemset dengan nilai support sebesar 15,489% dan nilai confidence sebesar 83,719%. Nilai Lift ratio yang diperoleh sebesar 2,47766 yang artinya terdapat manfaat dari aturan asosiasi atau rules tersebut.   Kata kunci: Apriori, Association rule mining  


Sign in / Sign up

Export Citation Format

Share Document