20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Sample Exclusion Dimension: Algorithmic Learning Theory, Boolean Function -

English
2026-03-20
€133.57 €166.96

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

High Quality Content by WIKIPEDIA articles! Exclusion dimension is a dimension in the exact concept learning with queries. In algorithmic learning theory, a concept over a domain X is a Boolean function over X. Here we only consider finite domains. A partial approximation S of a concept c is a Boolean function over Ysubseteq X such that c is an extension to S. Let C be a class of concepts and c be a concept ... Full description

You May Also Like

Description

High Quality Content by WIKIPEDIA articles! Exclusion dimension is a dimension in the exact concept learning with queries. In algorithmic learning theory, a concept over a domain X is a Boolean function over X. Here we only consider finite domains. A partial approximation S of a concept c is a Boolean function over Ysubseteq X such that c is an extension to S. Let C be a class of concepts and c be a concept (not necessarily in C). Then a specifying set for c w.r.t. C, denoted by S is a partial approximation S of c such that C contains at most one extension to S. If we have observed a specifying set for some concept w.r.t. C, then we have enough information to verify a concept in C with at most one more mind change. The exclusion dimension, denoted by XD(C), of a concept class is the maximum of the size of the minimum specifying set of c' with respect to C, where c' is a concept not in C.

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786131190872
Write Your Own Review
You're reviewing: Sample Exclusion Dimension: Algorithmic Learning Theory, Boolean Function
Your Rating:

Goodreads Reviews

€133.57 €166.96