Cart (Loading....) | Create Account
Close category search window
 

Incremental Updating Algorithm Based on Partial Support Tree for Mining Association Rules

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)
Wang Yuping ; Coll. of Autom., Beijing Union Univ., Beijing, China ; Dong Nanping ; Zhou Guanling

A new algorithm, which is based on partial support tree (PS_Tree), is proposed to deal with the incremental updating problem when a new database is inserted and the minimum support is not changed. This algorithm use effectively the association rules mined and the partial support tree reserved to improve the performance. It only need scan the updated part of the database once so that the efficiency of algorithm can be further improved . The performance study shows that the algorithm is efficient for incremental updating problems of association rules.

Published in:

Control, Automation and Systems Engineering, 2009. CASE 2009. IITA International Conference on

Date of Conference:

11-12 July 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.