Options
Wrobel, Stefan
A Fast Heuristic for Computing Geodesic Closures in Large Networks
Probabilistic frequent subtree kernels
A logic-based approach to relation extraction from texts
Frequent subgraph mining in outerplanar graphs
Maximum Margin Separations in Finite Closure Systems
Min-hashing for probabilistic frequent subtree feature spaces
Efficient discovery of interesting patterns based on strong closedness
Maximal Closed Set and Half-Space Separations in Finite Closure Systems
On the complexity of frequent subtree mining in very simple structures
Frequent subgraph mining in outerplanar graphs