nVApriori: A novel approach to avoid irrelevant rules in association rule mining using n-cross validation technique

International Journal of Advances in Soft Computing and its Applications

Volumn 1, Issue 2, 2009, Pages 132-150

  Ramaraj, Eswara Thevar ^a   Kumar, Krishnamoorthy Ramesh ^a  

^a ALAGAPPA UNIVERSITY   (India)

Author keywords

Association rule; Data mining; Frequent itemset mining; nVApriori

Indexed keywords

EID: 79960077230     PISSN: 20748523     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (25)

1. Agrawal, R., Imielinski, T., and Swami, A. N, (1993), Mining association rules between sets of items in large databases, In proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pp:207-216.
2. Agrawal R and Shafer JC, (1996), Parallel mining of association rules: design, implementation, and experience, IEEE Transaction Knowledge and Data Engineering, pp:962-969
3. Brin S, Motwani R, Ullman JD and Tsur S, (1997), Dynamic itemset counting and implication rules for market basket analysis, In proceeding of the 1997 ACM-SIGMOD International conference on management of data (SIGMOD'97), Tucson, AZ, pp:255-264
4. Cheng H, Yan X and Han J, (2004), IncSpan: incremental mining of sequential patterns in large, In proceedings of the 2004 ACM SIGKDD International conference on knowledge discovery in databases (KDD'04), Seattle, WA, pp:527-532
5. Cheung DW, Han J, Ng V, Fu A and Fu Y, (1996), A fast distributed algorithm for mining association rules, In proceedings of the 1996 International conference on parallel and distributed information systems, Miami Beach, FL, pp:31-44
6. Geerts F, Goethals B and Bussche J, (2001), A tight upper bound on the number of candidate patterns, In proceedings of the 2001 International conference on data mining (ICDM'01), San Jose, CA, pp:155-162
7. Hastie. T, Tibshirani. R, and Friedman J.H, (2001), The Elements of Statistical Learning, 1st ed., New York: Springer-Verlag.
8. Jiawei, Han and Micheline Kambar, (2003), Data Mining: concepts and techniques, Morgan Kaufman Publishers, San Francisco
9. Mannila.H, Toivonen. H, and Verkamo.I, (1994), Efficient algorithms for discovering association rules, Knowledge Discovery in Databases (KDD'94), AAAI Press, pp.181-192.
10. Mitchell.T.M, (1997) Machine Learning. New York: McGraw-Hill.
11. Ordonez. C and Omiecinski. E, (1999), Discovering association rules based on image content, In proceedings IEEE Advances in Digital Libraries Conference (ADL'99), pp:38-49.
12. Ordonez. C, Santana C.A, and Braal.L, (2000), Discovering interesting association rules in medical data, in proceedings ACM Data Mining and Knowledge Discovery Workshop, pp:78-85.
13. Park JS, Chen MS and Yu PS, (1995), An effective hash-based algorithm for mining association rules, In: Proceeding of the 1995 ACM-SIGMOD international conference on management of data (SIGMOD'95), San Jose, CA, pp:175-186
14. Park JS, Chen MS and Yu PS, (1995), Efficient parallel mining for association rules. In: Proceeding of the 4th international conference on information and knowledge management, Baltimore, MD, pp:31-36.
15. Roberto J. Bayardo Jr and Rakesh Agrawal, (1999), " Mining the most interesting rules" Appears in Proc. of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp:145-154.
16. Sarawagi S, Thomas S and Agrawal R, (1998), Integrating association rule mining with relational database systems: alternatives and implications. In: Proceeding of the 1998 ACM-SIGMOD international conference on management of data (SIGMOD'98), Seattle, WA, pp:343-354.
17. Savasere A, Omiecinski E and Navathe S, (1995), An efficient algorithm for mining association rules in large databases. In: Proceeding of the 1995 international conference on very large data bases (VLDB'95), Zurich, Switzerland, pp:432-443.
18. Toivonen H, (1996), Sampling large databases for association rules, In proceeding of the 1996 international conference on very large data bases (VLDB'96), Bombay, India, pp:134-145
19. Mohammed J. Zaki, Parthasarathy S, Ogihara M and Li W, (1997), Parallel algorithm for discovery of association rules, Data mining knowledge discovery, pp:343-374.
20. Mohammed J. Zaki, (2004), Mining Non-Redundant Association Rules, International journal of Data Mining and Knowledge Discovery, Vol. 9, Issue 3, pp:223-248.
21. Fisher, R.A and Yates, F. (1948), Statistical tables for biological, agricultural and medical research (3rd ed.). London: Oliver & Boyd. pp. pp:26-27.
22. S-C. Ngan, T. Lam, R.C-W. Wong and A.W-C. Fu, (2005), Mining N-most interesting itemsets without support threshold by the COFI-tree, International Journal of Business Intelligence and Data Mining, Vol. 1, No. 1, pp:88-108
23. Pang-ning Tan, Vipin kumar and Jaideep Srivastava, (2002), Selecting the right interestingness measures for association pattern, In proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, Edmonton, pp: 32 - 41. FIMI dataset. http://fimi.cs.helsinki.fi/
24. Ken Mcgarry. (2005), A survey of interestingness measures for knowledge discovery, The knowledge engineering review, Vol. 00:0, pp: 1-24.
25. Balaji Padmanabhan and Alexander Tuzhilin (1999), Unexpectedness as a measure of interestingness in knowledge discovery, Special issue on WIT'97, Vol.27, Issue.3, pp.303-318.