Mario Boley

	2011
15		Mario Boley, Claudio Lucchese, Daniel Paurat, Thomas Gärtner: Direct local pattern sampling by efficient two-step random procedures. KDD 2011: 582-590
14		Mario Boley: The Efficient Discovery of Interesting Closed Pattern Collections. University of Bonn 2011
	2010
13		Henrik Grosskreutz, Mario Boley, Maike Krause-Traudes: Subgroup Discovery for Election Analysis: A Case Study in Descriptive Data Mining. Discovery Science 2010: 57-71
12		Mario Boley, Thomas Gärtner, Henrik Grosskreutz: Formal Concept Sampling for Counting and Threshold-Free Local Pattern Mining. SDM 2010: 177-188
11		Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel: Listing closed sets of strongly accessible set systems with applications to data mining. Theor. Comput. Sci. 411(3): 691-700 (2010)
	2009
10		Mario Boley, Thomas Gärtner: On the Complexity of Constraint-Based Theory Extraction. Discovery Science 2009: 92-106
9		Mario Boley, Henrik Grosskreutz: Non-redundant Subgroup Discovery Using a Closure System. ECML/PKDD (1) 2009: 179-194
8		Mario Boley, Tamás Horváth, Stefan Wrobel: Efficient Discovery of Interesting Patterns Based on Strong Closedness. SDM 2009: 1002-1013
7		Shankar Vembu, Thomas Gärtner, Mario Boley: Probabilistic Structured Predictors. UAI 2009: 557-564
6		Mario Boley, Henrik Grosskreutz: Approximating the number of frequent sets in dense data. Knowl. Inf. Syst. 21(1): 65-89 (2009)
5		Mario Boley, Tamás Horváth, Stefan Wrobel: Efficient discovery of interesting patterns based on strong closedness. Statistical Analysis and Data Mining 2(5-6): 346-360 (2009)
	2008
4		Mario Boley, Henrik Grosskreutz: A Randomized Approach for Approximating the Number of Frequent Sets. ICDM 2008: 43-52
	2007
3		Mario Boley: On Approximating Minimum Infrequent and Maximum Frequent Sets. Discovery Science 2007: 68-77
2		Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel: Efficient Closed Pattern Mining in Strongly Accessible Set Systems. MLG 2007
1		Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel: Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract). PKDD 2007: 382-389

Coauthor Index

1	Thomas Gärtner	[7] [10] [12] [15]
2	Henrik Grosskreutz	[4] [6] [9] [12] [13]
3	Tamás Horváth	[1] [2] [5] [8] [11]
4	Maike Krause-Traudes	[13]
5	Claudio Lucchese	[15]
6	Daniel Paurat	[15]
7	Axel Poigné	[1] [2] [11]
8	Shankar Vembu	[7]
9	Stefan Wrobel	[1] [2] [5] [8] [11]

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page