We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
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

Multidimensional Quantitative Rule Generation Algorithm for Transactional Database

by R. Sridevi, E. Ramaraj
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 99 - Number 2
Year of Publication: 2014
Authors: R. Sridevi, E. Ramaraj
10.5120/17349-7812

R. Sridevi, E. Ramaraj . Multidimensional Quantitative Rule Generation Algorithm for Transactional Database. International Journal of Computer Applications. 99, 2 ( August 2014), 40-44. DOI=10.5120/17349-7812

@article{ 10.5120/17349-7812,
author = { R. Sridevi, E. Ramaraj },
title = { Multidimensional Quantitative Rule Generation Algorithm for Transactional Database },
journal = { International Journal of Computer Applications },
issue_date = { August 2014 },
volume = { 99 },
number = { 2 },
month = { August },
year = { 2014 },
issn = { 0975-8887 },
pages = { 40-44 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume99/number2/17349-7812/ },
doi = { 10.5120/17349-7812 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:27:10.790697+05:30
%A R. Sridevi
%A E. Ramaraj
%T Multidimensional Quantitative Rule Generation Algorithm for Transactional Database
%J International Journal of Computer Applications
%@ 0975-8887
%V 99
%N 2
%P 40-44
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Data mining is a technology development in the present decade for guiding decision making. One of the main applications of data mining is exploration of Association Rules. The objective of the research is to find out the association rules for the sample dataset to find out the interesting and useful rules. A lot of modifications have been suggested over the last two decades for the traditional Market Basket Analysis Algorithm like Apriori, FP -Growth, E-clat etc. The proposed Multidimensional Quantitative Rule Generation (MQRG) method is to generate more number of interesting rules that satisfy minimum confidence threshold (min_conf). This paper presents the comparison results of the existing algorithm with the proposed Multidimensional Quantitative Rule generation.

References
  1. Anbalagan Pakkirisamy, Chandrasekaran Ramasamy, Saravanan Subramanian . Performance Comparison Of Rule Generation Algorithm In Open Source Data Mining Environments,Advances in Engineering and Technology Convergence, 28th April, 2013, Bangkok, Thailand, ISBN NO: 978-93-82208-89-1.
  2. Lei Wangt, Xing-Juan Fan2, Xing-Long Lwt, Huan Zha Mining data association based on a revised FP-growth Algorithm Proceedings of the 2012 International Conference on Machine Learning and Cybernetics, Xian, 15- 17 July,
  3. Bo Wu, Defu Zhang, Qihua Lan, Jiemin Zheng ,An Efficient Frequent Patterns Mining Algorithm based on Apriori Algorithm and the FP-tree Structure Department of Computer Science, Xiamen University, Xiamen.
  4. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. 1993 ACM-SIGMOD Int. Conf. Management of Data, Washington, D. C. , May 1993, pp 207–216.
  5. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDBY94, pp. 487-499.
  6. C. Borgelt. "Efficient Implementations of Apriori and Eclat". In Proc. 1st IEEE ICDM Workshop on Frequent Item Set Mining Implementations, CEUR Workshop Proceedings 90, Aachen, Germany 200.
  7. J. S . Park, M. S. Chen and P. S. Yu. An effective hash based algorithm for mining association rules. In SIGMOD1995, pp 175-186.
  8. J. Han, J. Pei, and Y. Yin. Mining Frequent Patterns without Candidate Generation (PDF), (Slides), Proc. 2000 ACM-SIGMOD Int. May 2000.
  9. E. Ramaraj and R. Sridevi A general Survey on multidimensional and Quantitative Association Rule mining Algorithms. International Journal of Engineering Research and Applications(IJERA) 2013.
  10. A. B. M. Rezbaul Islam, Tae-Sun Chung An Improved Frequent Pattern Tree Based Association Rule Mining Techniques Department of Computer Engineering Ajou University Suwon, Republic of Korea.
  11. E. Ramaraj and N. Venkatesan, ? Bit Stream Mask Search Algorithm in Frequent Itemset Mining,? European Journal of Scientific Reasearch,? Vol. 27 No. 2 (2009),
  12. G. Grahne, J. Zhu, Fast algorithms for frequent itemset mining using FP-Trees, IEEE Transactions on Knowledge and Data Engineering 17 (10) (2005) 1347–1362.
  13. E. Ramaraj and R. Sridevi Finding frequent patterns Based on Quantitative Binary Attributes Using FP-Growth Algorithm,International Journal of Engineering Research and Applications(IJERA) 2013.
  14. J. Han, H. Cheng, D. Xin, X. Yan, Frequent pattern mining: current status and future directions, Data Mining and Knowledge Discovery (2007). 10th Anniversary Issue.
  15. J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, in: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 2000, pp. 1–12.
  16. T. -P. Hong, C. -W. Lin, Y. -L. Wu, Incrementally fast updated frequent pattern trees, Expert Systems with Applications 34 (4) (2008) 2424–2435.
  17. H. Huang, X. Wu, R. Relue, Association analysis with one scan of databases, in: Proceedings of the IEEE International Conference on Data Mining, 2002,pp. 629–632.
Index Terms

Computer Science
Information Sciences

Keywords

Data mining Data Discretization Multidimensional Quantitative Association rules

Powered by PhDFocusTM