期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2013
卷号：3
期号：6
出版社：S.S. Mishra
摘要：Frequent item set mining is a heart favorite topic of research for many researchers over the years. It is the basis for association rule mining. Association rule mining is used in many applications like: market basket analysis, intrusion detection, privacy preserving, etc. In this paper, we have developed a method to discover large item sets from the transaction database. The proposed method is fast in comparison to older algorithms. Also it takes les main memory space for computation purpose
