Improved Algorithm of Multiple Minimum Support Association Rules Based on Can Tree

2021 ◽  
pp. 206-213
Author(s):  
Xiao Zhao ◽  
Shi Yong Ning
Keyword(s):  
Association Rules ◽  
Minimum Support ◽  
Improved Algorithm

Improved Apriori Algorithm in the Power System Fault

2014 ◽  
Vol 556-562 ◽  
pp. 1510-1514
Author(s):  
Li Qiang Lin ◽  
Hong Wen Yan
Keyword(s):  
Power System ◽  
Association Rules ◽  
Fault Analysis ◽  
The Other ◽  
Apriori Algorithm ◽  
Extreme Climate ◽  
Time Space ◽  
Low Efficiency ◽  
Candidate Item ◽  
Improved Algorithm

For the low efficiency in generating candidate item sets of apriori algorithm, this paper presents a method based on property division to improve generating candidate item sets. Comparing the improved apriori algorithm with the other algorithm and the improved algorithm is applied to the power system accident cases in extreme climate. The experiment results show that the improved algorithm significantly improves the time efficiency of generating candidate item sets. And it can find the association rules among time, space, disasters and fault facilities in the power system accident cases in extreme climate. That is very useful in power system fault analysis.

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.

A Novel and Improved Apriori Algorithm

2014 ◽  
Vol 721 ◽  
pp. 543-546 ◽  
Author(s):  
Dong Juan Gu ◽  
Lei Xia
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Inner Product ◽  
Apriori Algorithm ◽  
Product Operation ◽  
Classical Algorithm ◽  
Transaction Database ◽  
The Given ◽  
To Receive ◽  
Improved Algorithm

Apriori algorithm is the classical algorithm in data mining association rules. Because the Apriori algorithm needs scan database for many times, it runs too slowly. In order to improve the running efficiency, this paper improves the Apriori algorithm based on the Apriori analysis. The improved idea is that it transforms the transaction database into corresponding 0-1 matrix. Whose each vector and subsequent vector does inner product operation to receive support. And comparing with the given minsupport, the rows and columns will be deleted if vector are less than the minsupport, so as to reduce the size of the rating matrix, improve the running speeding. Because the improved algorithm only needs to scan the database once when running, therefore the running speeding is more quickly. The experiment also shows that this improved algorithm is efficient and feasible.

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.

Application of Association Rules Based on CF Gene in Intrusion Detection

2014 ◽  
Vol 556-562 ◽  
pp. 2603-2606
Author(s):  
Rong Fu ◽  
Li Yan Liu ◽  
Ying Qian Zhang ◽  
Yi He
Keyword(s):  
Intrusion Detection ◽  
Association Rules ◽  
Association Rule ◽  
Detection Technology ◽  
Mining Association Rule ◽  
Improved Algorithm

By analyzing and studying the most current algorithms about mining association rule, the rules evaluated by minimum confidence could not ensure the validity of the rules and will generate unrelated rules which will affect the intrusion detection work. This paper proposes CF measure based on the previous work and applies the association rule algorithm based on CF to intrusion detection technology to detect the intrusion behaviors in the network. Finally, experiments show that improved algorithm is more efficient.

A Study of Association Rules Mining Algorithms Based on Adaptive Support

2010 ◽  
Vol 108-111 ◽  
pp. 436-440
Author(s):  
Yue Shun He ◽  
Ping Du
Keyword(s):  
Association Rules ◽  
Efficient Method ◽  
User Needs ◽  
Association Rules Mining ◽  
Minimum Support ◽  
The Core ◽  
Minimum Number ◽  
Adaptive Support ◽  
Mining Algorithms ◽  
Specific Number

This paper presents an adaptive support for Boolean algorithm for mining association rules, the Algorithm does not require minimum support from outside, in the mining process of the algorithm will be based on user needs the minimum number of rules automatically adjust the scope of support to produce the specific number of rules, the algorithm number of rules for the user needs to generate the rules to a certain extent, reduce excavation time, avoid the artificial blindness specified minimum support. In addition, the core of the algorithm is using an efficient method of Boolean-type mining, using the logical OR, AND, and XOR operations to generate association rules, to avoided the candidate itemsets generated In the mining process, and only need to scan the database once, so the algorithm has a certain efficiency.

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

Sign in / Sign up

Export Citation Format

Share Document