CFP last date
20 May 2024
Reseach Article

Overview of Redundancy free Association Rule Mining

Published on October 2013 by A K Chandanan, M K Shukla
International Conference on Communication Technology
Foundation of Computer Science USA
ICCT - Number 5
October 2013
Authors: A K Chandanan, M K Shukla
b44adf21-0173-4d3c-a136-5ece71969484

A K Chandanan, M K Shukla . Overview of Redundancy free Association Rule Mining. International Conference on Communication Technology. ICCT, 5 (October 2013), 13-16.

@article{
author = { A K Chandanan, M K Shukla },
title = { Overview of Redundancy free Association Rule Mining },
journal = { International Conference on Communication Technology },
issue_date = { October 2013 },
volume = { ICCT },
number = { 5 },
month = { October },
year = { 2013 },
issn = 0975-8887,
pages = { 13-16 },
numpages = 4,
url = { /proceedings/icct/number5/13675-1334/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference on Communication Technology
%A A K Chandanan
%A M K Shukla
%T Overview of Redundancy free Association Rule Mining
%J International Conference on Communication Technology
%@ 0975-8887
%V ICCT
%N 5
%P 13-16
%D 2013
%I International Journal of Computer Applications
Abstract

Association rule mining is a way to find relations or co-relations among a set of information available. The aim to generate rules for giving multiple data from various databases. Analysis of data can be possible with the help of sequential access of data from database. In case of sequential access of data it may cause multiple times same rules to be generated. It is desired to find a solution to get out of those unnecessary association rules due to the complex characteristics of serial data. Although many numbers of serial association rule with the use of either sequence or temporal constraint as prediction model, these two models did not consider with the repetition during the process of rule mining for the database. The goal of this paper is to propose a method for redundancy free serial association rule mining.

References
  1. Agrawal R. and Srikant R. , Mining sequential patterns, Proceedings of the Eleventh International Conference on Data Engineering 1995 (1995).
  2. Brin S. , Motwani R. , Ullman J. D. , and Tsur S. , Dynamic item set counting and implication rules for market basket data, In SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, May 13-15, 1997, 255-264 (1997)
  3. Han J. , Pei J, Mining Frequent Patterns by Pattern-Growth: Methodology and Implications. , ACM SIGKDD (2000)
  4. Ganter B. and Wille R. , Formal Concept Analysis: Mathematical Foundations, Springer, Berlin- Heidelberg-New York, 10, (1999) Brown, L. D. , Hua, H. , and Gao, C. 2003. A widget framework for augmented interaction in SCAPE
  5. Zhao Q. , Bhowmick, S. S. , Association Rule Mining: A Survey. Nanyang Technological University, Singapore. (2003)
  6. Kotsiantis S,Kanellopoulos D,Association Rules Mining: A Recent Overview ,GESTS International Transactions on Computer Science and Engineering, Vol. 32 (1), 2006, pp. 71-82
  7. Gaul W. and Schmidt-Thieme L. , Mining Generalized Association Rules for Sequential and Path Data, Proceedings of the 2001 IEEE International Conference on Data Mining (2001) Spector, A. Z. 1989. Achieving application requirements. In Distributed Systems, S. Mullender
  8. Agrawal R. and Srikant R. , Fast algorithms for mining association rules in large databases, Proceedings of 20th International Conference on Very Large Databases (1994)Tavel, P. 2007 Modeling and Simulation Design. AK Peters Ltd.
  9. Ashrafi M. Z. , Taniar D. and Smith K. , Redundant association rules reduction techniques, International Journal of Business Intelligence and Data Mining (2007)
  10. Guo S. , Liang Y. , Zhang Z. and Liu W. , Association Rule Retrieved from Web Log Based on Rough Set Theory. Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery, 24-27 Aug 2007, Vol. 3 ,129 – 135.
  11. Han, J. , Kamber, M. , Mining Frequent Patterns, Associations, and Correlations. In D. D. Cerra (Ed. ), Data Mining: Concepts and Techniques , 2nd ed. , pp. 227-283, 2006, San Francisco, USA: Morgan Kaufmann Publishers
  12. Umarani V, Punithavalli M, A Study on Effective Mining of Association rules from Huge Databases, IJCSR International Journal of Computer Science and Research, 2010, Vol. 1 Issue 1,30-34(2010)
  13. Ceglar A. , Roddick J F, Association Mining,. ACM Computing Surveys (C SUR), 38(2). (2006).
  14. Chandanan A K,Shukla M K ,Data mining for qualitative dataset Using association rules: A review, International Journal of Advanced Research in Computer Science and Electronics Engineering Volume 2, Issue 2, February 2013, ISSN: 2277 – 9043,Page 231-238.
  15. Santosh B,Rukmani K, Implementation of Web Usage Mining Using Aproiri and FP Growth Algorithms",Int. J. of Advanced Networking and Applications,Volume:01, Issue:06, Pages: 400-404 (2010)
  16. Tanna P, Ghodasara Y, Foundation for Frequent Pattern Mining Algorithms Implementation ,International Journal of Computer Trends and Technology (IJCTT) – Volume 4 Issue 7 - July 2013
  17. http://en. wikibooks. org/wiki/Data_Mining_Algorithms_In_R/Frequent_Pattern_Mining/The_Apriori_Algorithm
  18. N Raheja,R Kumar,Optimization of Association Rule learning in distributed database using clustering techniques ,International Journal on Computer Science and Engineering (IJCSE),ISSN : 0975-3397Vol. 4 No. 12 Dec 2012 pg 1874-1880
  19. http://en. wikipedia. org/wiki/Apriori_algorithm
  20. http://www. gabormelli. com/RKB/Apriori_Algorithm
Index Terms

Computer Science
Information Sciences

Keywords

Association Rule Mining Sequence Creator Redundancy Free Serial Rule Mining