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

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

A Novel Progressive Sampling based Approach for Effective Mining of Association Rules

by V.Umarani, M.Punithavalli
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 10 - Number 9
Year of Publication: 2010
Authors: V.Umarani, M.Punithavalli
10.5120/1511-1796

V.Umarani, M.Punithavalli . A Novel Progressive Sampling based Approach for Effective Mining of Association Rules. International Journal of Computer Applications. 10, 9 ( November 2010), 15-18. DOI=10.5120/1511-1796

@article{ 10.5120/1511-1796,
author = { V.Umarani, M.Punithavalli },
title = { A Novel Progressive Sampling based Approach for Effective Mining of Association Rules },
journal = { International Journal of Computer Applications },
issue_date = { November 2010 },
volume = { 10 },
number = { 9 },
month = { November },
year = { 2010 },
issn = { 0975-8887 },
pages = { 15-18 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume10/number9/1511-1796/ },
doi = { 10.5120/1511-1796 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:58:35.163778+05:30
%A V.Umarani
%A M.Punithavalli
%T A Novel Progressive Sampling based Approach for Effective Mining of Association Rules
%J International Journal of Computer Applications
%@ 0975-8887
%V 10
%N 9
%P 15-18
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Mining Association Rules from huge databases is one of the important issue that need to be addressed. This paper presents a new sampling based association rule mining algorithm that uses a progressive sampling approach based on negative border and Frequent pattern growth (FP Growth) algorithm for finding the candidate item sets which ultimately shortens the execution time in generating the candidate itemsets. Experimental results reveals that the propsed approach is significantly more efficient than the Apriori based sampling approach.

References
  1. R.Agarwal and R.Srikant,”Fast algorithms for mining association rules”. In Proc. VLDB Conf., pp 487-499.
  2. R.Agrawal, T.Imielinski, and A.Swami, “Mining association rules between sets items in large databases”, in proceedings of the ACM SIGMOD Int'l Conf. on Management of data, pp. 207- 216, 1993.
  3. Basel A. Mahafzah, Amer F. Al-Badarneh and Mohammed Z. Zakaria "A new sampling technique for association rulemining," in Journal of Information Science, Vol. 35, pp. 358-376, 2009.
  4. S. Brin, R. Motwani, J. D. Ullman and S. Tsur, “Dynamic Itemset Counting and Implication Rules for Market Basket Data,” Proc. ACM SIGMOD, 1997, pp. 255-264.
  5. B. Chen, P.Haas, and P.Scheuermann,” A new two phase sampling based algorithm for discovering association rules”,SIGKDD, 2002.
  6. Cai-Yan Jia and Xie-Ping Gao, "Multi- scaling sampling: an adaptive sampling method for discovering Science and Technology archive, Vol. 20, pp. 309-318, 2005.
  7. Chuang K, Chen M, Yang .W,”Progressive Sampling for Association Rules based on Sampling Error Estimation”, Lecture notes in computer Science, Vol. 3518, pp. 505- 515,2005.
  8. J.Han, J.Pei, and Y.Yin,”Mining frequent patterns without candidate generation”, SIGMOD,2000.
  9. Hannu Toivonen, "Sampling Large Databases for Association Rules", Proceedings of the 22nd International Conference on Very Large Data Bases, pp: 134 - 145, 1996 SIGMOD,2000.
  10. Klaus Julisch," Data Mining for Intrusion Detection -A Critical Review" in proc. Of IBM Research on application of Data Mining in Computer security, Chapter 1 , 2002.
  11. J. S. Park, M. S. Chen, and P. S. Yu, “An Effective Hash based Algorithm for mining association rules,” Proc. ACM SIGMOD Conf Management of Data, May, 1995.
  12. Parthasarathy, S., "Efficient progressive sampling for association rules", IEEE International Conference on Data mining, pp: 354- 361, 2002.
  13. Raymond Chi-Wing Wong, Ada Wai- Chee Fu, "Association Rule Mining and its Application to MPIS", 2003.
  14. V.Umarani, M.Punithavalli,” On developing an effectual progressive sampling based approach for Association Rule Discovery”, In the proceedings of 2nd IEEE ICIME Int’l conference on Information and Data Management”, Chengdu,China.
  15. Venkatesan T. Chakaravarthy, Vinayaka Pandit and Yogish Sabharwal, "Analysis of sampling techniques for association rule mining," In Proceedings of the 12thInternational Conference on Database Theory, Vol. 361, pp. 276-283,2009.
  16. M. J. Zaki, S. Parthasarathy, W. Li, and M. Ogihara,“Evaluation of Sampling for Data Mining of Association Rules,” Technical Report 617, CS Dept., U. Rochester, May 1996.
  17. Y. Zhao, C. Zhang and S. Zhang, “Efficient frequent itemsets mining by sampling,” Proceedings of the fourth International Conference on Active Media Technology (AMT), pp. 112-117,
Index Terms

Computer Science
Information Sciences

Keywords

Apriori Negative border FP-Growth Sampling Temporal Characteristics

Powered by PhDFocusTM