By Topic

Quantitative Association Rules Mining Algorithm Based on Matrix

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

3 Author(s)
Huizhen Liu ; Dept. of Comput. Sci., Huazhong Normal Univ., Wuhan, China ; Shangping Dai ; Hong Jiang

How to improve the efficiency of discovering the frequent item sets is a major problem in mining association rules. This paper analysised the idea and performance of the general quantitative association rules algorithm ,and put forward a quantitative association rules mining algorithm based on matrix, the new algorithm firstly transformed quantitative database into Boolean matrix ,then used boolean "and" operation to generate frequent item sets on matrix vector .It effectively solved the bottleneck of Apriori algorithm which iteratively produced frequent item sets in the general quantitative association rules algorithm . The results of experiments and analysis showed that the new algorithm effectively improved the efficiency of mining quantitative association rules.

Published in:

Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on

Date of Conference:

11-13 Dec. 2009