Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,291,044 papers from all fields of science
Search
Sign In
Create Free Account
Version space learning
Known as:
Candidate elimination
, Version Space
, Version spaces
Version space learning is a logical approach to machine learning, specifically binary classification. Version space learning algorithms search a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Binary classification
Formal concept analysis
Inductive logic programming
Rough set
Expand
Broader (1)
Machine learning
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Understanding the Role of Adaptivity in Machine Teaching: The Case of Version Space Learners
Yuxin Chen
,
A. Singla
,
Oisin Mac Aodha
,
P. Perona
,
Yisong Yue
Neural Information Processing Systems
2018
Corpus ID: 3619803
In real-world applications of education, an effective teacher adaptively chooses the next example to teach based on the learner’s…
Expand
Highly Cited
2016
Highly Cited
2016
hp-Version Space-Time Discontinuous Galerkin Methods for Parabolic Problems on Prismatic Meshes
A. Cangiani
,
Zhaonan Dong
,
E. Georgoulis
SIAM Journal on Scientific Computing
2016
Corpus ID: 207073188
We present a new $hp$-version space-time discontinuous Galerkin (dG) finite element method for the numerical approximation of…
Expand
2009
2009
Argumentation Based Constraint Acquisition
Konstantin Schekotihin
,
G. Friedrich
Ninth IEEE International Conference on Data…
2009
Corpus ID: 766672
Efficient acquisition of constraint networks is a key factor for the applicability of constraint problem solving methods. Current…
Expand
2006
2006
Acquiring Constraint Networks Using a SAT-based Version Space Algorithm
C. Bessiere
,
Rémi Coletta
,
F. Koriche
,
B. O’Sullivan
AAAI Conference on Artificial Intelligence
2006
Corpus ID: 668322
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this…
Expand
Highly Cited
2002
Highly Cited
2002
A theory of inductive query answering
L. D. Raedt
,
M. Jaeger
,
Sau-dan. Lee
,
H. Mannila
IEEE International Conference on Data Mining…
2002
Corpus ID: 5152756
We introduce the Boolean inductive query evaluation problem, which is concerned with answering inductive queries that are…
Expand
Highly Cited
2001
Highly Cited
2001
Conjunctive and Disjunctive Version Spaces with Instance-based Boundary Sets
Eugueni Smirnov
2001
Corpus ID: 60947508
1997
1997
Change management needs integrated process and configuration management
Gregor Joeris
ESEC '97/FSE-5
1997
Corpus ID: 15664226
Change management is a core problem of software development. Management of changes means managing the process of change as well…
Expand
1991
1991
The Description Identification Problem
C. Mellish
Artificial Intelligence
1991
Corpus ID: 36006859
Review
1991
Review
1991
On dynamically updating a computer program: From concept to prototype
O. Frieder
,
M. Segal
Journal of Systems and Software
1991
Corpus ID: 37376337
Highly Cited
1987
Highly Cited
1987
Layered Concept-Learning and Dynamically Variable Bias Management
L. Rendell
,
Raj Sheshu
,
D. Tcheng
International Joint Conference on Artificial…
1987
Corpus ID: 10111683
Concept learning is inherently complex. Without severe constraint or inductive "bias," the general problem is intractable. While…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE