Sciweavers

169 search results - page 3 / 34
» Learning Languages from Positive Data and Negative Counterex...
Sort
View
EXACT
2007
13 years 10 months ago
Learning Models from Temporal-Logic Properties via Explanations
Given a model and a property expressed in temporal logic, a model checker normally produces a counterexample in case the model does not satisfy the property. This counterexample i...
Miguel A. Carrillo, David A. Rosenblueth
ECML
1998
Springer
13 years 11 months ago
Predicate Invention and Learning from Positive Examples Only
Previous bias shift approaches to predicate invention are not applicable to learning from positive examples only, if a complete hypothesis can be found in the given language, as ne...
Henrik Boström
ICGI
2010
Springer
13 years 8 months ago
Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries
This paper presents an efficient algorithm that identifies a rich subclass of multiple context-free languages in the limit from positive data and membership queries by observing wh...
Ryo Yoshinaka
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
14 years 8 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto