The capacity of monotonic functions

DOI10.1016/S0166-218X(98)00016-XMaRDI QIDQ1265747zbMATH OpenFDO

Authors Joseph Sill

Publication date 27 September 1998

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

Full work available at URL http://www.elsevier.com/locate/dam

zbMATH Keywords

machine learningmonotonically increasing binary output functionspattern recognition

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1014877
• Exact VC-dimension of Boolean monomials
• Entropy estimate for high-dimensional monotonic functions
• VC bounds on the cardinality of nearly orthogonal function classes
• Combinatorial bounds for learning performance

Cites work

• Enumeration of Seven-Argument Threshold Functions
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 53191 (Why is no real title available?)
• scientific article; zbMATH DE number 823069 (Why is no real title available?)
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

Cited in

(1)

• A linear fit gets the correct monotonicity directions

This page was built for publication: The capacity of monotonic functions

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