| 2009 |
|---|
| 9 | EE | Christian Borgelt,
Thorsten Meinl:
Full Perfect Extension Pruning for Frequent Subgraph Mining.
Mining Complex Data 2009: 189-205 |
| 2007 |
|---|
| 8 | EE | A. Dreweke,
Marc Wörlein,
Ingrid Fischer,
D. Schell,
Thorsten Meinl,
Michael Philippsen:
Graph-Based Procedural Abstraction.
CGO 2007: 259-270 |
| 2006 |
|---|
| 7 | EE | Christian Borgelt,
Thorsten Meinl:
Full Perfect Extension Pruning for Frequent Graph Mining.
ICDM Workshops 2006: 263-268 |
| 6 | EE | Thorsten Meinl,
Marc Wörlein,
Olga Urzova,
Ingrid Fischer,
Michael Philippsen:
The ParMol Package for Frequent Subgraph Mining.
ECEASST 1: (2006) |
| 2005 |
|---|
| 5 | | Thorsten Meinl,
Ingrid Fischer,
Michael Philippsen:
Parallel Mining for Frequent Fragments on a Shared-Memory Multiprocessor - Results and Java-Obstacles.
LWA 2005: 196-201 |
| 4 | EE | Marc Wörlein,
Thorsten Meinl,
Ingrid Fischer,
Michael Philippsen:
A Quantitative Comparison of the Subgraph Miners MoFa, gSpan, FFSM, and Gaston.
PKDD 2005: 392-403 |
| 2004 |
|---|
| 3 | EE | Thorsten Meinl,
Michael R. Berthold:
Hybrid fragment mining with MoFa and FSG.
SMC (5) 2004: 4559-4564 |
| 2 | EE | Christian Borgelt,
Thorsten Meinl,
Michael R. Berthold:
Advanced pruning strategies to speed up mining closed molecular fragments.
SMC (5) 2004: 4565-4570 |
| 1 | EE | Ingrid Fischer,
Thorsten Meinl:
Graph based molecular data mining - an overview.
SMC (5) 2004: 4578-4582 |
