Result: Learning intersection-closed classes with signatures
Title:
Learning intersection-closed classes with signatures
Authors:
Source:
Algorithmic learning theoryTheoretical computer science. 382(3):209-220
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 17 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Divers, Miscellaneous, Intelligence artificielle, Artificial intelligence, Apprentissage et systèmes adaptatifs, Learning and adaptive systems, Algorithme apprentissage, Learning algorithm, Algoritmo aprendizaje, Apprentissage, Learning, Aprendizaje, Concept, Concepto, Equivalence, Equivalencia, Fermeture, Closure, Cerradura, Informatique théorique, Computer theory, Informática teórica, Intersection, Intersección, Invariant, Invariante, Polymorphisme, Polymorphism, Polimorfismo, Requête, Query, Pregunta documental, 68T05, 68Wxx, Computational theory, Théorie apprentissage algorithmique, Computational learning theory, Théorie apprentissage, Théorie calcul, Closure algorithm, Computational learning, Quantified formulas
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Simon Fraser University, Burnaby, Canada
Departament de Tecnologia, Universitat Pompeu Fabra, Barcelona, Spain
Departament de Tecnologia, Universitat Pompeu Fabra, Barcelona, Spain
ISSN:
0304-3975
Rights:
Copyright 2008 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19034086
Database:
PASCAL Archive
Further Information
Intersection-closed classes of concepts arise naturally in many contexts and have been intensively studied in computational learning theory. In this paper, we study intersection-closed classes that contain the concepts invariant under an operation satisfying a certain algebraic condition. We give a learning algorithm in the exact model with equivalence queries for such classes. This algorithm utilizes a novel encoding scheme, which we call a signature.