Convexity and logical analysis of data

Abstract

A Boolean function is called k-convex if for any pair x; y of its true points at Hamming distance at most k, every point \between" x and y is also true. Given a set of true points and a set of false points, the central question of Logical Analysis of Data is the study of those Boolean functions whose values agree with those of the given points. In this… (More)
DOI: 10.1016/S0304-3975(98)00337-5

Topics

  • Presentations referencing similar topics