Logical analysis of binary data with missing bits
From MaRDI portal
Publication:1606295
DOI10.1016/S0004-3702(98)00110-6zbMath0996.68067OpenAlexW2063259258WikidataQ59560758 ScholiaQ59560758MaRDI QIDQ1606295
Endre Boros, Toshihide Ibaraki, Kazuhisa Makino
Publication date: 24 July 2002
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(98)00110-6
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (8)
Pareto-optimal patterns in logical analysis of data ⋮ Logic based methods for SNPs tagging and reconstruction ⋮ Integer programming models for feature selection: new extensions and a randomized solution algorithm ⋮ A mixed integer programming-based global optimization framework for analyzing gene expression data ⋮ Properties of quasi-Boolean function on quasi-Boolean algebra ⋮ Variations on extending partially defined Boolean functions with missing bits. ⋮ Logic classification and feature selection for biomedical data ⋮ Optimal discretization and selection of features by association rates of joint distributions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Occam's razor
- Knowing what doesn't matter: exploiting the omission of irrelevant data
- Structure identification in relational data
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Positive and Horn decomposability of partially defined Boolean functions
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- Error-free and best-fit extensions of partially defined Boolean functions
- Logical settings for concept-learning
- Learning from examples with unspecified attribute values.
- Decomposability of partially defined Boolean functions
- Queries and concept learning
- A theory of the learnable
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Computational limitations on learning from examples
- Horn Extensions of a Partially Defined Boolean Function
- Predicting Cause-Effect Relationships from Incomplete Discrete Observations
- Boolean analysis of incomplete examples
This page was built for publication: Logical analysis of binary data with missing bits