The optimization of Apriori algorithm based on directed network

Authors:
Yan-hua Wang;Xia Feng
Affiliations:
School of Computer Science and Technology, Civil Aviation University of China, Tianjin, China;School of Computer Science and Technology, Civil Aviation University of China, Tianjin, China
Venue:
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
Year:
2009

Citing 6
Cited 0

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Data clustering: a review

ACM Computing Surveys (CSUR)
Data mining: concepts and techniques

Data mining: concepts and techniques
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A Parallel Apriori Algorithm for Frequent Itemsets Mining

SERA '06 Proceedings of the Fourth International Conference on Software Engineering Research, Management and Applications
Matlab Programming for Engineers

Matlab Programming for Engineers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Association rule mining is an important topic in data mining field. On the basis of the association rule mining and Apriori algorithm, this paper proposes an improved algorithm based on the directed network. It reduces consumption and improve the efficiency of algorithms by reduce scanning datasets and improving the efficiency of the pruning step. Finally, this paper gives an experiment to analyze and compare the difference between the two algorithms and the result shows that the improved algorithm promotes the efficiency of computing.