文章基本信息

标题：Mining Frequent Pattern form Large Dynamic Database with Different Exhibition of Time
本地全文：下载
作者：Kamlesh Malpani ; Dr.P. R. Pal
期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2013
卷号：3
期号：8
出版社：S.S. Mishra
摘要：Incremental algorithms can manipulate the results of earlier mining to derive the final mining output in various businesses [1, 2, 3]. This study proposes a new algorithm, called the new approach for efficiently incrementally mining frequent pattern from large Dynamic database. Proposed approach is a backward method that only requires scanning incremental database. Rather than rescanning the original database for some new generated frequent itemsets in the incremental database, we add the occurrence counts of newly generated frequent itemsets and delete infrequent itemsets obviously. Thus, new proposed approach need not rescan the original database and to discover newly generated frequent itemsets. Proposed approach generates fewer candidates, reduces complex calculation and has good scalability as compared to the previous methods
关键词：Incremental; frequent; infrequent; Dynamic database; occurrence