Options
Wrobel, Stefan
A Fast Heuristic for Computing Geodesic Closures in Large Networks
Maximum Margin Separations in Finite Closure Systems
Support Estimation in Frequent Itemset Mining by Locality Sensitive Hashing
On the complexity of frequent subtree mining in very simple structures
A Simple Heuristic for the Graph Tukey Depth Problem with Potential Applications to Graph Mining
Maximal Closed Set and Half-Space Separations in Finite Closure Systems
Probabilistic frequent subtree kernels
Learning Weakly Convex Sets in Metric Spaces
Mining Tree Patterns with Partially Injective Homomorphisms
Min-hashing for probabilistic frequent subtree feature spaces