The week's pick
Random Articles
Reseach Article
An Efficient Mining Algorithm for Closed Frequent Itemsets and its Associated Data
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 49 - Number 14 |
| Year of Publication: 2012 |
| Authors: N. Kavitha, S. Karthikeyan |
10.5120/7695-1023
|
N. Kavitha, S. Karthikeyan . An Efficient Mining Algorithm for Closed Frequent Itemsets and its Associated Data. International Journal of Computer Applications. 49, 14 ( July 2012), 22-25. DOI=10.5120/7695-1023
Abstract
Database is a repository of information. Retrieving automatic patterns from the database provide the requisite information and are in great demand in various domains of science and engineering. The effective pattern mining methods such as pattern discovery and association rule mining have been developed and find its applicability in a wide gamut ranging from science to medical to military and to engineering applications. Contemporary methods of retrieval such as pattern discovery and association rule mining algorithms are useful only for retrieving the data. The limitations of using these techniques are that they are unable to provide a complete association and relationship among the diverse patterns that is retrieved. This paper attempts a solution to the above limitation by designing a new algorithm (CFIM) which generates closed frequent patterns and its associated data concurrently. CFIM makes explicit the relationship between the patterns and its associated data.
References
- Rakesh Agrawal, Tomaz Lmielinski and Arun Swami," Mining association rules between sets of items in large databases", Proc of ACM SIGMOD Conference on Management of Data, Washington, 1993.
- R. Agrawal and R. Srikant, "Mining Sequential Patterns," Proc. 1995 Int'l Conf. Data Eng. (ICDE '95), pp. 3-14, Mar. 1995.
- J. S. Park, M. Chen, P. S. Yu," An effective hash based algorithm for mining association rules", Proc. of ACM SIGMOD International Conference on Management of Data, May 1995.
- Jiawei Han, Ian Pei and Yiwen Yin,"Mining Patterns without Candidate Generation", Proc. of 2000, International Conference on Management of Data, May 16-18, 2000 Dallas, Texas, USA.
- S. Brin, R. Motwani, and R. Silverstein, "Beyond Market Basket: Generalizing Association Rules to Correlations," Proc. ACM-1997.
- "MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases", Proc. 2001 International Conference on Data Engineering (ICDE'01), pp: 443-452.
- R. J. Bayardo," Efficiently Mining Long Patterns from Databases", Proc. of the 1998 ACM SIGMOD International Conference on Management of Data, Seattle, Washington, United states.
- Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal," Efficient mining of association rules using closed itemset lattices", Information System, Vol 24, 1999.
- M. J. Zaki and C. -J. Hsiao, "Charm: An Efficient Algorithm for Closed Itemsets Mining," Proc. Second SIAM Int'l Conf. Data Mining, Apr. 2002.
- Jiawei Han and Micheline Kamber, "DATA MINING Concepts and Techniques" Elsevier Publishers, 2001 edition.
- A. K. C. Wong, Fellow, IEEE, and Gary C. L. Li "Simultaneous pattern and data clustering for pattern cluster analysis" IEEE Trans. Knowledge and Data Eng. , vol. 20, no. 7, pp. 911-923, JULY 2008.
- M. J. Zaki, "Mining Non-Redundant Association Rules," Data Mining and Knowledge Discovery, vol. 9, no. 3, pp. 223-248, 2004.
Index Terms
Keywords