| | |
---|
2013 | Parallel subgroup discovery on computing clusters. First results Trabold, D.; Grosskreutz, H. | Konferenzbeitrag |
2013 | A relevance criterion for sequential patterns Grosskreutz, H.; Lang, B.; Trabold, D. | Konferenzbeitrag |
2012 | Class relevant pattern mining in output-polynomial time Grosskreutz, H. | Konferenzbeitrag |
2012 | An enhanced relevance criterion for more concise supervised pattern discovery Großkreutz, H.; Paurat, D.; Rüping, S. | Konferenzbeitrag |
2011 | Fast and memory-efficient discovery of the top-k relevant subgroups in a reduced candidate space Grosskreutz, Henrik; Paurat, Daniel | Konferenzbeitrag |
2011 | Secure distributed subgroup discovery in horizontally partitioned data Grosskreutz, H.; Lemmen, B.; Rüping, S. | Zeitschriftenaufsatz |
2011 | Secure Top-k subgroup discovery Grosskreutz, H.; Lemmen, B.; Rüping, S. | Konferenzbeitrag |
2010 | Fast discovery of relevant subgroups using a reduced search space Grosskreutz, H.; Paurat, D. | Bericht |
2010 | Formal concept sampling for counting and threshold-free local pattern mining Boley, M.; Gärtner, T.; Grosskreutz, H. | Konferenzbeitrag |
2010 | Learning by creating and exchanging objects: The SCY experience Jong, T. de; Joolingen, W.R. van; Giemza, A.; Girault, I.; Hoppe, U.; Kindermann, J.; Kluge, A.; Lazonder, A.W.; Vold, V.; Weinberger, A.; Weinbrenner, S.; Wichmann, A.; Anjewierden, A.; Bodin, M.; Bollen, L.; D'Ham, C.; Dolonen, J.; Engler, J.; Geraedts, C.; Grosskreutz, H.; Hovardas, T.; Julien, R.; Lechner, J.; Ludvigsen, S.; Matteman, Y.; Meistadt, Ø.; Næss, B.; Ney, M.; Pedaste, M.; Perritano, A.; Rinket, M.; Schlanbusch, H. von; Sarapuu, T.; Schulz, F.; Sikken, J.; Slotta, J.; Toussaint, J.; Verkade, A.; Wajeman, C.; Wasson, B.; Zacharia, Z.C.; Zanden, M. van der | Zeitschriftenaufsatz |
2010 | Privacy-preserving data-mining Grosskreutz, H.; Lemmen, B.; Rüping, S. | Zeitschriftenaufsatz |
2010 | Subgroup discovery for election analysis Grosskreutz, H.; Boley, M.; Krause-Traudes, M. | Konferenzbeitrag |
2009 | Approximating the number of frequent sets in dense data Boley, M.; Grosskreutz, H. | Zeitschriftenaufsatz |
2009 | Integrated Web services platform for the facilitation of fraud detection in health care e-government services Tagaris, A.; Konnis, G.; Benetou, X.; Dimakopoulos, T.; Kassis, K.; Athanasiadis, N.; Rüping, S.; Grosskreutz, H.; Koutsouris, D. | Konferenzbeitrag |
2009 | Non-redundant subgroup discovery using a closure system Boley, M.; Grosskreutz, H. | Konferenzbeitrag |
2009 | On subgroup discovery in numerical domains Grosskreutz, H.; Rüping, S. | Zeitschriftenaufsatz, Konferenzbeitrag |
2009 | On subgroup discovery in numerical domains Grosskreutz, H.; Rüping, S. | Konferenzbeitrag |
2008 | Cascaded subgroups discovery with an application to regression Grosskreutz, H. | Konferenzbeitrag |
2008 | Optimistic estimate pruning strategies for fast exhaustive subgroup discovery Grosskreutz, H.; Rüping, S.; Shabaani, N.; Wrobel, S. | Bericht |
2008 | Procurement fraud discovery using similarity measure learning Rüping, S.; Punko, N.; Günter, B.; Grosskreutz, H. | Konferenzbeitrag |
2008 | A randomized approach for approximating the number of frequent sets Boley, M.; Grosskreutz, H. | Konferenzbeitrag |
2008 | Tight optimistic estimates for fast subgroup discovery Grosskreutz, H.; Rüping, S.; Wrobel, S. | Konferenzbeitrag |