Concept Learning from (Very) Ambiguous Examples

Abstract : We investigate here concept learning from incomplete examples, denoted here as ambiguous. We start from the learning from interpretations setting introduced by L. De Raedt and then follow the informal ideas presented by H. Hirsh to extend the Version space paradigm to incomplete data: a hypothesis has to be compatible with all pieces of information provided regarding the examples. We propose and experiment an algorithm that given a set of ambiguous examples, learn a concept as an existential monotone DNF, We show that 1) boolean concepts can be learned, even with very high incompleteness level as long as enough information is provided, and 2) monotone, non monotone DNF (i.e. including negative literals), and attribute-value hypotheses can be learned that way, using an appropriate background knowledge. We also show that a clever implementation, based on a multi-table representation is necessary to apply the method with high levels of incompleteness.
Type de document :
Communication dans un congrès
Petra Perner. Machine Learning and Data Mining MLDM 2009, Jul 2009, Leipzig, Germany. springer Berlin, 5632, pp.465-478, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-03070-3_35〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00472599
Contributeur : Veronique Ventos <>
Soumis le : lundi 12 avril 2010 - 15:47:09
Dernière modification le : jeudi 5 avril 2018 - 12:30:08

Identifiants

Collections

Citation

Veronique Ventos, Dominique Bouhtinon, Henry Soldano. Concept Learning from (Very) Ambiguous Examples. Petra Perner. Machine Learning and Data Mining MLDM 2009, Jul 2009, Leipzig, Germany. springer Berlin, 5632, pp.465-478, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-03070-3_35〉. 〈inria-00472599〉

Partager

Métriques

Consultations de la notice

127