English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Minimal Logical Constraint Covering Sets

Sinz, F., & Schölkopf, B.(2006). Minimal Logical Constraint Covering Sets (155). Tübingen, Germany: Max Planck Institute for Biological Cybernetics.

Item is

Files

show Files
hide Files
:
MPIK-TR-155.pdf (Publisher version), 464KB
Name:
MPIK-TR-155.pdf
Description:
-
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Sinz, FH1, 2, Author           
Schölkopf, B1, 2, Author           
Affiliations:
1Max Planck Institute for Biological Cybernetics, Max Planck Society, Spemannstrasse 38, 72076 Tübingen, DE, ou_1497794              
2Department 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: 2006-12
 Publication Status: Issued
 Pages: 12
 Publishing info: Tübingen, Germany : Max Planck Institute for Biological Cybernetics
 Table of Contents: -
 Rev. Type: -
 Identifiers: Report Nr.: 155
BibTex Citekey: 4264
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Technical Report of the Max Planck Institute for Biological Cybernetics
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 155 Sequence Number: - Start / End Page: - Identifier: -