By Topic

An Efficiency apriori Algorithm: P_Matrix Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sixue Bai ; Nanchang Univ., Nanchang ; Xinxi Dai

Apriori algorithm is the most classical algorithm in association rule mining, but it has two fatal deficiencies: more scans for the databases and generates a great deal of candidate itemsets. To solve these two deficiencies of Apriori algorithm, an efficient and fast algorithm based on Pattern Matrix (named P_Matrix algorithm) is proposed, which solves these two problems: scanning for the databases is cut down to one time and not generating the candidate itemsets but generating the frequent itemsets directly. It greatly reduces the temporal complexity and spatial complexity of the algorithm and highly promotes the efficiency of Aprior algorithm.

Published in:

Data, Privacy, and E-Commerce, 2007. ISDPE 2007. The First International Symposium on

Date of Conference:

1-3 Nov. 2007