Efficient redundancy reduced subgroup discovery via quadratic programming

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

Volumn 7569 LNAI, Issue , 2012, Pages 125-138

  Li, Rui ^a   Kramer, Stefan ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

mutual information; quadratic programming; redundancy; rule learning; subgroup discovery

Indexed keywords

COMPUTATIONAL COSTS; DATA SETS; DESCRIPTIVE INDUCTION; MUTUAL INFORMATIONS; RULE LEARNING; STANDARD METHOD; SUBGROUP DISCOVERY;

ARTIFICIAL INTELLIGENCE; QUADRATIC PROGRAMMING;

REDUNDANCY;

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

References (23)

1. Bay, S.D., Pazzani, M.J.: Detecting group differences: Mining contrast sets. Data Mining and Knowledge Discovery 5, 213-246 (2001)
2. Bringmann, B., Zimmermann, A.: One in a million: Picking the right patterns. Knowledge and Information Systems 18, 61-81 (2009)
3. Cohen, W.W., Singer, Y.: A simple, fast, and effective rule learner. In: Proceedings of the Sixteenth National Conference on Artificial Intelligence, pp. 335-342. AAAI Press (1999)
4. Dong, G.Z., Li, J.Y.: Efficient mining of emerging patterns: discovering trends and differences. In: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 1999 (1999)
5. Frank, A., Asuncion, A.: UCI machine learning repository (2010)
6. Friedman, J.H., Popescu, B.E.: Predictive learning via rule ensembles. The Annals of Applied Statistics 2, 916-954 (2008)
7. Grosskreutz, H., Paurat, D.: Fast and Memory-Efficient Discovery of the Top-k Relevant Subgroups in a Reduced Candidate Space. In: Gunopulos, D., Hofmann, T., Malerba, D., Vazirgiannis, M. (eds.) ECML PKDD 2011, Part I. LNCS, vol. 6911, pp. 533-548. Springer, Heidelberg (2011)
8. Grosskreutz, H., Ruping, S., Wrobel, S.: Tight Optimistic Estimates for Fast Subgroup Discovery. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008, Part I. LNCS (LNAI), vol. 5211, pp. 440-456. Springer, Heidelberg (2008)
9. Herrera, F., Carmona, C.J., Gonzalez, P., Jesus, M.J.: An overview on subgroup discovery: foundations and applications. In: Knowledge and Information Systems, pp. 495-525 (2011)
10. Klosgen, W.: Explora: A multipattern and multistrategy discovery assistant. In: Advances in Knowledge Discovery and Data Mining (1996)
11. Klosgen, W., May,M.: Census data mining-an application. In:Mining Official Data, pp. 65-79 (2002)
12. Lavrac, N., Kavsek, B., Flach, P., Todorovski, L., Wrobel, S.: Subgroup discovery with CN2-SD. Journal of Machine Learning Research 5, 153-118 (2004)
13. Atzmueller, M., Puppe, F.: SD-Map-A Fast Algorithm for Exhaustive Subgroup Discovery. In: Furnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 6-17. Springer, Heidelberg (2006)
14. Morishita, S., Sese, J.: Traversing itemset lattices with statistical metric pruning. In: Proceedings of the 19th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 226-236. ACM (2000)
15. Novak, P.K., Lavrac, N., Webb, G.I.: Supervised descriptive rule discovery: A unifying survey of contrast set, emerging pattern and subgroup mining. Journal of Machine Learning Research 10, 377-403 (2009)
16. Rodrigue-Lujan, I., Huerta, R., Elkan, C., Cruz, C.S.: Quadratic programming feature selection. Journal of Machine Learning Research 11, 1491-1516 (2010)
17. Ruckert, U., Kramer, S.: Margin-based first-order rule learning. Machine Learning 70, 189-206 (2008)
18. Ruping, S.: Ranking interesting subgroups. In: Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, pp. 913-920. ACM, New York (2009)
19. van Leeuwen, M., Knobbe, A.: Non-redundant Subgroup Discovery in Large and Complex Data. In:Gunopulos,D., Hofmann,T.,Malerba,D., Vazirgiannis,M. (eds.) ECML PKDD 2011, Part III. LNCS, vol. 6913, pp. 459-474. Springer, Heidelberg (2011)
20. Vreeken, J., Leeuwen, M., Siebes, A.: Krimp: mining itemsets that compress. Data Mining and Knowledge Discovery 23, 169-214 (2011)
21. Wrobel, S.: An Algorithm for Multi-relational Discovery of Subgroups. In: Komorowski, J., ?Zytkow, J.M. (eds.) PKDD 1997. LNCS, vol. 1263, pp. 78-87. Springer, Heidelberg (1997)
22. Xin, D., Cheng, H., Yan, X.F., Han, J.W.: Extracting redundancy-aware top-k patterns. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 444-453 (2006)
23. Zimmermann, A., De Raedt, L.: CorClass: Correlated Association Rule Mining for Classification. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol. 3245, pp. 60-72. Springer, Heidelberg (2004)