Classification by polynomial surfaces

DOI10.1016/0166-218X(94)00008-2zbMATH Open0838.94022WikidataQ127642517 ScholiaQ127642517MaRDI QIDQ1897355FDOQ1897355

Authors: Martin Anthony 

Publication date: 27 August 1995

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

Recommendations

• Classification of polynomial minimal surfaces
• scientific article; zbMATH DE number 950674
• Classification of complex algebraic surfaces
• scientific article; zbMATH DE number 727954
• The classification of homogeneous surfaces
• The Classification of Surfaces
• Classification des surfaces de type Delaunay
• Complex versus differentiable classification of algebraic surfaces
• Classification of surfaces via Morse theory
• Classification of Surfaces

zbMATH Keywords

Boolean functionspolynomial separating surfacesthreshold order

Mathematics Subject Classification ID

Boolean functions (06E30)

Cites Work

• Multisurface method of pattern separation for medical diagnosis applied to breast cytology.
• A new polynomial-time algorithm for linear programming
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Title not available (Why is that?)
• Learnability and the Vapnik-Chervonenkis dimension
• Enumeration of Seven-Argument Threshold Functions
• Title not available (Why is that?)
• The threshold order of a Boolean function
• Central limit theorems for empirical measures
• A theory of the learnable
• A general lower bound on the number of examples needed for learning
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Neural networks, orientations of the hypercube, and algebraic threshold functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automatic pattern recognition: a study of the probability of error
• Using the Perceptron Algorithm to Find Consistent Hypotheses

Cited In (17)

• Classification of Surfaces
• A characterization of 2-threshold functions via pairs of prime segments
• Extremal properties of polynomial threshold functions
• Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
• Gauge groups and data classification.
• Generalization error bounds for the logical analysis of data
• Accuracy of techniques for the logical analysis of data
• Polynomial Threshold Functions, Hyperplane Arrangements, and Random Tensors
• Neural Networks with Local Receptive Fields and Superlinear VC Dimension
• Asymptotics of the number of 2-threshold functions
• Quantum query complexity of almost all functions with fixed on-set size
• On the complexity of computing and learning with multiplicative neural networks
• Hadamard powers and kernel perceptrons
• Partitioning points by parallel planes
• An Upper Bound on the Minimum Number of Monomials Required to Separate Dichotomies of {−1, 1}ⁿ
• On specifying Boolean functions by labelled examples
• Learning intersections of halfspaces with a margin

This page was built for publication: Classification by polynomial surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897355)