On some universal constraints for classification algorithms

DOI10.1016/0041-5553(86)90149-7MaRDI QIDQ3790673zbMATH OpenOpenAlexFDO

Authors K. V. Rudakov

Publication date 1988

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(86)90149-7

zbMATH Keywords

categoriesclassification algorithmscorrect algorithmsheuristic algorithmsuniversal constraintsvoting algorithms

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)

Cited in

(9)

• A microchoice bound for continuous-space classification algorithms
• On extension theorems and their connection to universal consistency in machine learning
• A constant factor approximation algorithm for a class of classification problems
• On the Classification Capability of Sign-Constrained Perceptrons
• Relationship between homogeneity and independence constraints for classification algorithms
• scientific article; zbMATH DE number 1966629 (Why is no real title available?)
• Algorithms and Fundamental Limits for Unlabeled Detection Using Types
• Structural, Syntactic, and Statistical Pattern Recognition
• Classifier selection from a totally bounded class of functions

This page was built for publication: On some universal constraints for classification algorithms

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