Post-processing for rule reduction using closed set

Post-Mining of Association Rules: Techniques for Effective Knowledge Extraction

Volumn , Issue , 2009, Pages 81-99

  Liu, Huawen ^a   Sun, Jigui ^a,b   Zhang, Huijie ^c  

^a JILIN UNIVERSITY   (China)

^b Key Laboratory of Symbolic Computation   (China)

^c NORTHEAST NORMAL UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892334234     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.4018/978-1-60566-404-0.ch005     Document Type: Chapter

References (43)

1. Agrawal, R., Imielinski, T., & Swami, T. (1993). Mining association rules between sets of items in large databases. In Proceedings of the ACM Int. Conf. on Management of Data, Washington, D.C., May 1993 (pp. 207-216).
2. Ashrafi, M. Z., Taniar, D., & Smith, K. (2007). Redundant association rules reduction techniques. International Journal of Business Intelligence and Data Mining, 2(1), 29-63.
3. Baesens, B., Viaene, S., & Vanthienen, J. (2000). Post-processing of association rules. In Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'2000), Boston, Massachusetts, 20-23 Aug 2000 (pp. 2-8).
4. Baralis, E., & Chiusano, S. (2004). Essential Classification Rule Sets. ACM Transactions on Database Systems, 29(4), 635-674.
5. Baralis, E., & Psaila, G. (1997). Designing templates for mining association rules, Journal of Intelligent Information Systems, 9(1), 7-32.
6. Bathoorn, R., Koopman, A., & Siebes, A. (2006). Frequent Patterns that Compress. Institute of Information and Computing Sciences, Technical reports, UU-CS-2006-048, Utrecht University.
7. Bayardo, R. J. (1998). Efficiently Mining Long Patterns from Databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 85-93).
8. Berrado, A., & Runger, G.C. (2007). Using metarules to organize and group discovered association rules. Data Mining and Knowledge Discovery, 14(3), 409-431.
9. Berzal, F., & Cubero, J.C. (2007). Guest editors' introduction, Data & Knowledge Engineering, Special section on Intelligent Data Mining, 60, 1-4.
10. Blake, L. C., & Merz, J. C. (1998). UCI Repository of Machine Learning Databases. Department of Information and Computer Science, University of California, Irvine, http://www.ics.uci.edu/~mlearn/MLRepository.html.
11. Borgelt, C. (2000). Apriori software. Available from http://www.borgelt.net/software.html.
12. Boulicaut, J. F., Bykowski, A., & Rigotti, C. (2003). Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery, 7(1), 5-22.
13. Brijs, T., Vanhoof, K., & Wets, G. (2000). Reducing Redundancy in Characteristic Rule Discovery By Using Integer Programming Techniques. Intelligent Data Analysis Journal, 4(3), 229-240.
14. Brin, S., Motwani, R., & Silverstein, C. (1998). Beyond market baskets: Generalizing association rules to dependence rules. Data Mining and Knowledge Discovery, 2(1), 39-68.
15. Brin, S., Motwani, R., Ullman, J. D., & Tsur, S. (1997). Dynamic itemset counting and implication rules for market basket data. In Proceedings of the ACM SIGMOD Conference on Management of Data, May 13-15, Tucson, Arizona, USA, 1997 (pp. 255-264).
16. Bruha, I. (2000). From machine learning to knowledge discovery: Survey of preprocessing and postprocessing. Intelligent Data Analysis, 4(3-4), 363-374.
17. Calders, T., & Goethals, B. (2007). Non-derivable itemset mining. Data Mining and Knowledge Discovery, 14, 171-206.
18. Calders, T., Rigotti, C., & Boulicaut, J. F. (2006). A Survey on Condensed Representations for Frequent Sets, In: J.F. Boulicaut, L.D. Raedt, & H. Mannila (Ed.), Constraint-based mining and Inductive Databases (pp. 64-80), Springer.
19. Ceglar, A., & Roddick, J.F. (2006). Association mining. ACM Computing Survey, 38(2), No.5.
20. Chawla, S., Davis, J., & Pandey G. (2004). On local pruning of association rules using directed hypergraphs. In Proceedings of the 20th International Conference on Data Engineering (pp. 832-841).
21. Cheng, J., Ke, Y., & Ng, W. (2008). Effective elimination of redundant association rules, Data Mining and Knowledge Discovery, 16, 221-249.
22. Domingues, M. A., & Rezende, S. O. (2005). Postprocessing of Association Rules using Taxonomies. In Proceedings of Portuguese Conference on Artificial Intelligence (pp. 192-197).
23. Fayyad, U., Piatetsky-Shapiro, G., & Smyth, P. (1996). From data mining to knowledge discovery in databases. AI Magazine, 17, 37-54.
24. Fernádez, M. Z., Menasalvas, E., Marbán, O., Peña, J. M., & Millán S. (2001). Minimal Decision Rules Based on the Apriori Algorithm, Internal Journal of Applied Mathematics and Computer Science, 11(3), 691-704.
25. FIMI Dataset Repository. (2003). Available from http://fimi.cs.helsinki.fi/data/.
26. Geng, L., & Hamilton, H. J. (2006). Interestingness Measures for Data Mining: A Survey. ACM Computing Surveys, 38(3), No.9.
27. Jacquenet, F., Largeron, C., & Udrea, C. (2006). Efficient Management of Non Redundant Rules in Large Pattern Bases: A Bitmap Approach. In Proceedings of the International Conference on Enterprise Information Systems, 2006 (pp. 208-215).
28. Jaroszewicz, S., & Simovici, D.A. (2002). Pruning Redundant Association Rules Using Maximum Entropy Principle. In Proceedings of the 6th Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2002 (pp. 135-147).
29. Klemettinen, M., Mannila, H., Ronkainen, P., Toivonen, H., & Verkamo, A.I. (1994). Finding interesting rules from large sets of discovered association rules. In Proceedings of the Third International Conference on Information and Knowledge Management (CIKM'94), Gaithersburg, Maryland, USA (pp. 401-408).
30. Kryszkiewicz, M. (1998). Representative Association Rules and Minimum Condition Maximum Consequence Association Rules. In Proceedings of the Principles of Data Mining and Knowledge Discovery Conference (pp. 361-369).
31. Kryszkiewicz, M. (2005). Generalized disjunction-free representation of frequent patterns with negation. Journal of Experimental and Theoretical Artificial Intelligence, 17(1-2), 63-82.
32. Li, J. (2006). On Optimal Rule Discovery. IEEE Transactions on Knowledge and Data Engineer, 18(4), 460-471.
33. Li, W., Han, J., & Pei, J. (2001). CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules, In Proceedings of the 2001 IEEE International Conference on Data Mining, 2001 (pp. 369-376).
34. Liu, B., Hsu, W., & Ma, Y. (1998). Integrating Classification and Association Rule Mining. In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (pp. 27-31).
35. Liu, B., Hsu, W., & Ma, Y. (1999). Pruning and summarizing the discovered association. In Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1999, Philadelphia, Penn (pp. 125-134).
36. Palshikar, G. K., Kale, M. S., & Apte, M. M. (2007). Association rules mining using heavy itemsets. Data & Knowledge Engineering, 61(1), 93-113.
37. Pasquier, N., Taouil, R., Bastide, Y., Stumme, G., & Lakhal, L. (2005). Generating a Condensed Representation for Association Rules. Journal of Intelligent Information Systems, 24(1), 29-60.
38. Srikant, R., & Agrawal, R. (1995). Mining Generalized Association Rules. In Proceedings of the 1995 Int. Conf. Very Large Data Bases, Zurich, Switzerland, 1995 (pp. 407-419).
39. Toivonen, H., Klemettinen, M., Ronkainen, P., Hätönen, K., & Mannila, H. (1995). Pruning and Grouping of Discovered Association Rules. In Proceedings of ECML-95 Workshop on Statistics, Machine Learning, and Discovery in Databases, Heraklion, Crete, Greece, 1995 (pp. 47-52).
40. Uno, T., Asai, T., Arimura, H. & Uchida, Y. (2003). LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets. In Proceedings of ICDM'03 Workshop on Frequent Itemset Mining Implementations (pp. 1-10).
41. Waitman, L. R., Fisher, D. H., & King P. H. (2006). Bootstrapping rule induction to achieve rule stability and reduction. Journal of Intelligent Information System, 27, 49-77.
42. Webb, G. I., & Zhang, S. (2005). K-Optimal Rule Discovery. Data Mining and Knowledge Discovery, 10(1), 39-79.
43. Zaki, M. J. (2004). Mining Non-Redundant Association Rules. Data Mining and Knowledge Discovery, 9, 223-248.