CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Optimized Frequent Pattern Mining for Classified Data Sets

by A Raghunathan, K Murugesan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 27
Year of Publication: 2010
Authors: A Raghunathan, K Murugesan
10.5120/504-821

A Raghunathan, K Murugesan . Optimized Frequent Pattern Mining for Classified Data Sets. International Journal of Computer Applications. 1, 27 ( February 2010), 20-29. DOI=10.5120/504-821

@article{ 10.5120/504-821,
author = { A Raghunathan, K Murugesan },
title = { Optimized Frequent Pattern Mining for Classified Data Sets },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 27 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 20-29 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number27/504-821/ },
doi = { 10.5120/504-821 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:49:02.468193+05:30
%A A Raghunathan
%A K Murugesan
%T Optimized Frequent Pattern Mining for Classified Data Sets
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 27
%P 20-29
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Mining frequent patterns in data is a useful requirement in several applications to guide future decisions. Association rule mining discovers interesting relationships among a large set of data items. Several association rule mining techniques exist, with the Apriori algorithm being common. Numerous algorithms have been proposed for efficient and fast association rule mining in data bases, but these seem to only look at the data as a set of transactions, each transaction being a collection of items. The performance of the association rule technique mainly depends on the generation of candidate sets. In this paper we present a modified Apriori algorithm for discovering frequent items in data sets that are classified into categories, assuming that a transaction involves maximum one item being picked up from each category. Our specialized algorithm takes less time for processing on classified data sets by optimizing candidate generation. More importantly, the proposed method can be used for a more efficient mining of relational data bases.

References
  1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. of ACM SIGMOD COMD, 1993.
  2. R. Agrawal, T. Imielinski, and A. Swami. Database Mining: a performance perspective, IEEE TKDE, Dec. 1993.
  3. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen and A.I. Verkamo. Fast Discovery of Association Rules. In U.M. Fayyad, et al. Advances in Knowledge Discovery and Data Mining, AAAI/MIT Press, 1996.
  4. R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules in Large Databases. In Proc. Of the 20th VLDB Conf., 1994.
  5. R.J. Bayardo Jr. Efficiently mining Long patterns from databases. In Proc. Of the ACM SIGMOD ICMD, 1998.
  6. F. Bodon. A Fast Apriori Implementation. In Proc. 1st FIMI 2003.
  7. S. Brin, R. Motwani, J.D. Ullman, and T. Tsur. Dynamic itemset counting and implication rules for market based data. ACM SIGMOD Record, 1997.
  8. M.S. Chen, J. Han and P.S. Yu. Data Mining: An overview from a database perspective. IEEE Transactions on Knowledge and Data Engineering, 1996.
  9. B. Dunke and N. Soparkar. Data organization and access for efficient data mining. In Proc. Of 15th ICDE, 1999.
  10. U.M. Fayyad, G. Piatesky-Shapiro, P. Smyth and R. Uthurusamy, editors. Advances in Knowledge Discovery and Data Mining. AAAI Press, 1998.
  11. V. Ganti, J. Gehrke, and R. Ramakrishnan. Mining very large databases. IEEE Computer, 1999.
  12. J. Han and M. Kamber, Data Mining Concepts and Techniques, Morgan Kaufmann Publishers, 2001.
  13. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. ACM SIGMOD ICMD, 2000.
  14. H. Mannila, H. Toivonen and A.I. Verkamo. Efficient algorithms for discovering Association Rules. AAAI Workshop on Knowledge Discovery in Databases, 1994.
  15. M.H. Margahny and A.A. Mitwaly. Fast Algorithm for Mining Association Rules. AIML 05 Conf, Egypt.
  16. S. Orlando, P. Palmerini and R. Perego. Enhancing the Apriori Algorithm for Frequent Set Counting. DaWak 2001.
  17. J.S. Park, M.-S. Chen and P.S. Yu. An effective hash-based algorithm for mining association rules. In Proc. Of ACM SIGMOD ICMD, 1995
  18. A. Savasere, E. Omiecinski and S.B. Navathe. An Efficient Algorithm for Mining Association Rules in Large Databases. In Proc. Of 21st VLDB Conf., 1995
  19. P. Shenoy, J. Haritsa, S. Sudarshan, G. Bhalotia, M. Bawa, and D. Shah. Turbocharging vertical mining of large databases. In Proc. Of the ACM SIGMOD ICMD, 2000.
  20. H. Toivonen. Sampling Large Databases for Association Rules. In The VLDB Journal, 1996.
Index Terms

Computer Science
Information Sciences

Keywords

Data mining association rule Apriori algorithm transactions frequent items itemsets

Powered by PhDFocusTM