Institute Homepage DE Sign In

Back

Empirical Inference Technical Report 2006

Minimal Logical Constraint Covering Sets

Thumb ticker sm l1170153
Empirical Inference
Bernhard Schölkopf
  • Director

We propose a general framework for computing minimal set covers under class of certain logical constraints. The underlying idea is to transform the problem into a mathematical programm under linear constraints. In this sense it can be seen as a natural extension of the vector quantization algorithm proposed by Tipping and Schoelkopf. We show which class of logical constraints can be cast and relaxed into linear constraints and give an algorithm for the transformation.

Author(s): Sinz, FH. and Schölkopf, B.
Number (issue): 155
Year: 2006
Month: December
Day: 0
Bibtex Type: Technical Report (techreport)
Digital: 0
Electronic Archiving: grant_archive
Institution: Max Planck Institute for Biological Cybernetics, Tübingen
Language: en
Organization: Max-Planck-Gesellschaft
School: Biologische Kybernetik
Links:

BibTex 

@techreport{4264,
  title = {Minimal Logical Constraint Covering Sets},
  abstract = {We propose a general framework for computing minimal set covers under class of certain logical constraints.
  The underlying idea is to transform the problem into a mathematical programm under linear constraints.
  In this sense it can be seen as a  natural extension of the vector quantization algorithm proposed by Tipping and Schoelkopf.
  We show which class of logical constraints can be cast and relaxed into linear constraints and give an algorithm for
  the transformation.},
  number = {155},
  organization = {Max-Planck-Gesellschaft},
  institution = {Max Planck Institute for Biological Cybernetics, Tübingen},
  school = {Biologische Kybernetik},
  month = dec,
  year = {2006},
  slug = {4264},
  author = {Sinz, FH. and Sch{\"o}lkopf, B.},
  month_numeric = {12}
}