Maximal closed set and half-space separations in finite closure systems
From MaRDI portal
Publication:6093588
DOI10.1016/j.tcs.2023.114105zbMath1520.68158arXiv2001.04417MaRDI QIDQ6093588
Florian Seiffarth, Stefan Wrobel, Tamás L. Horváth
Publication date: 7 September 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.04417
68T05: Learning and adaptive systems in artificial intelligence
06A15: Galois correspondences, closure operators (in relation to ordered sets)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Axiomatic characterization of the interval function of a graph
- On the computation of the hull number of a graph
- Convexity in graphs
- Separation of two convex sets in convexity structures
- Foundations of inductive logic programming
- Monotone linkage clustering and quasi-concave set functions
- On maximal frequent and minimal infrequent sets in binary matrices
- Separation properties of convexity spaces.
- Large margin classification using the perceptron algorithm
- The geodesic classification problem on graphs
- Partitioning a graph into convex sets
- Formal concept analysis. Foundations and applications.
- A general set-separation theorem
- Graph Theory
- Geodesic Convexity in Graphs
- Convexity in Graphs and Hypergraphs
- A Selection Theorem for Topological Convex Structures
- Binary Convexities and Distributive Lattices
- Some Elementary Properties of Interval Convexities
- Ein Beweis des Satzes von M. Eidelheit über konvexe Mengen
- The duality between the anti-exchange closure operators and the path independent choice operators on a finite set
- Learning logic programs with structured background knowledge
- Maximal closed set and half-space separations in finite closure systems
