期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2012
卷号：3
期号：3
页码：4071-4074
出版社：TechScience Publications
摘要：The association rule mining has been very useful in many applications such as, market analysis, web data analysis, decision making, knowing customer trends etc. In transactional databases as time advances, new transactions are being added and obsolete transactions are discarded. Incremental mining deals with generating association rules based on available knowledge (obtained from mining of previously stored databases) and incremented databases only, without scanning the previously mined databases again. Several research works have been carried out for deriving the association rules and maintaining them efficiently without re-scanning the complete database. In this paper, a survey on different algorithms designed for incremental mining is presented. The algorithms are discussed into two sub-categories namely, apriori based algorithms and tree based algorithms. The pros and cons of these algorithms are also discussed in brief.tion.{
