The Association Rules Updating Algorithm Based on Reverse Search

Yu Chen; Wei Xiang Xu; Xu Min Liu

doi:10.4028/www.scientific.net/KEM.467-469.1126

Paper Titles

Scheduling a Pipelined Operator Graph of Bounded Treewidth
p.1102

Collision-Free Path Planning for Mobile Cranes Based on Ant Colony Algorithm
p.1108

RBF NN-Based Block PD-Type Backstepping Control of Induction Motor
p.1116

Study on Performance Evaluation of Enterprise
p.1122

The Association Rules Updating Algorithm Based on Reverse Search
p.1126

An Effective Modeling and Control Strategy for Supply Chain Design and Planning
p.1132

Research on the Framework of 4PL Based on GIS/3G/GPS
p.1136

Damage Detection and Assessment System of Roads for Decision Support for Disaster
p.1144

Key Computer Technology of Precision Fruits in Suzhou City
p.1150

HomeKey Engineering MaterialsKey Engineering Materials Vols. 467-469The Association Rules Updating Algorithm Based on...

The Association Rules Updating Algorithm Based on Reverse Search

Abstract:

This paper analyzed the existing association rules update algorithm IUA, found out that when the decision makers gave priority attention to the situation of maximum frequent itemsets, this algorithm cannot lower the cost of the database traversal to quickly access to the largest number of frequent itemsets. For the lack of the algorithm, an algorithm which is based on reverse search approach to update association rules is presented. The updating algorithm based on reverse search first generated all frequent itemsets of new itemsets. Then, it spliced the new largest frequent itemsets and original largest frequent itemsets for trimming, get the updated maximal frequent itemsets. This algorithm not only reduces the traversal times in the process of association rules updating, but also realized the priority access to the largest operation of frequent itemsets.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Key Engineering Materials (Volumes 467-469)

Pages:

1126-1131

DOI:

https://doi.org/10.4028/www.scientific.net/KEM.467-469.1126

Citation:

Cite this paper

Online since:

February 2011

Authors:

Yu Chen, Wei Xiang Xu, Xu Min Liu

Keywords:

Association Rule, Reverse, Update

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Feng Yu-cai, Feng Jian-lin. Incremental Updating Algorithms for Mining Association Rules[J]. HHJOURNAL OF SOFTWAREHH, 1998, 9(4): 301-306.

Google Scholar

[2] Sun Bao-you; Jiang He. Incremental Update Algorithm for Negative Association Rules[J]. HHComputer EngineeringHH. 2009, 35(13): 69-71.

Google Scholar

[3] Yang Ming, Sun Zhi-Hui, Song Yu-qing, Chen Geng. Fast Incremental Updating of Frequent Itemsets[N]. HHJournal of Applied SciencesHH, 2003, 21(4): 367-372.

Google Scholar

[4] Yang Jun-rui. Inverse Heuristic Mining Maximum Frequent Itemsets[J]. HHComputer EngineeringHH, 2004, 30(14): 116-118.

Google Scholar

[5] HHJia, YuboHH, HHDuan, YuntaoHH, HHWang, YongliHH. An incremental updating algorithm for online mining association rules. 2009 International Conference on Web Information Systems and Mining, WISM (2009).

DOI: 10.1109/wism.2009.37

Google Scholar

[6] HHJin, KanHH . A new algorithm for discovering association rules. 2010 International Conference on Logistics Systems and Intelligent Management, ICLSIM (2010).

DOI: 10.1109/iclsim.2010.5461239

Google Scholar