169 search results - page 21 / 34 » Learning Languages from Positive Data and Negative Counterex... |
ICMLA
2007
13 years 9 months ago
2007
We describe SVMotif, a support vector machine-based learning algorithm for identification of cellular DNA transcription factor (TF) motifs extrapolated from known TF-gene interact...
TSE
1998
13 years 7 months ago
1998
—Scenarios are increasingly recognized as an effective means for eliciting, validating, and documenting software requirements. This paper concentrates on the use of scenarios for...
ALT
2006
Springer
14 years 4 months ago
2006
Springer
Abstract. Recently, some non-regular subclasses of context-free grammars have been found to be efficiently learnable from positive data. In order to use these efficient algorithms ...
NPL
2006
13 years 7 months ago
2006
In multi-instance learning, the training examples are bags composed of instances without labels, and the task is to predict the labels of unseen bags through analyzing the training...
COLT
1992
Springer
13 years 12 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...