Learning Tree Languages from Positive Examples and Membership Queries
Identifieur interne : 006B77 ( Main/Exploration ); précédent : 006B76; suivant : 006B78Learning Tree Languages from Positive Examples and Membership Queries
Auteurs : Jérôme Besombes [France] ; Jean-Yves Marion [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Intelligence artificielle.
English descriptors
- KwdEn :
Abstract
Abstract: We investigate regular tree languages exact learning from positive examples and membership queries. Input data are trees of the language to infer. The learner computes new trees from the inputs and asks to the oracle whether or not they belong to the language. From the answers, the learner may ask further membership queries until he finds the correct grammar that generates the target language. This paradigm was introduced by Angluin in the seminal work [1] for the case of regular word language. Neither negative examples, equivalence queries nor counter examples are allowed in this paradigm. We describe an efficient algorithm which is polynomial in the size of the examples for learning the whole class of regular tree languages. The convergence is insured when the set of examples contains a representative sample of the language to guess. A finite subset $\mathcal{E}$ of a regular tree language $\mathcal{L}$ is representative for $\mathcal{L}$ if every transition of the minimal tree automaton for $\mathcal{L}$ is used at least once for the derivation of an element of the set $\mathcal{E}$ .
Url:
DOI: 10.1007/978-3-540-30215-5_33
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002536
- to stream Istex, to step Curation: 002505
- to stream Istex, to step Checkpoint: 001786
- to stream Main, to step Merge: 006E81
- to stream PascalFrancis, to step Corpus: 000615
- to stream PascalFrancis, to step Curation: 000426
- to stream PascalFrancis, to step Checkpoint: 000596
- to stream Main, to step Merge: 007031
- to stream Main, to step Curation: 006B77
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Learning Tree Languages from Positive Examples and Membership Queries</title>
<author><name sortKey="Besombes, Jerome" sort="Besombes, Jerome" uniqKey="Besombes J" first="Jérôme" last="Besombes">Jérôme Besombes</name>
</author>
<author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:9ED8A39B6A7395F13C3FC3DE8F07901FA48F8656</idno>
<date when="2004" year="2004">2004</date>
<idno type="doi">10.1007/978-3-540-30215-5_33</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-JR3SFL3B-0/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">002536</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002536</idno>
<idno type="wicri:Area/Istex/Curation">002505</idno>
<idno type="wicri:Area/Istex/Checkpoint">001786</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001786</idno>
<idno type="wicri:doubleKey">0302-9743:2004:Besombes J:learning:tree:languages</idno>
<idno type="wicri:Area/Main/Merge">006E81</idno>
<idno type="wicri:source">INIST</idno>
<idno type="RBID">Pascal:04-0542613</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000615</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000426</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000596</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000596</idno>
<idno type="wicri:doubleKey">0302-9743:2004:Besombes J:learning:tree:languages</idno>
<idno type="wicri:Area/Main/Merge">007031</idno>
<idno type="wicri:Area/Main/Curation">006B77</idno>
<idno type="wicri:Area/Main/Exploration">006B77</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Learning Tree Languages from Positive Examples and Membership Queries</title>
<author><name sortKey="Besombes, Jerome" sort="Besombes, Jerome" uniqKey="Besombes J" first="Jérôme" last="Besombes">Jérôme Besombes</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>LORIA – INPL, Ecole Nationale Supérieure des Mines de Nancy, 615, rue du jardin botanique, 54602, Villers-lès-Nancy</wicri:regionArea>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Villers-lès-Nancy</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name>
<affiliation wicri:level="3"><country xml:lang="fr">France</country>
<wicri:regionArea>LORIA – INPL, Ecole Nationale Supérieure des Mines de Nancy, 615, rue du jardin botanique, 54602, Villers-lès-Nancy</wicri:regionArea>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Villers-lès-Nancy</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Artificial intelligence</term>
<term>Database query</term>
<term>Grammar</term>
<term>Language class</term>
<term>Learning algorithm</term>
<term>Learning by example</term>
<term>Minimal tree</term>
<term>Oracle</term>
<term>Polynomial method</term>
<term>Regular language</term>
<term>Target language</term>
<term>Tree automaton</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Algorithme apprentissage</term>
<term>Apprentissage à partir d'exemple</term>
<term>Arbre minimal</term>
<term>Automate arbre</term>
<term>Classe langage</term>
<term>Grammaire</term>
<term>Intelligence artificielle</term>
<term>Interrogation base donnée</term>
<term>Langage rationnel</term>
<term>Langage régulier</term>
<term>Langue cible</term>
<term>Méthode polynomiale</term>
<term>Oracle</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Intelligence artificielle</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: We investigate regular tree languages exact learning from positive examples and membership queries. Input data are trees of the language to infer. The learner computes new trees from the inputs and asks to the oracle whether or not they belong to the language. From the answers, the learner may ask further membership queries until he finds the correct grammar that generates the target language. This paradigm was introduced by Angluin in the seminal work [1] for the case of regular word language. Neither negative examples, equivalence queries nor counter examples are allowed in this paradigm. We describe an efficient algorithm which is polynomial in the size of the examples for learning the whole class of regular tree languages. The convergence is insured when the set of examples contains a representative sample of the language to guess. A finite subset $\mathcal{E}$ of a regular tree language $\mathcal{L}$ is representative for $\mathcal{L}$ if every transition of the minimal tree automaton for $\mathcal{L}$ is used at least once for the derivation of an element of the set $\mathcal{E}$ .</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
</country>
<region><li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Villers-lès-Nancy</li>
</settlement>
</list>
<tree><country name="France"><region name="Grand Est"><name sortKey="Besombes, Jerome" sort="Besombes, Jerome" uniqKey="Besombes J" first="Jérôme" last="Besombes">Jérôme Besombes</name>
</region>
<name sortKey="Besombes, Jerome" sort="Besombes, Jerome" uniqKey="Besombes J" first="Jérôme" last="Besombes">Jérôme Besombes</name>
<name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name>
<name sortKey="Marion, Jean Yves" sort="Marion, Jean Yves" uniqKey="Marion J" first="Jean-Yves" last="Marion">Jean-Yves Marion</name>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006B77 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 006B77 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Exploration |type= RBID |clé= ISTEX:9ED8A39B6A7395F13C3FC3DE8F07901FA48F8656 |texte= Learning Tree Languages from Positive Examples and Membership Queries }}
This area was generated with Dilib version V0.6.33. |