期刊名称：International Journal of Computer Science Issues
印刷版ISSN：1694-0784
电子版ISSN：1694-0814
出版年度：2012
卷号：9
期号：2
出版社：IJCSI Press
摘要：Knowledge Discovery through mining association rule among data from a large database is the one of key area of research. The first proposed Algorithm apriori is used to mine frequent items from the large database which leads to mine Association Rule between the data for discovering the Knowledge from the large database. Due to the limitation and complexity of Apriori algorithm, lot of research is underway for discovering new algorithms with a motive of minimizing the time and number of database scans for Knowledge Discovery through mining Association Rule among data from a large database. This paper propose one such kind of new algorithm which takes less number of scans to mining the frequent items from the large database which leads to mine the association rule between the data.
关键词：Apriori; Confidence; Support; matrix; AND operation; frequent Item Set;Probablity
