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

Closed-Itemset Incremental-Mining Problem

2011 ◽  
pp. 150-153
Author(s):  
Luminita Dumitriu
Keyword(s):  
Association Rules ◽  
Frequent Itemsets ◽  
Frequent Itemset ◽  
Incremental Mining ◽  
Minimum Support ◽  
Confidence Threshold ◽  
Support Threshold ◽  
Mining Association Rules

Association rules, introduced by Agrawal, Imielinski and Swami (1993), provide useful means to discover associations in data. The problem of mining association rules in a database is defined as finding all the association rules that hold with more than a user-given minimum support threshold and a user-given minimum confidence threshold. According to Agrawal, Imielinski and Swami, this problem is solved in two steps: 1. Find all frequent itemsets in the database. 2. For each frequent itemset I, generate all the association rules I’ÞI\I’, where I’ÌI.

E-MsNFIS: Efficient Negative Frequent Itemsets Mining Based on Multiple Minimum Supports

2013 ◽  
Vol 411-414 ◽  
pp. 386-389 ◽  
Author(s):  
Tian Tian Xu ◽  
Xiang Jun Dong
Keyword(s):  
Association Rules ◽  
Real Life ◽  
Frequent Itemsets ◽  
Negative Association ◽  
Experimental Results ◽  
New Method ◽  
Minimum Support ◽  
Frequent Itemsets Mining ◽  
Negative Association Rules ◽  
Multiple Minimum Supports

Negative frequent itemsets (NFIS) like (a1a2¬a3a4) have played important roles in real applications because we can mine valued negative association rules from them. In one of our previous work, we proposed a method, namede-NFISto mine NFIS from positive frequent itemsets (PFIS). However,e-NFISonly uses single minimum support, which implicitly assumes that all items in the database are of the same nature or of similar frequencies in the database. This is often not the case in real-life applications. So a lot of methods to mine frequent itemsets with multiple minimum supports have been proposed. These methods allow users to assign different minimum supports to different items. But these methods only mine PFIS, doesn’t consider negative ones. So in this paper, we propose a new method, namede-msNFIS, to mine NFIS from PFIS based on multiple minimum supports. E-msNFIScontains three steps: 1) using existing methods to mine PFIS with multiple minimum supports; 2) using the same method ine-NFISto generate NCIS from PFIS got in step 1; 3) calculating the support of these NCIS only using the support of PFIS and then gettingNFIS. Experimental results show that thee-msNFISis efficient.

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 Mining predicate rules without minimum support threshold

2021 ◽  
Vol 48 (4) ◽  
Author(s):  
Hafiz I. Ahmad ◽  
◽  
Alex T. H. Sim ◽  
Roliana Ibrahim ◽  
Mohammad Abrar ◽  
...  
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
State Of The Art ◽  
Predicate Logic ◽  
Frequent Itemsets ◽  
Rule Mining ◽  
Minimum Support ◽  
Support Threshold ◽  
Definition Of

Association rule mining (ARM) is used for discovering frequent itemsets for interesting relationships of associative and correlative behaviors within the data. This gives new insights of great value, both commercial and academic. The traditional ARM techniques discover interesting association rules based on a predefined minimum support threshold. However, there is no known standard of an exact definition of minimum support and providing an inappropriate minimum support value may result in missing important rules. In addition, most of the rules discovered by these traditional ARM techniques refer to already known knowledge. To address these limitations of the minimum support threshold in ARM techniques, this study proposes an algorithm to mine interesting association rules without minimum support using predicate logic and a property of a proposed interestingness measure (g measure). The algorithm scans the database and uses g measure’s property to search for interesting combinations. The selected combinations are mapped to pseudo-implications and inference rules of logic are used on the pseudo-implications to produce and validate the predicate rules. Experimental results of the proposed technique show better performance against state-of-the-art classification techniques, and reliable predicate rules are discovered based on the reliability differences of the presence and absence of the rule’s consequence.

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

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 Analisa Data Mining Terhadap Penjualan Food Dengan Metode Apriori Pada Kopsyahira

2020 ◽  
Vol 8 (1) ◽  
pp. 44-48
Author(s):  
Agung Riyanto ◽  
Melan Susanti
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Limiting Factor ◽  
Apriori Algorithm ◽  
Transaction Data ◽  
Minimum Support ◽  
To Come ◽  
Food Sales

Every company engaged in trade must have a strategy to improve service. Some of them regulate the arrangement of goods (display) or make the appearance of a store look attractive and make shopping easier so that consumers are willing to come back to shop. Many transactions every day but are still done manually. So there might be a lot of errors and inaccurate reports. The number of transactions is also only used as a document. It is not possible for many transaction data to be lost or tucked away. Collection of transaction data if left alone for months, then the data will only be meaningless data and will be a limiting factor in improving services. Purchases are often done simultaneously at one time, so there is a queue in the store. In Kopsyahira there were also several obstacles in terms of sales, especially food sales. In this study, researchers will use the Apriori algorithm, the author uses Tanagra's data mining software. The results of this study produce 2 final association rules if using a minimum support of 30% and Confidence of 66%.

scholarly journals Penerapan Data Mining Untuk Analisis Daftar Pembelian Konsumen Dengan Menggunakan Algoritma Apriori Pada Transaksi Penjualan Toko Bangunan MDN

2021 ◽  
Vol 2 (2) ◽  
pp. 89-101
Author(s):  
Edo Tachi Naldy ◽  
Andri Andri
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Building Material ◽  
Apriori Algorithm ◽  
Processing Methods ◽  
Data Reporting ◽  
Transaction Data ◽  
Minimum Support ◽  
Minimum Value

Everyday the MDN Building Shop has sales transactions but these transactions are only used as data reporting, MDN Building Stores do not manage sales transaction data and analyze a relationship between building material products purchased by consumers in the future. The purpose of this study is to process sales transaction data from consumer purchases by utilizing the Apriori Algorithm, one of the data mining processing methods. From the Apriori algorithm that will be used, it will find an association rule by finding the minimum value of support and confidence. The final result is that if the minimum support value is 50% and the minimum trust is 90%, then 10 patterns of consumer purchase transactions are obtained with 100% confidence. From the association rules, it was found that the transactions that occurred were the purchase of Knie In Grest, Tee in grest, gelam 10 x 12, thinner bottles, knie grest 3 in, waving aw pipes, speck gloves, 3 mm polywood, and 1 nail in a keris.

Sign in / Sign up

Export Citation Format

Share Document