English
English
Deutsch
日本語
Help
Privacy Policy
Disclaimer
Include files
Advanced Search
Browse
START
BASKET (0)
Tools
Item
ITEM ACTIONS
EXPORT
Add to Basket
Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_1790688_3
Details
Summary
Minimal Logical Constraint Covering Sets
Sinz, F., & Schölkopf, B.
(2006).
Minimal Logical Constraint Covering Sets
(155).
Item is
Released
show all
hide all
Basic
show
hide
Item Permalink
:
https://hdl.handle.net/11858/00-001M-0000-0013-CF51-8
Version Permalink
:
https://hdl.handle.net/11858/00-001M-0000-0013-CF52-6
Genre
:
Report
Files
show Files
Locators
show
Creators
show
hide
Creators
:
Sinz, FH
1
, Author
Schölkopf, B
2
, Author
Affiliations
:
1
Research Group Computational Vision and Neuroscience, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497805
2
Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795
Content
show
hide
Free keywords
:
-
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.
Details
show
hide
Language(s)
:
Dates
:
Date issued:
2006-12
Publication Status
:
Issued
Pages
:
-
Publishing info
:
-
Table of Contents
:
-
Rev. Type
:
-
Identifiers
:
Report Nr.: 155
BibTex Citekey: 4264
Degree
:
-
Event
show
Legal Case
show
Project information
show
Source
show
