Partitioning points by parallel planes

DOI10.1016/j.disc.2003.10.025zbMath1058.52008OpenAlexW2156146794MaRDI QIDQ1827723

Martin Anthony

Publication date: 6 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.10.025

zbMATH Keywords

PartitionsEnumerationPattern classification

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Related Items (3)

On data classification by iterative linear partitioning ⋮ Topological equivalence classification and enumeration of \(n\)-input linearly separable Boolean functions ⋮ Directed Projection Graph of N-Dimensional Hypercube and Subhypercube Decomposition of Balanced Linearly Separable Boolean Functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
• Localization vs. identification of semi-algebraic sets
• Classification by polynomial surfaces
• Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
• The capacity of multilevel threshold functions
• A Note on the Number of Linearly Inducible Orderings of Points in d-Space
• Algebraic Techniques for Constructing Minimal Weight Threshold Functions
• Neural Network Learning
• Enumeration of Seven-Argument Threshold Functions
• The Number of Linearly Inducible Orderings of Points in d-Space

This page was built for publication: Partitioning points by parallel planes