By Topic

Hierarchical association rule mining in large and dense databases using genetic network programming

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
$33 $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

5 Author(s)
Eloy Gonzales ; Graduate School of Information, Production and Systems, Waseda University, Fukuoka 808-0135 Japan ; Kaoru Shimada ; Shingo Mabu ; Kotaro Hirasawa
more authors

In this paper we propose a new hierarchical method to extract association rules from large and dense datasets using genetic network programming (GNP) considering a real world database with a huge number of attributes. It uses three ideas. First, the large database is divided into many small datasets. Second, these small datasets are independently processed by the conventional GNP-based mining method (CGNP) in parallel. This level of processing is called local level. Finally, new genetic operations are carried out for small datasets considered as individuals in order to improve the number of rules extracted and their quality as well. This level of processing is called global level. The amount of small datasets is also important especially for avoiding the overload and improving the general performance; we find the minimum amount of files needed to extract important association rules. The proposed method shows its effectiveness in simulations using a real world large and dense database.

Published in:

SICE, 2007 Annual Conference

Date of Conference:

17-20 Sept. 2007