Options
Wrobel, Stefan
Maximal closed set and half-space separations in finite closure systems
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 and exact frequent subtree mining in graphs beyond forests
A Fast Heuristic for Computing Geodesic Closures in Large Networks
Learning Weakly Convex Sets in Metric Spaces
Effective approximation of parametrized closure systems over transactional data streams
A generalized Weisfeiler-Lehman graph kernel
Maximum Margin Separations in Finite Closure Systems
Mining Tree Patterns with Partially Injective Homomorphisms