An enhanced incremental association rule discovery with a lower minimum support

被引：5

作者：

Ariya, Araya ^{[1
]}

Kreesuradej, Worapoj ^{[1
]}

机构：

[1] King Mongkuts Inst Technol Ladkrabang, Fac Informat Technol, Bangkok 10520, Thailand

来源：

ARTIFICIAL LIFE AND ROBOTICS | 2016年 / 21卷 / 04期

关键词：

Data mining; Incremental association rule discovery; Expected frequent itemset; Bernoulli trials; Normal approximation to the binomial;

D O I：

10.1007/s10015-016-0288-3

中图分类号：

TP24 [机器人技术];

学科分类号：

080202 ; 1405 ;

摘要：

In the real world of data, a new set of data has been being inserted into the existing database. Thus, the rule maintenance of association rule discovery in large databases is an important problem. Every time the new data set is appended to an original database, the old rule may probably be valid or invalid. This paper proposed the approach to calculate the lower minimum support for collecting the expected frequent itemsets. The concept idea is applying the normal approximation to the binomial theory. This proposed idea can reduce a process of calculating probability value for all itemsets that are unnecessary. In addition, the confidence interval is also applied to ensure that the collection of expected frequent itemsets is properly kept.

引用

页码：466 / 477

页数：12

共 16 条

[1]

Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072

[2]

Agrawal R., 1994, P 20 INT C VER LARG, V1215, P487

[3]

Amornchewin R, 2009, J UNIVERS COMPUT SCI, V15, P2409

[4]

CHANG CH, 2003, P 7 PAC AS C KNOWL D

[5] Maintenance of discovered association rules in large databases: Art incremental updating technique [J].

Cheung, DW ;

Han, JW ;

Ng, VT ;

Wong, CY .

PROCEEDINGS OF THE TWELFTH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, 1996, :106-114

[6]

Ezeife C. I., 2002, C CAN SOC COMP STUD, P147

[7]

John EF, 2004, STAT 1 COURSE, P256

[8]

Larry JK, 1998, EXPLORING STAT MODER, P265

[9]

Le T. P., 2012, 2012 IEEE RIVF INT C

[10]

LEE CH, 2001, P ACM 10 INT C INF K

← 1 2 →