Logical Analysis of Binary Data with Missing Bits

@article{Boros1999LogicalAO,
  title={Logical Analysis of Binary Data with Missing Bits},
  author={Endre Boros and Toshihide Ibaraki and Kazuhisa Makino},
  journal={Artif. Intell.},
  year={1999},
  volume={107},
  pages={219-263}
}
We model a given pair of sets of positive and negative examples, each of which may contain missing components, as a partially defined Boolean function with missing bits (pBmb) (T̃ , F̃ ), where T̃ ⊆ {0, 1, ∗} and F̃ ⊆ {0, 1, ∗}, and “∗” stands for a missing bit. Then we consider the problem of establishing a Boolean function (an extension) f : {0, 1} → {0, 1} belonging to a given function class C, such that f is true (resp., false) for every vector in T̃ (resp., in F̃ ). This is a fundamental… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 14 extracted citations

Similar Papers

Loading similar papers…