Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2013.040923
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 4 Issue 9, 2013.
Abstract: Positive and negative association rules are important to find useful information hidden in large datasets, especially negative association rules can reflect mutually exclusive correlation among items. Association rule mining among frequent items has been extensively studied in data mining research. However, in recent years, there has been an increasing demand for mining the infrequent items. In this paper, we propose a tree based approach to store both frequent and infrequent itemsets to mine both the positive and negative association rules from frequent and infrequent itemsets. It minimizes I/O overhead by scanning the database only once. The performance study shows that the proposed method is an efficient than the previously proposed method.
T Ramakrishnudu and R B V Sbramanyam, “Mining Positive and Negative Association Rules Using FII-Tree” International Journal of Advanced Computer Science and Applications(IJACSA), 4(9), 2013. http://dx.doi.org/10.14569/IJACSA.2013.040923