Minimal Logical Constraint Covering Sets

Sinz, FH; Schölkopf, B

Datensatz

DATENSATZ AKTIONENEXPORT

Zur Ablage hinzufügen

Bitte beachten Sie, dass eine neuere Version dieses Datensatzes verfügbar ist:
https://pure.mpg.de/pubman/item/item_1790688_3

DetailsÜbersicht

Minimal Logical Constraint Covering Sets

Sinz, F., & Schölkopf, B.(2006). Minimal Logical Constraint Covering Sets (155).

Item is Freigegeben

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:

Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-0013-CF51-8 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-0013-CF52-6

Genre: Bericht

ausblenden:

Urheber:
Sinz, FH¹, Autor
Schölkopf, B², Autor

Affiliations:
1Research Group Computational Vision and Neuroscience, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497805
2Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795

Inhalt

einblenden:

ausblenden:

Schlagwörter: -

Zusammenfassung: 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.