Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Concept class

Known as: Concept (disambiguation) 
A concept over a domain X is a total Boolean function over X. A concept class is a class of concepts. Concept class is a subject of computational… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Sample compression schemes were defined by Littlestone and Warmuth (1986) as an abstraction of the structure underlying many… Expand
Is this relevant?
Highly Cited
2011
Highly Cited
2011
In this article, we present a novel algorithmic method for the calculation of thresholds for a metric set. To this aim, machine… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured… Expand
  • figure 4
  • figure 5
  • figure 4
  • figure 6.1
  • figure 6.2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We demonstrate that, ignoring computational constraints, it is possible to release privacy-preserving databases that are useful… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This paper addresses the problem of improving the accuracy of an hypothesis output by a learning algorithm in the distribution… Expand
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We study several issues concerning the selfdmected model of learning [G RS93, GS94). In particular, we show that the mistake… Expand
Is this relevant?
1991
1991
This paper aims at developing a learning theory where “simple” concepts are easily learnable. In Valiant’s learning model, many… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
This paper introduces a new framework for constructing learning algorithms. Our methods involve master algorithms which use… Expand
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Abstract We prove a lower bound of Ω ((1/ɛ)ln(1/δ)+VCdim( C )/ɛ) on the number of random examples required for distribution-free… Expand
Is this relevant?