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%.

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 Implementasi Algoritma Apriori Pada Penyusunan Menu Makanan Rumah Makan Prasmanan

2020 ◽  
Vol 6 (2) ◽  
Author(s):  
Asep Budiman Kusdinar ◽  
Daris Riyadi ◽  
Asriyanik Asriyanik
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
High Frequency ◽  
A Priori ◽  
Apriori Algorithm ◽  
Frequency Pattern ◽  
Data Mining Techniques ◽  
Rule Method

A buffet restaurant is a restaurant that provides buffet food that is served directly at the dining table so that customers can order more food according to their needs. This study uses the association rule method which is one of the methods of data mining and a priori algorithms. Data mining is the process of discovering patterns or rules in data, in which the process must be automatic or semi-automatic. Association rules are one of the techniques of data mining that is used to look for relationships between items in a dataset. While  the apriori algorithm is a very well-known algorithm for finding high-frequency patterns, this a priori algorithm is a type of association rule in data mining. High- frequency patterns are patterns of items in the database that have frequencies or support. This high-frequency pattern is used to develop rules and also some other data mining techniques. The composition of the food menu in the Asgar restaurant is now arranged randomly without being prepared on the food menu between one another. The result of this research is  to support the composition of the food menu at the Asgar restaurant so that it is easier to take food menu with one another.  

Mining Association Rules from Fuzzy DataCubes

2010 ◽  
pp. 84-129
Author(s):  
Nicolás Marín ◽  
Carlos Molina ◽  
Daniel Sánchez ◽  
M. Amparo Vila
Keyword(s):  
Data Mining ◽  
Fuzzy Logic ◽  
Association Rules ◽  
Online Analytical Processing ◽  
Data Sources ◽  
Data Mining Techniques ◽  
Rule Sets ◽  
Analytical Processing ◽  
Mining Association Rules ◽  
Different Sources

The use of online analytical processing (OLAP) systems as data sources for data mining techniques has been widely studied and has resulted in what is known as online analytical mining (OLAM). As a result of both the use of OLAP technology in new fields of knowledge and the merging of data from different sources, it has become necessary for models to support imprecision. We, therefore, need OLAM methods which are able to deal with this imprecision. Association rules are one of the most used data mining techniques. There are several proposals that enable the extraction of association rules on DataCubes but few of these deal with imprecision in the process and give as result complex rule sets. In this chapter the authors will present a method that manages the imprecision and reduces the complexity. They will study the influence of the use of fuzzy logic using different size problems and comparing the results with a crisp approach.

Research on Data Mining Based on Apriori Algorithm

2012 ◽  
Vol 532-533 ◽  
pp. 1675-1679
Author(s):  
Pei Ji Wang ◽  
Yu Lin Zhao
Keyword(s):  
Data Mining ◽  
Data Collection ◽  
Association Rules ◽  
Frequent Itemsets ◽  
Scientific Data ◽  
Apriori Algorithm ◽  
Data Table ◽  
Large Databases ◽  
Mining Association Rules ◽  
Mining Frequent Itemsets

With the availability of inexpensive storage and the progress in data collection tools, many organizations have created large databases of business and scientific data, which create an imminent need and great opportunities for mining interesting knowledge from data.Mining association rules is an important topic in the data mining research. In the paper, research mining frequent itemsets algorithm based on recognizable matrix and mining association rules algorithm based on improved measure system, the above method is used to mine association rules to the students’ data table under Visual FoxPro 6.0.

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

scholarly journals The Use of Apriori Algorithm in the Formation of Association Rule at Lotteria Cibubur

SinkrOn ◽  
2020 ◽  
Vol 4 (2) ◽  
pp. 76
Author(s):  
Ovi Liansyah ◽  
Henny Destiana
Keyword(s):  
Data Mining ◽  
Data Storage ◽  
Association Rules ◽  
Association Rule ◽  
Apriori Algorithm ◽  
Transaction Data ◽  
Data Mining Techniques ◽  
Sales Data ◽  
Sales Strategy ◽  
Data Mining Application

Lotteria as one of the franchises that produce sales data every day, has not been able to maximize the utilization of that data. The sale data storage is still not optimal. By utilizing sales transaction data that have been stored in the database, the management can find out the menus purchased simultaneously, using the association rule. Namely, data mining techniques to find the association rules of a combination of items. The process of searching for associations uses the help of apriori algorithms to produce patterns of the combination of items and rules as important knowledge and information from sales transaction data. By using the minimum support parameters, the minimum and the month period of the sales transaction to find the association rules, the data mining application generates association rules between items in April 2019, where consumers who buy hot / ice coffee will then buy float together with support of 16% and 100% confidence. Knowing which menu products or items are the most sold, thus lotteria Cibubur can develop a sales strategy to sell other types of menu products by examining the advantages of the most sold menu with other menus and can increase the stock of menu ingredients.

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