Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

An efficient algorithm for mining association rules from multiple databases

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)
Guoling Liu ; Sch. of Inf. Sci. & Technol., Shandong Inst. of Light Ind., Jinan, China ; Runian Geng

The mining objects of traditional mining association rules techniques mainly focus on mono-database. With the rapid development of database technologies, multi-database mining is becoming more and more important. In order to make the synthetic result of multiple data sources more accurate, the parameter C, which indicates the number of transactions in local branch database, is proposed. We design a novel and efficient multi-databases mining algorithm using the parameter C. It can reduce the network congestion and solve the new incremental addition of transaction data effectively. Experiment results demonstrate the algorithm is efficient.

Published in:

Computer Engineering and Technology (ICCET), 2010 2nd International Conference on  (Volume:4 )

Date of Conference:

16-18 April 2010