Deriving strong association mining rules using a dependency criterion, the lift measure

International Journal of Data Analysis Techniques and Strategies

Volumn 1, Issue 3, 2009, Pages 297-312

  Bagui, Sikha ^a   Just, Jiri ^a   Bagui, Subhash C ^a  

^a UNIVERSITY OF WEST FLORIDA   (United States)

Author keywords

association rule mining; dependency criterion; frequent pattern mining; lift; strong association rules

Indexed keywords

EID: 84948648653     PISSN: 17558050     EISSN: 17558069     Source Type: Journal    
DOI: 10.1504/IJDATS.2009.024297     Document Type: Article

References (39)

1. Agrawal, R., Aggrawal, C., and Prasad, V.V.V. (2001) ‘A tree projection algorithm for generation of frequent itemsets’, Special Issue on High Performance Data Mining, Journal of Parallel and Distributed Computing, Vol. 61, No. 3, pp.350–371.
2. Agrawal, R., Gehrke, J., Gunopulos, D. and Raghavan, P. (1998) ‘Automatic subspace clustering of high dimensional data for data mining applications’, SIGMOD, pp.94–105.
3. Agrawal, R., Imielinski, T. and Swami, A. (1993) ‘Mining association rules between sets of items in large databases’, ACM SIGMOD Conference, ACM Press, pp.207–216.
4. Agrawal, R. and Srikant, R. (1994) ‘Fast algorithms for mining association rules in large databases’, Proceedings of the 20th VLDB Conference, Morgan Kaufmann.
5. Agrawal, R. and Srikant, R. (1995) ‘Mining sequential patterns’, Proceedings of the International Conference on Data Engineering (ICDE ’95), Taipei, Taiwan, pp.3–14.
6. Brin, S., Motwani, R., Ullman, J.D. and Tsur, S. (1997) ‘Dynamic itemset counting and implication rules for market basket data’, Proceedings of the 1997 ACM SIGMOD Conference, ACM Press, pp.225–264.
7. Dong, G. and Li, J. (1999) ‘Efficient mining of emerging patterns: discovering trends and differences’, Proceedings of International Conference of Knowledge Discovery and Data Mining (KDD ’99), San Diego, California, pp.43–52.
8. Gouda, K. and Zaki, M. (2005) ‘GenMax: an efficient algorithm for mining maximal frequent itemsets’, Data Mining and Knowledge Discovery, Vol. 11, No. 3, pp.223–242.
9. Grahne, G., Lakshmanan, L. and Wang, X. (2000) ‘Efficient mining of constrained correlated sets’, In Proc. 2000 Int. Conf. Data Engineering (ICDE ’00), San Diego, California, pp.512–521.
10. Grahne, G. and Zhu, J. (2005) ‘Fast algorithms for frequent itemset mining using FP-Trees’, IEEE Transactions on Knowledge and Data Engineering, Vol. 17, No. 10, pp.1347–1362.
11. Han, J. and Kamber, M. (2006) Data Mining: Concepts and Techniques, USA: Morgan Kaufmann Publishers.
12. Han, J., Pei, J. and Yin, Y. (2000) ‘Mining frequent patterns without candidate generation’, SIGMOD, pp.1–12.
13. Han, J., Pei, J., Yin, Y. and Mao, R. (2004) ‘Mining frequent patterns without candidate generation: a frequent-pattern tree approach’, Data Mining and Knowledge Discovery, Vol. 8, No. 1, pp.53–87.
14. Iko, P. and Kitsuregawa, M. (2003) ‘Parallel FP-growth on PC cluster’, Proceedings of 7th Pacific-Asia Conference of Knowledge Discovery and Data Mining, Seoul, Korea, pp.467–473.
15. Lakshmanan, L.V.S., Ng, R., Han, J. and Pang, A. (1999) ‘Optimization of constrained frequent set queries with 2-variable constraints’, In Proc. 1999 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD ’99), Philadelphia, Pennsylvania, pp.157–168.
16. Lent, B., Swami, A. and Widom, J. (1997) ‘Clustering association rules’, Proceedings of the International Conference on Data Engineering (ICDE ’97), Birmingham, England, pp.220–231.
17. Liu, B., Hsu, W. and Ma, Y. (1998) ‘Integrating classification and association rule mining’, KDD, pp.80–86.
18. Liu, G., Lu, H., Lou, W., Xu, Y. and Yu, J.X. (2004) ‘Efficient mining of frequent patterns using ascending frequency ordered prefix-tree’, Data Mining and Knowledge Discovery, Vol. 9, pp.249–274.
19. Mannila, H. (2002) ‘Local and global methods in data mining: basic techniques and open problems’, in P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz and R. Conejo (Eds.) Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 2380, pp.57–68.
20. Meretakis, D., Fragoudis, D., Lu, H. and Likothanassis, S. (2000) ‘Scalable association-based text classification’, Proceedings of the 9th CIKM Conference, ACM Press, pp.5–11.
21. Ng, R., Lakshmanan, L.V.S., Han, J. and Pang, A. (1998) ‘Exploratory mining and pruning optimizations of constrained associations rules’, In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD '98), Seattle, Washington, pp.13–24.
22. Park, J.S., Chen, M-S. and Yu, P.S. (1995) ‘An effective hash based algorithm for mining association rules’, Proceedings of the 1995 ACM SIGMOD Conference, ACM Press, pp.175–186.
23. Pasquier, N., Bastide, Y., Taouil, R. and Lakhal, L. (1999) ‘Discovering frequent closed itemsets for association rules’, Proceedings of the 7th International Conference on Database Theory (ICDT '99), January, Jerusalem, Israel, pp.398–416.
24. Pei, J., Han, J. and Lakshmanan, L.V.S. (2004) ‘Pushing convertible constraints in frequent itemset mining’, Data Mining and Knowledge Discovery, Vol. 8, pp.227–252.
25. Pei, J., Han, J., Lu, H., Nishio, S., Tang, S. and Yang, D. (2001) ‘H-mine: hyper-structure mining of frequent patterns in large databases’, International Conference on Data Mining (ICDM ‘01), November, San Jose, California, pp.441–448.
26. Pei, J., Han, J. and Mao, R. (2000) ‘CLOSET: an efficient algorithm for mining frequent closed itemsets’, Proceedings of the ACM-SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp.21–30.
27. Prasetyo, B., Pramudiono, I. and Kitsuregawa, M. (2005) ‘Hmine-rev: toward H-mine parallelization on mining frequent patterns in large databases’, Technical report, Institute of Electronics, Information and Communication Engineers, pp.49–54.
28. Roiger, R. and Geatz, M. (2003) Data Mining: A Tutorial-Based Primer, Addison Wesley.
29. Tan, P-N., Steinbach, M. and Kumar, V. (2006) Introduction to Data Mining, Addison Wesley.
30. Wang, K., Zhou, S. and Liew, S.C. (1999) ‘Building hierarchical classifiers using class proximity’, VLDB, pp.363–374.
31. Zaki, J. (2000) ‘Scalable algorithms for association mining’, IEEE Transactions on Knowledge and Data Engineering, Vol. 12, No. 3, pp.372–390.
32. Zaki, M.J. and Hsiao, C. (1999) ‘CHARM: an efficient algorithm for closed association rule mining’, Technical Report 99–10, Computer Science Department, Rensselaer Polytechnic Institute.
33. ftp://ftp.ics.uci.edu/pub/machine-learning-databases/solar-flare
34. http://archive.ics.uci.edu/ml/datasets/
35. http://archive.ics.uci.edu/ml/datasets/Contraceptive+Method+Choice
36. http://archive.ics.uci.edu/ml/datasets/El+Nino
37. http://archive.ics.uci.edu/ml/datasets/Intemet+Usage+Data
38. www.cs.waikato.ac.nz/ml/weka
39. www.nascar.com