Options
Wrobel, Stefan
A Simple Heuristic for the Graph Tukey Depth Problem with Potential Applications to Graph Mining
Probabilistic and exact frequent subtree mining in graphs beyond forests
Listing closed sets of strongly accessible set systems with applications to data mining
Learning Weakly Convex Sets in Metric Spaces
Support Estimation in Frequent Itemset Mining by Locality Sensitive Hashing
Efficient closed pattern mining in strongly accessible set systems
Mining Tree Patterns with Partially Injective Homomorphisms
Probabilistic frequent subtrees for efficient graph classification and retrieval