Options
Wrobel, Stefan
Maximal closed set and half-space separations in finite closure systems
Maximum Margin Separations in Finite Closure Systems
Probabilistic frequent subtree kernels
Frequent subgraph mining in outerplanar graphs
A Fast Heuristic for Computing Geodesic Closures in Large Networks
Maximal Closed Set and Half-Space Separations in Finite Closure Systems
Min-hashing for probabilistic frequent subtree feature spaces
A generalized Weisfeiler-Lehman graph kernel
Effective approximation of parametrized closure systems over transactional data streams
On the complexity of frequent subtree mining in very simple structures