Mario Boley Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMario Boley, Thomas Gärtner: On the Complexity of Constraint-Based Theory Extraction. Discovery Science 2009: 92-106
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMario Boley, Henrik Grosskreutz: Non-redundant Subgroup Discovery Using a Closure System. ECML/PKDD (1) 2009: 179-194
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMario Boley, Tamás Horváth, Stefan Wrobel: Efficient Discovery of Interesting Patterns Based on Strong Closedness. SDM 2009: 1002-1013
2008
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMario Boley, Henrik Grosskreutz: A Randomized Approach for Approximating the Number of Frequent Sets. ICDM 2008: 43-52
2007
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMario Boley: On Approximating Minimum Infrequent and Maximum Frequent Sets. Discovery Science 2007: 68-77
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel: Efficient Closed Pattern Mining in Strongly Accessible Set Systems. MLG 2007
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMario 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

1Thomas Gärtner [7]
2Henrik Grosskreutz [4] [6]
3Tamás Horváth [1] [2] [5]
4Axel Poigné [1] [2]
5Stefan Wrobel [1] [2] [5]

Copyright © Wed Nov 25 14:46:41 2009 by Michael Ley (ley@uni-trier.de)