Paper Title:
Improved Apriori Algorithm Based on Compressing Transactional Matrix Multiplication
  Abstract

Apriori algorithm is one of the most classical algorithm in association rules, however, the algorithm is low efficiency, such as firstly it needs to repeatedly scan the database, which spends much in I/O. Secondly, it create a large number of 2- candidate itemsets during outputting frequent 2- itemsets. Thirdly, it doesn’t cancel the useless itemsets during outputting frequent k- itemsets. In the paper, it describes an improved algorithm based on the compressed matrices which improve the efficiency during creating frequent k- itemsets on three aspects, which simply scans the database once, after compressed transactional matrix, and by multiplied matrix get the frequent item sets, which effectively improved the efficiency in mining association rules.

  Info
Periodical
Key Engineering Materials (Volumes 460-461)
Edited by
Yanwen Wu
Pages
409-413
DOI
10.4028/www.scientific.net/KEM.460-461.409
Citation
Y. S. He, P. Du, "Improved Apriori Algorithm Based on Compressing Transactional Matrix Multiplication", Key Engineering Materials, Vols. 460-461, pp. 409-413, 2011
Online since
January 2011
Authors
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Lu Na Byon, Jeong Hye Han
Abstract:As electronic commerce progresses, temporal association rules are developed by time to offer personalized services for customer’s interests....
287
Authors: Zong Hui Wang, Shu Su Shi, Li Cheng Yu, Wen Zhi Chen
Chapter 16: Geographic Information and Remote Sensing Science
Abstract:FCD-based traffic navigation system is getting more and more attention from countries all over the world. Shortest path algorithm is one of...
2880
Authors: Hai Feng Li, Ning Zhang
Chapter 1: Transportation & Service Science
Abstract:Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in...
21
Authors: Jun Tan
Chapter 12: Computer-Aided Design and Applications in Industry and Civil Engineering
Abstract:Online mining of frequent closed itemsets over streaming data is one of the most important issues in mining data streams. In this paper, we...
2910
Authors: Hui Wang
Chapter 5: Numerical Methods, Computation Methods and Algorithms for Modeling, Simulation and Optimization, Data Mining and Data Processing
Abstract:We present a new algorithm for mining maximal frequent itemsets, MaxMining, from big transaction databases. MaxMining employs the depth-first...
1765