Robust cutpoints in the logical analysis of numerical data

DOI10.1016/j.dam.2011.07.014zbMath1252.90100OpenAlexW2133877076MaRDI QIDQ412323

Martin Anthony, Joel Ratsaby

Publication date: 4 May 2012

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

Full work available at URL: https://doi.org/10.1016/j.dam.2011.07.014

zbMATH Keywords

learning algorithmsmachine learninggeneralization errorlogical analysis of dataLAD methods

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Data structures (68P05)

Related Items (6)

Large width nearest prototype classification on general distance spaces ⋮ Integrated optimization model and algorithm for pattern generation and selection in logical analysis of data ⋮ Recent advances in the theory and practice of logical analysis of data ⋮ Learning bounds via sample width for classifiers on finite metric spaces ⋮ A hybrid classifier based on boxes and nearest neighbors ⋮ Analysis of a multi-category classifier

Cites Work

• Maximal width learning of binary functions
• Logical analysis of numerical data
• Learnability and the Vapnik-Chervonenkis dimension
• Uniform Central Limit Theorems
• The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
• Function Learning from Interpolation
• Structural risk minimization over data-dependent hierarchies
• Neural Network Learning
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Convergence of stochastic processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Robust cutpoints in the logical analysis of numerical data