scholarly journals PENERAPAN ALGORITME FP-GROWTH UNTUK MENENTUKAN PELETAKAN BARANG PEDAGANG SAYUR

2021 ◽  
Vol 7 (4) ◽  
pp. 43-48
Author(s):  
Wahyu Alfafisabil ◽  
Budi Arif Dermawan ◽  
Tesa Nur Padilah
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Minimum Support

Sayuran merupakan sumber vitamin dan protein. Setiap ibu rumah tangga membutuhkan sayuran untuk memasak dalam kehidupan sehari-hari. Sayuran didapatkan di pasar sehingga akan mempersulit ibu rumah tangga yang rumahnya jauh dari pasar. Pedagang sayur keliling merupakan pedagang yang menjual berbagai macam sayuran yang dibawa ke rumah-rumah untuk memenuhi kebutuhan ibu rumah tangga. Pedagang sayur keliling bertujuan untuk mencari keuntungan, sehingga untuk memaksimalkan tingkat penjualan diperlukan strategi penjualan. Association rules adalah metode untuk mencari hubungan antar item pada suatu dataset. Data mining dapat disebut salah satu langkah dari proses KDD. FP-Growth merupakan algoritme untuk mencari himpunan data yang paling sering muncul. Penelitian ini menganalisis data transaksi untuk memprediksi peletakan barang dipedagang sayur dengan tujuan memaksimalkan tingkat penjualan menggunakan algoritme FP-Growth dan bahasa pemrograman python. Pada proses data mining dengan menggunakan algoritme FP-Growth peneliti menjelaskan langkah-langkah FP-Growth dengan perhitungan manual. Evaluasi peneliti melakukan pencocokan hasil perhitungan manual dengan program. Setelah perhitungan sesuai, peneliti menggunakan data tota transaksi untuk mengetahui rules-nya dengan syarat minimum support 0.01 atau 1% dan minimum confidence 0.9 atau 90%. Pada hasil terdapat 44 rules yang memenuhi syarat.

The Application of Apriori Algorithm in Analysis on Admitted Students of Colleges and Universities

2013 ◽  
Vol 321-324 ◽  
pp. 2578-2582
Author(s):  
Qian Zhang
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Colleges And Universities ◽  
Apriori Algorithm ◽  
Data Mining Techniques ◽  
Minimum Support ◽  
Sample Data ◽  
Mining Association Rules

This paper examined the application of Apriori algorithm in extracting association rules in data mining by sample data on student enrollments. It studied the data mining techniques for extraction of association rules, analyzed the correlation between specialties and characteristics of admitted students, and evaluated the algorithm for mining association rules, in which the minimum support was 30% and the minimum confidence was 40%.

Research and Simulation of Data Mining Method Based on the Association Rules Algorithm

2014 ◽  
Vol 651-653 ◽  
pp. 2185-2188
Author(s):  
Jin Ping Zou ◽  
Xiao Dong Xie
Keyword(s):  
Data Mining ◽  
Data Storage ◽  
Association Rules ◽  
Experimental Results ◽  
Mining Method ◽  
Accurate Data ◽  
Minimum Support ◽  
Data Mining Method

the accurate data mining problem is studied in this paper. With the increasing of data attributes, degree of complexity of the data storage is also increased, resulting in that in data mining process, the complexity of computation is too high, reducing the convergence of the data mining method, thereby reducing the efficiency of data mining. To this end, this paper presents a data mining method based on association rules algorithm. The data is made simplified processing, to obtain the association rules between data which provides the basis for data mining. According to the association rules between the data, the data in line with the minimum support degree is calculated, to achieve accurate data mining. Experimental results show that the proposed algorithm for data mining, can improve mining efficiency, and achieve the desired results.

scholarly journals Implementasi Data Mining Menggunakan Algoritma Apriori Pada Penjualan Suku Cadang Motor

2021 ◽  
Vol 14 (2) ◽  
pp. 125
Author(s):  
Ainul Mardiaha ◽  
Yulia Yulia
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
A Priori ◽  
Spare Parts ◽  
Frequent Itemset ◽  
Sales Data ◽  
Minimum Support ◽  
Relationship Of

This research was carried out to simplify or assist Candra Motor workshop owners in managing data and archives of motorcycle parts sales by applying a data mining a priori algorithm method. Data mining is an operation that uses a particular technique or method to look for different patterns or shapes in a selected data. Sales data for a year with the number of 15 items selected using the priori algorithm method. A priori algorithm is an algorithm for taking data with associative rules (association rule) to determine the associative relationship of an item combination. In a priori algorithm, it is determined frequent itemset-1, frequent itemset-2, and frequent itemset-3 so that the association rules can be obtained from previously selected data. To obtain the frequent itemset, each selected data must meet the minimum support and minimum confidence requirements. In this study using minimum support ? 7 or 0.583 and minimum confidence of 90%. So that some rules of association were obtained, where the calculation of the search for association rules manually and using WEKA software obtained the same results.By fulfilling the minimum support and minimum confidence requirements, the most sold spare parts are inner tube, Yamaha oil and MPX oil.

scholarly journals Penerapan Metode Data Mining Pada Point of Sale Berbasis Web Menggunakan Algoritma Apriori

2021 ◽  
Vol 5 (3) ◽  
pp. 1158
Author(s):  
Adam Firmansyah ◽  
M Iwan Wahyudin ◽  
Ben Rahman
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
A Priori ◽  
Point Of Sale ◽  
Minimum Support ◽  
Confidence Value

To be able to understand which products have been purchased by customers, it is done by describing the habits when customers buy. Use association rules to detect items purchased at the same time. This study uses an a priori algorithm to determine the association rules when buying goods. The results of the study and analyzing the data obtained a statement that using the a priori algorithm to select the combined itemset using a minimum support of 25% and a minimum confidence of 100%, found the association rule, namely, if the customer buys at the same time. Buying goods has the highest value of support and trust. Likewise with the support value of 25%, the confidence value is 100%. In this way, if a customer buys an item, the probability that the customer buys the item is 100%

scholarly journals MARKET BASKET ANALYSIS USING THE FP-GROWTH ALGORITHM TO DETERMINE CROSS-SELLING

2021 ◽  
Vol 7 (4) ◽  
pp. 49-54
Author(s):  
Fildzah Zia Ghassani ◽  
Asep Jamaludin ◽  
Agung Susilo Yuda Irawan
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Basic Needs ◽  
Market Basket Analysis ◽  
Rice Cake ◽  
Market Basket ◽  
Transaction Data ◽  
Minimum Support ◽  
A Value ◽  
Association Method

KAOCHEM Sinergi Mandiri Cooperative is a cooperative that provides various kinds of basic needs such as basic foodstuffs that can meet the needs of its members. The cooperative transaction data is only stored as a report. Association rules are a method in data mining that functions to identify items that have a value that is likely to appear simultaneously with other items. One implementation of the association method is Market Basket Analysis. The data used are transaction data for November 2019. Data mining is one of the processes or stages of the KDD method. The data mining process is carried out using the FP-Growth algorithm, which is one of the algorithms for calculating the sets that often appear from data. Researchers analyzed transaction data using the Rapid Miner Studio tools. In the data mining process using FP-Growth the researcher determines a minimum support value of 3% and a minimum confidence of 50%. The association process using these values ​​produces 3 strong rules, namely if ades 350 ml, then fried / lontong with a support value of 0.030 and confidence 0.556 and if fried st, then fried / lontong with a support value of 0.048 and confidence 0.639, and if nasi uduk / bacang , then fried / rice cake with a support value of 0.031 and confidence 0.824. The results of the association rules can be applied using one of the marketing techniques, namely cross-selling to increase the sales of the cooperative.

scholarly journals IMPLEMENTASI METODE MARKET BASKET ANALYSIS (MBA) MENGGUNAKAN ALGORITMA APRIORI DALAM TRANSAKSI PENJUALAN (STUDI KASUS: KAFE RUANG TEMU)

2020 ◽  
Vol 10 (2) ◽  
pp. 138
Author(s):  
Muhammad SyahruRomadhon ◽  
Achmad Kodar
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Apriori Algorithm ◽  
Market Basket Analysis ◽  
Tourist Attractions ◽  
Market Basket ◽  
Transaction Data ◽  
Data Mining Techniques ◽  
Minimum Support

Jakarta is one of the culinary attractions, many tourist attractions every year become creative in business. One of them is a cafe. Cafe Ruang Temu has sales transaction data but is not used to see associations between one product and another. In this case there needs to be a system for finding menu combinations by processing sales transactions. One of the data mining techniques is association rule or Market Basket Analysis (MBA) with apriori algorithm. Apriori algorithm aims to produce association rules to form menu combinations. The sales dataset for January 2019 to July 2019 is determined by the minimum support and minimum confidence values that have been set.  

scholarly journals Algoritma Apriori Untuk Penentuan Assosiasi Penjualan Barang

2021 ◽  
Vol 9 (1) ◽  
pp. 7
Author(s):  
Calvin Ivan Wiryawan ◽  
Yustina Retno Wahyu Utami ◽  
Didik Nugroho
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
A Priori ◽  
Basic Needs ◽  
Marketing Strategies ◽  
Apriori Algorithm ◽  
Growing Up ◽  
Minimum Support ◽  
Data Mining Algorithms ◽  
Mining Algorithms

The increasing of selling basic needs make the company has to provide a lot of goods. The data will be growing up with increasing the transaction at Sari Bumi store. All this time, the selling basic needs at Sari Bumi Store unstructured well so that needed an application with produce important information that can decide marketing strategies. In this research, Apriori algorithm is used to determine association rules. This method was chosen because it is one of the classic data mining algorithms to look for patterns of relationships between one or more items in one dataset. A priori algorithms can help companies in developing marketing strategies. The result of this research is combination between 4 item set with a minimum support of 30% and minimum confidence of 60%.Keywords: sale, staple, apriori algorithm

Data Mining Association Rules for Making Knowledgeable Decisions

2009 ◽  
pp. 43-53
Author(s):  
A.V. Senthil Kumar ◽  
R. S.D. Wahidabanu
Keyword(s):  
Data Mining ◽  
Directed Graph ◽  
Association Rules ◽  
Relational Databases ◽  
Minimum Support ◽  
Transaction Database ◽  
Mining Association Rules ◽  
The Cost ◽  
Hashing Algorithm ◽  
Dynamic Hashing

This chapter describes two techniques used to explore frequent large itemsets in the database. In the first technique called “closed directed graph approach,” the algorithm scans the database once making a count on possible 2-itemsets from which only the 2-itemsets with a minimum support are used to form the closed directed graph which explores possible frequent large itemsets in the database. In the second technique, dynamic hashing algorithm, large 3-itemsets are generated at an earlier stage which reduces the size of the transaction database after trimming and the cost of later iterations will be less. Furthermore the authors hope that these techniques help researchers not only to understand about generating frequent large itemsets, but also assist with the understanding of finding association rules among transactions within relational databases.

Analisa Algoritma Apriori Untuk Peminjaman Buku Pada Perpustakaan SMA 1 Silima Pungga-Pungga Parongil

2019 ◽  
Vol 4 (1) ◽  
pp. 154-160
Author(s):  
Oktaviani Manurung ◽  
Penda Sudarto Hasugian
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
High Frequency ◽  
A Priori ◽  
Apriori Algorithm ◽  
Minimum Support ◽  
Minimum Requirements ◽  
To Come

ABSTRACT The library has the role of helping students to love reading books. The availability of books in various fields motivates students to come to visit the library, students can read or borrow library books. For this reason, library officers apply the rules for visiting the library. The Apriori algorithm is a part of data mining, namely the search for high frequency patterns such as activities that often appear simultaneously. The pattern that will be analyzed is the pattern of borrowing any books that are often borrowed so that librarians know the information of books that are often borrowed. With the application of a priori algorithms, book data is processed to produce a book borrowing pattern. After all the high frequency patterns were found, then association rules were found that met the minimum requirements for associative confidence A → B minimum confidence = 25%. Rules for sequential final association based on minimum support and minimum confidence, if borrowing an IPA, then borrowing MTK Support = 15%, Confidence = 42.8%. Keywords:Patterns of borrow of books, Library, Apriori Algorithms

Finding Non-Coincidental Sporadic Rules Using Apriori-Inverse

2008 ◽  
pp. 3222-3234
Author(s):  
Yun Sing Koh ◽  
Nathan Rountree ◽  
Richard O’Keefe
Keyword(s):  
Data Mining ◽  
Rare Disease ◽  
Association Rules ◽  
Frequent Itemsets ◽  
New Method ◽  
Apriori Algorithm ◽  
High Confidence ◽  
Minimum Support ◽  
Rare Association ◽  
Support Threshold

Discovering association rules efficiently is an important data mining problem. We define sporadic rules as those with low support but high confidence; for example, a rare association of two symptoms indicating a rare disease. To find such rules using the well-known Apriori algorithm, minimum support has to be set very low, producing a large number of trivial frequent itemsets. To alleviate this problem, we propose a new method of discovering sporadic rules without having to produce all other rules above the minimum support threshold. The new method, called Apriori-Inverse, is a variation of the Apriori algorithm that uses the notion of maximum support instead of minimum support to generate candidate itemsets. Candidate itemsets of interest to us fall below a maximum support value but above a minimum absolute support value. Rules above maximum support are considered frequent rules, which are of no interest to us, whereas rules that occur by chance fall below the minimum absolute support value. We define two classes of sporadic rule: perfectly sporadic rules (those that consist only of items falling below maximum support) and imperfectly sporadic rules (those that may contain items over the maximum support threshold). This article is an expanded version of Koh and Rountree (2005).

Sign in / Sign up

Export Citation Format

Share Document