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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1975-2018
05101519752018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured… (More)
  • table 1
  • figure 1
Is this relevant?
2010
2010
In response to a 1997 problem of M. Vidyasagar, we state a necessary and sufficient condition for distribution-free PAC… (More)
  • figure 1
Is this relevant?
2008
2008
We consider the complexity of properly learning concept classes, i.e. when the learner must output a hypothesis of the same form… (More)
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… (More)
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… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC… (More)
Is this relevant?
1991
1991
Resource limitations have played an important role in the development and veri ® cation of theories about intelligent behaviour… (More)
  • figure 2
Is this relevant?
Highly Cited
1990
Highly Cited
1990
This paper addresses the problem of improving the accuracy of an hypothesis output by a learning algorithm in the distribution… (More)
  • figure 1
  • figure 3
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1988
Highly Cited
1988
We prove a lower bound of ( ln + VCdim(C) ) on the number of random examples required for distribution-free learning of a concept… (More)
Is this relevant?