scholarly journals An improvement of FP-Growth association rule mining algorithm based on adjacency table

2018 ◽  
Vol 189 ◽  
pp. 10012 ◽  
Author(s):  
Ming Yin ◽  
Wenjie Wang ◽  
Yang Liu ◽  
Dan Jiang
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Hash Table ◽  
Frequent Itemsets ◽  
Frequent Pattern ◽  
Data Sets ◽  
Rule Mining ◽  
Mining Algorithm ◽  
Mining Frequent Itemsets ◽  
Improved Algorithm

FP-Growth algorithm is an association rule mining algorithm based on frequent pattern tree (FP-Tree), which doesn’t need to generate a large number of candidate sets. However, constructing FP-Tree requires two scansof the original transaction database and the recursive mining of FP-Tree to generate frequent itemsets. In addition, the algorithm can’t work effectively when the dataset is dense. To solve the problems of large memory usage and low time-effectiveness of data mining in this algorithm, this paper proposes an improved algorithm based on adjacency table using a hash table to store adjacency table, which considerably saves the finding time. The experimental results show that the improved algorithm has good performance especially for mining frequent itemsets in dense data sets.

The Research of Improved Apriori Algorithm

2012 ◽  
Vol 263-266 ◽  
pp. 2179-2184 ◽  
Author(s):  
Zhen Yun Liao ◽  
Xiu Fen Fu ◽  
Ya Guang Wang
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Apriori Algorithm ◽  
Rule Mining ◽  
Frequent Item ◽  
Mining Algorithm ◽  
The Times ◽  
Frequent Item Sets ◽  
Candidate Item ◽  
Improved Algorithm

The first step of the association rule mining algorithm Apriori generate a lot of candidate item sets which are not frequent item sets, and all of these item sets cost a lot of system spending. To solve this problem，this paper presents an improved algorithm based on Apriori algorithm to improve the Apriori pruning step. Using this method, the large number of useless candidate item sets can be reduced effectively and it can also reduce the times of judge whether the item sets are frequent item sets. Experimental results show that the improved algorithm has better efficiency than classic Apriori algorithm.

Research on Association Rule Mining Algorithm Based on Distributed Data

2014 ◽  
Vol 998-999 ◽  
pp. 899-902 ◽  
Author(s):  
Cheng Luo ◽  
Ying Chen
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
Large Scale ◽  
Frequent Itemsets ◽  
Network Communication ◽  
Data Mining Algorithm ◽  
Distributed Data ◽  
Rule Mining ◽  
Mining Algorithm

Existing data miming algorithms have mostly implemented data mining under centralized environment, but the large-scale database exists in the distributed form. According to the existing problem of the distributed data mining algorithm FDM and its improved algorithms, which exist the problem that the frequent itemsets are lost and network communication cost too much. This paper proposes a association rule mining algorithm based on distributed data (ARADD). The mapping marks the array mechanism is included in the ARADD algorithm, which can not only keep the integrity of the frequent itemsets, but also reduces the cost of network communication. The efficiency of algorithm is proved in the experiment.

The Novel Model of Construct Materials Science and Information Based on Association Rule Mining

2013 ◽  
Vol 327 ◽  
pp. 197-200
Author(s):  
Guo Fang Kuang ◽  
Ying Cun Cao
Keyword(s):  
Experimental Data ◽  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
Materials Science ◽  
Frequent Itemsets ◽  
Data Sets ◽  
The Novel ◽  
Rule Mining ◽  
Novel Model

The material is used by humans to manufacture the machines, components, devices and other products of substances. Association rules originated in the field of data mining, people use it to find large amounts of data between itemsets of the association. Apriori is a breadth-first algorithm to obtain the support is greater than the minimum support of frequent itemsets by repeatedly scanning the database. This paper presents the construction of materials science and information model based on association rule mining. Experimental data sets prove that the proposed algorithm is effective and reasonable.

Mining Frequent Itemsets Algorithm Based on Compression Matrix

2014 ◽  
Vol 556-562 ◽  
pp. 3501-3505
Author(s):  
Zi Zhi Lin ◽  
Si Hui Shu
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
Frequent Itemsets ◽  
Rule Mining ◽  
Spatial Complexity ◽  
Temporal Complexity ◽  
New Strategy ◽  
Mining Frequent Itemsets

Association rule mining is one of the most important and well researched techniques of data mining. The key procedure of the association rule mining is to find frequent itemsets. In this paper, a new mining frequent itemsets algorithm based on matrix is introduced. Frequent itemsets are obtained by compressing the transaction matrix efficiently by a new strategy. The new algorithm optimizes the known mining frequent itemsets algorithms based on matrix given by some researchers in recent years, which greatly reduces the temporal complexity and spatial complexity. It is more feasible especially when the degrees of the frequent itemsets are high.

Sign in / Sign up

Export Citation Format

Share Document