Fast and memory-efficient discovery of the top-k relevant subgroups in a reduced candidate space

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

Volumn 6911 LNAI, Issue PART 1, 2011, Pages 533-548

  Grosskreutz, Henrik ^a   Paurat, Daniel ^a  

^a FRAUNHOFER IAIS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENT EXACT ALGORITHMS; EXACT SOLUTION; ITERATIVE DEEPENING; MEMORY REQUIREMENTS; MEMORY-EFFICIENT ALGORITHMS; OPTIMISTIC ESTIMATE PRUNING; PRUNING TECHNIQUES; RELEVANCE CRITERIA; SEARCH SPACES; SUBGROUP DISCOVERY; SUBGROUP DISCOVERY TASKS;

LEARNING SYSTEMS; DATA MINING; MACHINE LEARNING;

ALGORITHMS; ITERATIVE METHODS;

EID: 80052417110     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23780-5_44     Document Type: Conference Paper

References (22)

1. Asuncion, A., Newman, D.J.: UCI machine learning repository (2007)
2. Atzmueller, M., Lemmerich, F., Krause, B., Hotho, A.: Towards Understanding Spammers - Discovering Local Patterns for Concept Characterization and Description. In: Proc. of the LeGo Workshop at ECML-PKDD (2009)
3. Atzmueller, M., Lemmerich, F.: Fast subgroup discovery for continuous target concepts. In: Rauch, J., Raś, Z.W., Berka, P., Elomaa, T. (eds.) ISMIS 2009. LNCS, vol. 5722, pp. 35-44. Springer, Heidelberg (2009)
4. Boley, M., Grosskreutz, H.: Non-redundant subgroup discovery using a closure system. In: Buntine, W., Grobelnik, M., Mladenić, D., Shawe-Taylor, J. (eds.) ECML PKDD 2009. LNCS, vol. 5781, pp. 179-194. Springer, Heidelberg (2009)
5. Bringmann, B., Nijssen, S., Zimmermann, A.: Pattern based classification: A unifying perspective. In: LeGo Worskhop Colocated with ECML/PKDD (2009)
6. Bringmann, B., Zimmermann, A.: The chosen few: On identifying valuable patterns. In: ICDM (2007)
7. Garriga, G.C., Kralj, P., Lavrač, N.: Closed sets for labeled data. J. Mach. Learn. Res. 9, 559-580 (2008)
8. Grosskreutz, H., Rüping, 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. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD Conference, pp. 1-12 (2000)
10. Klösgen, W.: Explora: A multipattern and multistrategy discovery assistant. In: Advances in Knowledge Discovery and Data Mining, pp. 249-271 (1996)
11. Knobbe, A., Cremilleux, B., Fürnkranz, J., Scholz, M.: From local patterns to global models: The lego approach to data mining. In: From Local Patterns to Global Models: Proceedings of the ECML/PKDD-2008 Workshop (2008)
12. Kralj, P., Lavrač, N., Zupan, B., Gamberger, D.: Experimental comparison of three subgroup discovery algorithms: Analysing brain ischemia data. In: Information Society, pp. 220-223 (2005)
13. Lavrac, N., Kavsek, B., Flach, P., Todorovski, L.: Subgroup discovery with CN2-SD. Journal of Machine Learning Research 5(Feb), 153-188 (2004)
14. Lavrac, N., Gamberger, D.: Relevancy in constraint-based subgroup discovery. In: Constraint-Based Mining and Inductive Databases (2005)
15. Lavrac, N., Gamberger, D., Jovanoski, V.: A study of relevance for learning in deductive databases. J. Log. Program. 40(2-3), 215-249 (1999)
16. Lemmerich, F., Atzmueller, M.: Fast discovery of relevant subgroup patterns. In: FLAIRS (2010)
17. Morishita, S., Sese, J.: Traversing itemset lattice with statistical metric pruning. In: PODS (2000)
18. Nijssen, S., Guns, T., De Raedt, L.: Correlated itemset mining in roc space: a constraint programming approach. In: KDD, pp. 647-656 (2009)
19. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Inf. Syst. 24(1), 25-46 (1999)
20. Russell, S.J., Norvig, P.: Artificial Intelligence: a modern approach, 2nd International edn. Prentice Hall, Englewood Cliffs (2003)
21. Uno, T., Asai, T., Uchida, Y., Arimura, H.: An efficient algorithm for enumerating closed patterns in transaction databases. In: Discovery Science (2004)
22. Wrobel, S.: An algorithm for multi-relational discovery of subgroups. In: Komorowski, J., ̇Zytkow, J.M. (eds.) PKDD 1997. LNCS, vol. 1263. Springer, Heidelberg (1997)