Learning Recursive Automata from Positive Examples
نویسندگان
چکیده
منابع مشابه
Learning Recursive Automata from Positive Examples
In this theoretical paper, we compare the “classical” learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial grammars. To this aim, we first study how to translate finite state automata into categorial grammars and back. We then show that the generalization operators employed in both domains can be compared, and that their result can alw...
متن کاملIncremental Learning from Positive Examples
Classical supervised learning techniques are generally based on an inductive mechanism able to generalise a model from a set of positive examples, assuring its consistency with respect to a set of negative examples. In case of learning from positive evidence only, the problem of over-generalisation comes into account. This paper proposes a general technique for incremental multi-class learning ...
متن کاملSpecialization of Recursive Predicates from Positive Examples Only
Problem statement: Given an overly general (definite) program P and its intended semantics φ (the programmer’s intentions) where P does not satisfy φ, find out a new version P’ of P such that P’ satisfies φ. Approach: We proposed an approach for correcting overly general programs from positive examples by exploiting program synthesis techniques. The synthesized program, P’, is a specialization ...
متن کاملLearning from Positive and Unlabeled Examples
In many machine learning settings, labeled examples are difficult to collect while unlabeled data are abundant. Also, for some binary classification problems, positive examples which are elements of the target concept are available. Can these additional data be used to improve accuracy of supervised learning algorithms? We investigate in this paper the design of learning algorithms from positiv...
متن کاملTransductively Learning from Positive Examples Only
This paper considers the task of learning a binary labeling of the vertices of a graph, given only a small set of positive examples and knowledge of the desired amount of positives. A learning machine is described maximizing the precision of the prediction, a combinatorial optimization problem which can be rephrased as a S-T mincut problem. For validation, we consider the movie recommendation d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revue d'intelligence artificielle
سال: 2006
ISSN: 0992-499X
DOI: 10.3166/ria.20.775-804