By Topic

An Efficient Association Rules Mining Algorithm Based on Coding and Constraints

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

4 Author(s)
Zhi Liu ; Coll. of Inf. Sci. & Technol., Dalian Maritime Univ., Dalian, China ; Mingyu Lu ; Weiguo Yi ; Hao Xu

The mining association rules is an important research field in data mining. The traditional association rule mining methods often generate too many candidate items and have to scan whole database for generating each candidate item. An efficient association rules mining scheme has been proposed in this paper. First, the sub-block coding method is used for the properties. Moreover, the constraints are made for the antecedent and consequent of rules. By using above strategies, the number of candidate items has reduced as well as the scanning size of the database. Therefore, the algorithm greatly improves the operating efficiency. Experimental results demonstrate that the proposed algorithm is more effective than the traditional approach.

Published in:

Biomedical Engineering and Informatics, 2009. BMEI '09. 2nd International Conference on

Date of Conference:

17-19 Oct. 2009