Learning decision rules for pattern classification under a family of probability measures

DOI10.1109/18.567668MaRDI QIDQ4336292zbMATH OpenOpenAlexFDO

Authors Sanjeev R. Kulkarni, M. Vidyasagar

Publication date 12 May 1997

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.567668

zbMATH Keywords

learnabilitypattern classification

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• scientific article; zbMATH DE number 1979763
• A general classification rule for probability measures
• Learnability and the Vapnik-Chervonenkis dimension
• Learnability with respect to fixed distributions
• scientific article; zbMATH DE number 67635

Cited in

(9)

• An introduction to some statistical aspects of PAC learning theory
• Learning multicriteria classification models from examples: decision rules in continuous space
• Learning rule sets and Sugeno integrals for monotonic classification problems
• Probabilistic Rule Learning in Nonmonotonic Domains
• scientific article; zbMATH DE number 1249221 (Why is no real title available?)
• NEW DECISION RULES IN STATISTICAL PATTERN RECOGNITION
• scientific article; zbMATH DE number 6472034 (Why is no real title available?)
• Closure properties of uniform convergence of empirical means and PAC learnability under a family of probability measures.
• Realizable learning is all you need

This page was built for publication: Learning decision rules for pattern classification under a family of probability measures

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