文章基本信息

标题：Incremental Association Data Mining Using Quick sort and Searching Approach
本地全文：下载
作者：Disha Vaghasiya ; Dr.Vipul Vekariya
期刊名称：International Journal of Innovative Research in Computer and Communication Engineering
印刷版ISSN：2320-9798
电子版ISSN：2320-9801
出版年度：2015
卷号：3
期号：10
DOI：10.15680/IJIRCCE.2015.0310163
出版社：S&S Publications
摘要：Association rule is very effective and useful in the area of data mining. In dynamic and functionaldatabases new transactions are adjoined as time advances.so, this may introduce new association rules and someexisting and current rules would become inadmissible. So, to maintain association rules for dynamic database is thevital issue. So, in this paper I have new arrival of incremental algorithm for frequent item set is proposed to deal withthis problem. This approach is based on quick sort algorithm and proposed algorithm uses maximum support court of1-itemset which is obtained from previous mining to calculate in frequent item set called promising item set. When newtransactions are being added to original database, the algorithm take less no. of time scan the original database so thispaper algorithm has a simulation result that shows good performance. Enhance, this paper also includes new approachsearching algorithm with incremental association.
关键词：Frequent Itemset; Incremental Mining; Quick sort