A concise representation of association rules using minimal predictive rules

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6321 LNAI, Issue PART 1, 2010, Pages 87-102

  Batal, Iyad ^a   Hauskrecht, Milos ^a  

^a Learning Research and Development Ctr   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATION RULE MINING; ASSOCIATION RULE MINING METHODS; CONCISE REPRESENTATIONS; DATA SETS; INFORMATION OVERHEAD; MINING ASSOCIATION RULES; PREDICTIVE RULES; RULE SET;

ASSOCIATION RULES; ASSOCIATIVE PROCESSING; LEARNING SYSTEMS;

DATA MINING;

EID: 78049340978     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15880-3_12     Document Type: Conference Paper

References (28)

1. Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of SIGMOD, pp. 207-216 (1993)
2. Asuncion, A., Newman, D. J.: UCI machine learning repository (2007)
3. Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J. W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P. J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, p. 972. Springer, Heidelberg (2000)
4. Batal, I., Sacchi, L., Bellazzi, R., Hauskrecht, M.: Multivariate time series classification with temporal abstractions. In: FLAIRS (2009)
5. Bay, S., Pazzani, M.: Detecting group differences: Mining contrast sets. Data Mining and Knowledge Discovery 5(3), 213-246 (2001)
6. Bayardo, R. J., Agrawal, R., Gunopulos, D.: Constraint-based rule mining in large, dense databases. In: Proceedings of ICDE, pp. 188-197 (1999)
7. Benjamini, Y., Hochberg, Y.: Controlling the false discovery rate: A practical and powerful approach to multiple testing. Journal of the Royal Statistical Society. Series B (Methodological) 57(1), 289-300 (1995)
8. Brin, S., Motwani, R., Silverstein, C.: Beyond market baskets: Generalizing association rules to correlations. In: Proceedings of SIGMOD (1997)
9. Castelo, R., Feelders, A. J., Siebes, A.: Mambo: Discovering association rules based on conditional independencies. In: Hoffmann, F., Adams, N., Fisher, D., Guimarães, G., Hand, D. J. (eds.) IDA 2001. LNCS, vol. 2189, p. 289. Springer, Heidelberg (2001)
10. Cheng, H., Yan, X., Han, J., Hsu, C.: Discriminative frequent pattern analysis for effective classification. In: Proceedings of ICDE (2007)
11. Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., Ullman, J. D., Yang, C.: Finding interesting associations without support pruning. In: Proceedings of ICDE (2000)
12. Das, K., Schneider, J., Neill, D.: Anomaly pattern detection in categorical datasets. In: Proceedings of SIGKDD (2008)
13. Fan, W., Zhang, K., Cheng, H., Gao, J., Yan, X., Han, J., Yu, P., Verscheure, O.: Direct mining of discriminative and essential frequent patterns via model-based search tree. In: Proceedings of SIGKDD (2008)
14. Fayyad, U., Irani, K.: Multi-interval discretization of continuous-valued attributes for classification learning. In: Proceedings of IJCAI (1993)
15. Geng, L., Hamilton, H.: Interestingness measures for data mining: A survey. ACM Comput. Surv. 38 (3) (2006)
16. Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proceedings of ICDM (2001)
17. Li, J., Shen, H., Topor, R.: Mining optimal class association rule set. In: Cheung, D., Williams, G. J., Li, Q. (eds.) PAKDD 2001. LNCS (LNAI), vol. 2035, p. 364. Springer, Heidelberg (2001)
18. Li, W., Han, J., Pei, J.: CMAR: Accurate and efficient classification based on multiple classassociation rules. In: Proceedings of ICDM (2001)
19. Lin, D., Kedem, Z.: Pincer-search: A new algorithm for discovering the maximum frequent set. In: Proceedings of EDBT, pp. 105-119 (1997) (Pubitemid 128044745)
20. Liu, B., Hsu, W., Ma, Y.: Integrating classification and association rule mining. In: Knowledge Discovery and Data Mining, pp. 80-86 (1998)
21. Liu, B., Hsu, W., Ma, Y.: Pruning and summarizing the discovered associations. In: Proceedings of SIGKDD (1999)
22. Ng, R., Lakshmanan, L., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained associations rules. In: Proceedings of SIGMOD (1998)
23. Padmanabhan, B., Tuzhilin, A.: A belief-driven method for discovering unexpected patterns. In: Proceedings of SIGKDD (1998)
24. Piatetsky-Shapiro, G.: AAAI 1991 Workshop on Knowledge Discovery in Databases (1991)
25. Shaffer, J. P.: Multiple hypothesis testing: A review. Annual Review of Psychology (1995)
26. Tatti, N.: Maximum entropy based significance of itemsets. Knowledge Information System 17(1), 57-77 (2008)
27. Yan, X., Cheng, H., Han, J., Xin, D.: Summarizing itemset patterns: a profile-based approach. In: Proceedings of SIGKDD (2005)
28. Zaki, M. J.: Spade: an efficient algorithm for mining frequent sequences. Machine Learning Journal, 31-60 (2001)