Minimal Logical Constraint Covering Sets
2006
Technical Report
ei
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 |
Department(s): | Empirical Inference |
Bibtex Type: | Technical Report (techreport) |
Institution: | Max Planck Institute for Biological Cybernetics, Tübingen |
Digital: | 0 |
Language: | en |
Organization: | Max-Planck-Gesellschaft |
School: | Biologische Kybernetik |
Links: |
PDF
|
BibTex @techreport{4264, title = {Minimal Logical Constraint Covering Sets}, author = {Sinz, FH. and Sch{\"o}lkopf, B.}, number = {155}, organization = {Max-Planck-Gesellschaft}, institution = {Max Planck Institute for Biological Cybernetics, Tübingen}, school = {Biologische Kybernetik}, month = dec, year = {2006}, doi = {}, month_numeric = {12} } |