Sciweavers

238 search results - page 8 / 48
» Learning Recursive Automata from Positive Examples
Sort
View
ICCV
2005
IEEE
14 years 9 months ago
Building a Classification Cascade for Visual Identification from One Example
Object identification (OID) is specialized recognition where the category is known (e.g. cars) and the algorithm recognizes an object's exact identity (e.g. Bob's BMW). ...
Andras Ferencz, Erik G. Learned-Miller, Jitendra M...
ICML
1994
IEEE
13 years 11 months ago
Combining Top-down and Bottom-up Techniques in Inductive Logic Programming
This paper describes a new methodfor inducing logic programs from examples which attempts to integrate the best aspects of existingILP methodsintoa singlecoherent framework. In pa...
John M. Zelle, Raymond J. Mooney, Joshua B. Konvis...
DKE
2006
139views more  DKE 2006»
13 years 7 months ago
Information extraction from structured documents using k-testable tree automaton inference
Information extraction (IE) addresses the problem of extracting specific information from a collection of documents. Much of the previous work on IE from structured documents, suc...
Raymond Kosala, Hendrik Blockeel, Maurice Bruynoog...
AMAI
1998
Springer
13 years 7 months ago
Generalization and Specialization Strategies for Learning r.e. Languages
Overgeneralization is a major issue in the identification of grammars for formal languages from positive data. Different formulations of generalization and specialization strate...
Sanjay Jain, Arun Sharma
AIED
2005
Springer
14 years 1 months ago
Design of Erroneous Examples for ACTIVEMATH
Abstract. The behaviorist view of learning that informs much of traditional schooling is not likely to invite students and teachers to see errors in a positive light. This is parti...
Erica Melis