Comparing Two Methods of Finding Local Association Rules
Fokrul Alom Mazarbhuiya
Abstract
Mining local association rules from temporal datasets is an interesting data mining problem. Several methods have been developed till today. In this paper, we present a comparative study on traditional rule mining method and that using rough set and boolean reasoning..We propose to show that the method using rough set and boolean reasoning outperfoms the traditional one
Data mining, Temporal data mining, Local association rule mining, Rough set, Boolean reasoning.
[1] Ale, J. M., Rossi, G. H.: An Approach to Discovering Temporal Association Rules, In: Proceedings of ACM symposium on Applied Computing, pp. 294-300 (2000).
[2] Mahanta, A. K., Mazarbhuiya, F. A., Baruah, H. K.: Finding Locally and Periodically Frequent Sets and Periodic Association Rules, In: Proceedings of 1st International Conference on Pattern Recognition and Machine Intelligence, LNCS 3776, pp. 576-582, Springer, Heidelberg (2005).
[3] F. A. Mazarbhuiya, A. K. Mahanta, M. Abulaish and Tanvir Ahmad (2009), Mining Local Association Rules from Temporal Data Set, Proceeding of International Conference of Patterns Recognition and Machine Intelligence (PReMI’09), LNCS 5909, pp. 255-260, Springer Berlin / Heidelberg.
[4] Paulak, Z.: Rough Sets in Theoretical Aspects of Reasoning about Data, Kluwer, Netherland (1991).
[5] Nguyen, H. S., Nguyen S. H.: Rough Sets and Association Rule Generation, Fundamenta Informaticae, Vol. 40(4), 383-405 (1999).
[6] Nguyen H. S., Slezak D.: Approximate Reducts and Association Rules- Correspondence and Complexity Results, In: Proceedings of 7th International Workshops on Rough sets, Fuzzy sets and Granular Soft Computing, Yamaguchi, Japan, LNCS 1711, pp. 137-145, Springer, Heidelberg (1996).
[7] Skowron A., Rauszer C.: The Dicernibility Matrices and Functions in Information Systems, in: R. Slowinski (ed.), Intelligent Decision support, Handbook of Applications and Advances of the Rough Sets Theory, Kluwer, Dordrecht, pp. 331- 362 (1992).
[8] Wrbewski, J.: Covering with Reducts- a Fast Algorithm for Rule Generation, In: Proceedings of RSCTC’98, Warsaw, Poland, LNCS 1424, pp. 402-407, Springer, Heidelberg (1998).
[9] F. A. Mazarbhuiya Yusuf Pervaiz (2015); An Efficient Method for Generating Local Association Rules, International Journal of Applied Information Systems (IJAIS), Foundation of Computer Science FCS, New York, USA Volume 9 – No.2, June 2015.
[Fokrul Alom Mazarbhuiya (2016) Comparing Two Methods of Finding Local Association Rules IJIREM Vol-3 Issue-1 Page No-51-54] (ISSN 2350 - 0557). www.ijirem.org
Fokrul Alom Mazarbhuiya
College of Computer Science & IT, Albaha University, Albaha, KSA fokrul_2005@yahoo.com
