Convexity and logical analysis of data

DOI10.1016/S0304-3975(98)00337-5zbMath0945.68082MaRDI QIDQ1575707

Oya Ekin, Peter L. Hammer, Alexander Kogan

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

classificationcomputational learning theorypolynomial algorithmsorthogonal disjunctive normal formspartially-defined Boolean functions

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (6)

Pareto-optimal patterns in logical analysis of data ⋮ Logical analysis of data -- the vision of Peter L. Hammer ⋮ Integrated optimization model and algorithm for pattern generation and selection in logical analysis of data ⋮ Subset-conjunctive rules for breast cancer diagnosis ⋮ On the inference of semi-coherent structures from data ⋮ Carpal tunnel syndrome automatic classification: electromyography vs. ultrasound imaging

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general lower bound on the number of examples needed for learning
• On connected Boolean functions
• A Way to Simplify Truth Functions
• Learnability and the Vapnik-Chervonenkis dimension
• Matroids and a Reliability Analysis Problem
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Convexity and logical analysis of data