Options
Wrobel, Stefan
Maximal closed set and half-space separations in finite closure systems
Probabilistic and exact frequent subtree mining in graphs beyond forests
Listing closed sets of strongly accessible set systems with applications to data mining
A generalized Weisfeiler-Lehman graph kernel
Probabilistic frequent subtrees for efficient graph classification and retrieval
Efficient discovery of interesting patterns based on strong closedness
Effective approximation of parametrized closure systems over transactional data streams
Frequent subgraph mining in outerplanar graphs
Support-vector-machine-based ranking significantly improves the effectiveness of similarity searching using 2D fingerprints and multiple reference compounds