Options
Wrobel, Stefan
Effective approximation of parametrized closure systems over transactional data streams
Frequent subgraph mining in outerplanar graphs
Probabilistic and exact frequent subtree mining in graphs beyond forests
Efficient discovery of interesting patterns based on strong closedness
Probabilistic frequent subtrees for efficient graph classification and retrieval
Support-vector-machine-based ranking significantly improves the effectiveness of similarity searching using 2D fingerprints and multiple reference compounds