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 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
An Efficient Restoration Method for the Faint Dot Matrix Images

Ao Zhu Peng Cao
Random Articles
Reseach Article

Discovery of Hidden Relationship in a Large Data Itemsets through Apriori Algorithm of Association Analysis with UML

by Narander Kumar, Vishal Verma, Vipin Saxena
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 58 - Number 1
Year of Publication: 2012
Authors: Narander Kumar, Vishal Verma, Vipin Saxena
10.5120/9244-3402

Narander Kumar, Vishal Verma, Vipin Saxena . Discovery of Hidden Relationship in a Large Data Itemsets through Apriori Algorithm of Association Analysis with UML. International Journal of Computer Applications. 58, 1 ( November 2012), 5-10. DOI=10.5120/9244-3402

@article{ 10.5120/9244-3402,
author = { Narander Kumar, Vishal Verma, Vipin Saxena },
title = { Discovery of Hidden Relationship in a Large Data Itemsets through Apriori Algorithm of Association Analysis with UML },
journal = { International Journal of Computer Applications },
issue_date = { November 2012 },
volume = { 58 },
number = { 1 },
month = { November },
year = { 2012 },
issn = { 0975-8887 },
pages = { 5-10 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume58/number1/9244-3402/ },
doi = { 10.5120/9244-3402 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:01:23.518060+05:30
%A Narander Kumar
%A Vishal Verma
%A Vipin Saxena
%T Discovery of Hidden Relationship in a Large Data Itemsets through Apriori Algorithm of Association Analysis with UML
%J International Journal of Computer Applications
%@ 0975-8887
%V 58
%N 1
%P 5-10
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

An association rule is a method to find out the frequent hidden relationship from a large amount of datasets in a database. Association analysis into existing database technology is very useful for indexing and query processing capabilities of database system and developing efficient and scalable mining algorithms as well as handling user specified or domain specific constraints and post processing the extracted patterns. In the present work, a methodology known as association analysis is presented which is very useful for discovery of interesting relationship hidden in large dataset, and an algorithm for generation of frequent data item set known as Apriori algorithm is used and validated the relations through Unified Modeling Language (UML). Authors used the lattice structure and also discussed the various association rules for the frequent data itemset which is found by Apriori algorithm. The different strategies in generation and traversal are breadth first and depth first search traversal. These techniques provide different tradeoff in terms of the input and output memory and computational time requirements. The entire concept is implemented by considering a real case study of Vehicle Insurance Policy system (VIPS) in context of Indian scenario.

References
  1. Aggarwal, C. C. and Yu, Philip S. , "Mining Large Itemsets for Association Rules", Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, pp 1-9, 1998.
  2. Agrawal, R. C. , Imielinski T. and Swami A. , "Mining Association Rules between Sets of Items in Very Large Databases. " Proceedings of the ACM SIGMOD Conference on Management of Data, pages 207-216, 1993.
  3. Agarwal, R. C. , Aggarwal C. C. , Prasad V. V. V. , and Crestana V. , "A Tree Projection Algorithm For Generation of Large Itemsets for Association Rules. " IBM Research Report, RC 21341.
  4. Agrawal R. , Mannila H. , Srikant R. , Toivonen H. and Verkamo A. I. , "Fast Discovery of Association Rules. " Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press, Chapter 12, pages 307-328. Proceedings of the 20th International Conference on Very Large Data Bases, pages 478-499, 1994.
  5. Bayardo R. J. , "Efficiently Mining Long Patterns from Databases. " Proceedings of the ACM SIGMOD, pages 85-93, 1998.
  6. Lin D. and Kedem Z. M. , "Pincer-Search: A New Algorithm for Discovering the Maximum Fre-quent Itemset. " EDBT Conference Proceedings, pages 105-119, 1998.
  7. Savasere A. , Omiecinski E. and Navathe S. B. , "An ancient Algorithm for Mining Association Rules in Large Databases. " Proceedings of the 21st International Conference on Very Large Databases, 1995.
  8. Toivonen H. , "Sampling Large Databases for Association Rules". Proceedings of the 22nd In-ternational Conference on Very Large Databases, Bombay, India, September 1996.
  9. Han J. and Fu Y. , "Discovery of Multi-level Association Rules From Large Databases. " Proceedings of the International Conference on Very Large Databases, pages 420-431, Zurich, Switzerland, September 1995.
  10. Srikant R. and Agrawal R. , "Mining Generalized Association Rules. " Proceedings of the 21st International Conference on Very Large Data Bases, pages 407-419, 1995.
  11. Srikant R. and Agrawal R. , "Mining quantitative association rules in large relational tables", Proceedings of the ACM SIGMOD Conference on Management of Data, pages 1-12, 1996.
  12. Ramaraj, E. , Gokulakrishnan, R. and Rameshkumar, K. "Information Quality Improvement through association rule mining algorithms DFCI, DFAPRIORI-CLOSE, EARA, PBAARA, SBAARA. " Journal of Theoretical and Applied Information Technology, pp 948-960, © 2005 – 2008.
  13. Venkateswara Rao Vedula and Thatavarti, S. "Binary Association Rule Mining Using Bayesian Network" International Conference on Information and Network Technology, vol. 4, pp 171-176 © (2011) IACSIT Press, Singapore.
  14. Sandhu, P. S. , Dhaliwal, D. S. and Panda, S. N. "Mining Utility-Oriented Association Rules: An Efficient Approach Based on Profit and Quantity," International Journal of the Physical Sciences Vol. 6(2), pp. 301-307, 18 January, 2011. Available online at http://www. academicjournals. org/IJPS ISSN 1992 - 1950 ©2011 Academic Journals.
  15. Prasanna1, K. and Seetha, M. "Association Rule Mining Algorithms for High Dimensional Data", International Journal of Advances in Engineering & Technology, ISSN: 2231-1963, pp. 443-454, Jan 2012.
  16. Jiang, N. and Gruenwald, Le "Research Issues in Data Stream Association Rule Mining", SIGMOD Record, Vol. 35, No. 1, pp 14-19, Mar. 2006.
  17. Aggarwal, C. C. , "Mining Associations with the Collective Strength Approach" IEEE Transactions on Knowledge and Data Engineering, , Volume: 13, Issue: 6, pp-863-873, Nov/Dec 2001.
  18. HuiNing, Haifeng Yuan and Shugang, Chen, "Temporal Association Rules in Mining Method," First International Multi-Symposiums on Computer and Computational Sciences, Volume: 2, pp739-742 (IMSCCS '06). 20-24 June 2006.
  19. Dunkel, B. and Soparkar, N. , "Data Organization and Access for Efficient Data Mining", 15th International Conference on Data Engineering, Proceedings, pp-522 – 529, 23-26 Mar 1999.
  20. Zutao, Zhu, Guan, Wang, and Wenliang, Du, "Deriving Private Information from Association Rule Mining Results"
  21. Aggarwal, C. C. and Yu, P. S. , "A New Approach to Online Generation of Association Rules", IEEE Transactions on Knowledge and Data Engineering Volume 13, Issue: 4, pp 527 - 540 Jul/Aug 2001.
  22. Cai, C. H. , Fu, A. W. C. , Cheng, C. H. and Kwong, W. W. , "Mining Association Rules with Weighted Items", International Proceedings. IDEAS'98 Database Engineering and Applications Symposium, pp-68–77, 1998.
  23. Brin, Sergey, Motwani, Rajeev, Ullman, Jeffrey D. and Tsur Shalom, "Dynamic Itemset Counting and Implication Rules for Market Basket Data", International Conference proceedings ACM SIGMOD, pp- 255-264, May 13-15, 1997.
  24. Walter A. Kosters, Elena Marchiori, and A. J. Oerlemans, "Mining Clusters with Association Rules", Proceedings of Symposium on Advances in Intelligent Data Analysis, ISBN:3-540-66332-0 IN 1999.
  25. Tan, Pang-Ning, Steinbach, Michael and Kumar, Vipin, "Introduction To Data Mining", Pearson Education, ISBN 978-81-317-1472-0, Fourth Edition, 2009.
Index Terms

Computer Science
Information Sciences

Keywords

Association rule Frequent data item sets Apriori Lattice structure VIPS

Powered by PhDFocusTM