Filters








1,093 Hits in 6.1 sec

Learning unions of tree patterns using queries

Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
<span title="">1997</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
We present an algorithm that exactly learns every concept in TPk in polynomial time in k and n using equivalence and membership queries, where n is the size of the longest counterexample given so far.  ...  We also show some lower bound results on the number of queries, and apply our result to learning restricted version of logic programs whose computational mechanisms are only disjunctive definition and  ...  ., and Osamu Watanabe for comments and suggestions on this issue. They are very grateful to Thomas Zeugmann, who made some suggestions to improve Theorem 9 in Section 4.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(97)00015-7">doi:10.1016/s0304-3975(97)00015-7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3gd4ew5mrngkplzbsfmp7q4gza">fatcat:3gd4ew5mrngkplzbsfmp7q4gza</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171001215830/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/ab3/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDMwNDM5NzU5NzAwMDE1Nw%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ed/ca/edca9c25b0f172b21e21a1e5f89dcf9c51762a05.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(97)00015-7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Learning unions of tree patterns using queries [chapter]

Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
<span title="">1995</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We present an algorithm that exactly learns every concept in TPk in polynomial time in k and n using equivalence and membership queries, where n is the size of the longest counterexample given so far.  ...  We also show some lower bound results on the number of queries, and apply our result to learning restricted version of logic programs whose computational mechanisms are only disjunctive definition and  ...  ., and Osamu Watanabe for comments and suggestions on this issue. They are very grateful to Thomas Zeugmann, who made some suggestions to improve Theorem 9 in Section 4.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-60454-5_29">doi:10.1007/3-540-60454-5_29</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tgnuyluhj5do7ok4dyhy2d73le">fatcat:tgnuyluhj5do7ok4dyhy2d73le</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808041649/http://www-ikn.ist.hokudai.ac.jp/~arim/papers/arimura_ishizaka_shinohara_tcs_185_1997.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6e/04/6e047214559230bc2fad876f32ef3c2c1cf575cd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-60454-5_29"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries

S. MATSUMOTO, T. SHOUDAI, T. UCHIDA, T. MIYAHARA, Y. SUZUKI
<span title="2008-02-01">2008</span> <i title="Institute of Electronics, Information and Communications Engineers (IEICE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xosmgvetnbf4zpplikelekmdqe" style="color: black;">IEICE transactions on information and systems</a> </i> &nbsp;
Tadepalli, •gExact learning of tree patterns from queries and counterexamples,•h Proc. COLT-98, pp. 175-186, ACM Press, 1998. [2] T.R. Amoth, P. Cull, and P.  ...  key words: exact learning, computational learning theory, finite union of tree pattern languages 1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/ietisy/e91-d.2.222">doi:10.1093/ietisy/e91-d.2.222</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6r2bja6ndvh6vfup3ifdhbqxbq">fatcat:6r2bja6ndvh6vfup3ifdhbqxbq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180727085025/https://www.jstage.jst.go.jp/article/transinf/E91.D/2/E91.D_2_222/_pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/26/d1/26d11919da9ec7d2eb88daf0388a220e89fe432d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/ietisy/e91-d.2.222"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries [chapter]

Satoshi Matsumoto, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida
<span title="">2002</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988) .  ...  An ordered tree pattern with internal structured variables, called a term tree, is a rooted tree pattern which consists of tree structures with ordered children and internal structured variables.  ...  We give a polynomial time learning algorithm of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin [5] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-36187-1_46">doi:10.1007/3-540-36187-1_46</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lucm5s6o6faz5eopuuj7u6qcxi">fatcat:lucm5s6o6faz5eopuuj7u6qcxi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070817094446/http://colus.i.kyushu-u.ac.jp/~ts/papers/ai02-matsumoto.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/af/65/af6529506a615c6fa55f78883fb274d0feef5ae2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-36187-1_46"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

On Exact Learning of Unordered Tree Patterns

Thomas R. Amoth, Paul Cull, Prasad Tadepalli
<span title="">2001</span> <i title="Springer-Verlag"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/h4nnd7sxwzcwhetu5qkjbcdh6u" style="color: black;">Machine Learning</a> </i> &nbsp;
Tree and forest patterns are learnable from equivalence and membership queries for the one-to-one into mapping.  ...  A finite union of tree patterns is called a forest. In this paper, we study the learnability of tree patterns from queries when the subtrees are unordered.  ...  We thank Dana Angluin, Lisa Hellerstein, Roni Khardon, Stephen Kwek, David Page, Vijay Raghavan, and Chandra Reddy for interesting discussions on the topic of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1023/a:1010971904477">doi:10.1023/a:1010971904477</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/journals/ml/AmothCT01.html">dblp:journals/ml/AmothCT01</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7ekkj2zwirg5de632yzoblavkq">fatcat:7ekkj2zwirg5de632yzoblavkq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180725115737/https://link.springer.com/content/pdf/10.1023%2FA%3A1010971904477.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/80/e1/80e13718ec86b89baad02eafe1d1e604dae8d374.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1023/a:1010971904477"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Algorithms for Inferring Register Automata [chapter]

Fides Aarts, Falk Howar, Harco Kuppens, Frits Vaandrager
<span title="">2014</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In this paper, we compare the LearnLib and Tomte approaches on a newly defined set of benchmarks and highlight their differences and respective strengths.  ...  In recent years, two different approaches for learning register automata have been developed: as part of the LearnLib tool algorithms have been implemented that are based on the Nerode congruence for register  ...  queries asked for learning and counterexample analysis.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-45234-9_15">doi:10.1007/978-3-662-45234-9_15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/p5hlhykxwncgnojv7y3u64sx7a">fatcat:p5hlhykxwncgnojv7y3u64sx7a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190426053922/https://www.mbsd.cs.ru.nl/publications/papers/fvaan/ISOLA14/main.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7e/dc/7edc91b7df02515e045c348ba4224c49ef77765c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-45234-9_15"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

From ZULU to RERS [chapter]

Falk Howar, Bernhard Steffen, Maik Merten
<span title="">2010</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
This paper summarizes our experience with the ZULU challenge on active learning without equivalence queries, presents our winning solution, investigates the character of ZULU's rating approach, and discusses  ...  of libraries for various learning components, system connectors, and other auxiliary functionality.  ...  Continuous Equivalence Query Beyond being a possible target for counterexample reduction (after some oracle provided an arbitrarily structured counterexample), the counterexample pattern c = sa · d, with  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-16558-0_55">doi:10.1007/978-3-642-16558-0_55</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xesv4xj4i5f5hoh2ibdbji7bgy">fatcat:xesv4xj4i5f5hoh2ibdbji7bgy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160716034922/http://falkhowar.de/papers/ISoLA2010-From-ZULU-to-RERS.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9f/5a/9f5aaaafa58c3d047c2c8639d17f65d0ae4ef6cd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-16558-0_55"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries

Satoshi Matsumoto, Yusuke Suzuki, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida
<span title="">2009</span> <i title="Information Processing Society of Japan"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wf6exvhhyrbfda2332m2m5ywza" style="color: black;">IPSJ Online Transactions</a> </i> &nbsp;
A term tree is a tree pattern consisting of ordered tree structures and repeated structured variables, which occur more than once.  ...  The exact learning model by Angluin (1988) is a mathematical model of learning via queries in computational learning theory.  ...  For the exact learning model, many researchers 1),2),5),6),10),11) have shown the exact learnabilities of several kinds of tree-structured patterns: e.g., query learning for ordered forests under onto-matching  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2197/ipsjtrans.2.250">doi:10.2197/ipsjtrans.2.250</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yqpynvfuxbdzvi2xxfzrfedjdq">fatcat:yqpynvfuxbdzvi2xxfzrfedjdq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190505222609/https://www.jstage.jst.go.jp/article/ipsjtrans/2/0/2_0_250/_pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8d/3a/8d3ae12585e3e8c1c2339c858be7c71c28ec33b2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2197/ipsjtrans.2.250"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Queries and concept learning

Dana Angluin
<span title="">1988</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/h4nnd7sxwzcwhetu5qkjbcdh6u" style="color: black;">Machine Learning</a> </i> &nbsp;
Examples are given of efficient learning methods using various subsets of these queries for formal domains, including the regular languages, restricted classes of context-free languages, the pattern languages  ...  We consider the problem of using queries to learn an unknown concept.  ...  This paper is a revision of an earlier report (Angluin, 1986 ), but is not identical to it.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf00116828">doi:10.1007/bf00116828</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5f2oypi2abbubkcatlw6hqenyu">fatcat:5f2oypi2abbubkcatlw6hqenyu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808171208/http://homepages.math.uic.edu/~lreyzin/f14_mcs548/angluin88.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e1/63/e16333259bb4a688fe2568f0d757299846a3e696.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf00116828"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Exact learning of unordered tree patterns from queries

Thomas R. Amoth, Paul Cull, Prasad Tadepalli
<span title="">1999</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/57rkizy6ozh5tp3leu5xxnp5qu" style="color: black;">Proceedings of the twelfth annual conference on Computational learning theory - COLT &#39;99</a> </i> &nbsp;
We consider learning tree patterns from queries ex-  ...  We thank Dana Angluin, David Page, Lisa Hellerstein, and Roni Khardon for interesting discussions on the topic of this paper. We thank the reviewers for many excellent suggestions on the paper.  ...  In particular, tree patterns with one-to-one and onto semantics are hard to learn from equivalence and membership queries. But with one-to-one and into semantics, they are easy to learn.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/307400.307486">doi:10.1145/307400.307486</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/colt/AmothCT99.html">dblp:conf/colt/AmothCT99</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cqy4e3a5wzb3bkhxv2yu4qvmea">fatcat:cqy4e3a5wzb3bkhxv2yu4qvmea</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060922211751/http://wotan.liu.edu/docis/lib/cilt/rclis/dbl/maclea/(2001)44%253A3%253C211%253AOELOUT%253E/www.cs.orst.edu%252F%25257Eamotht%252Fpapers%252F95m.pdf%252Famoth99exact.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fe/b9/feb9e5c8ee5481716c793c4c2506aa1d394764f4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/307400.307486"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

:{unav)

Dana Angluin
<span title="2012-12-28">2012</span> <i title="Springer Science and Business Media LLC"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/h4nnd7sxwzcwhetu5qkjbcdh6u" style="color: black;">Machine Learning</a> </i> &nbsp;
Examples are given of efficient learning methods using various subsets of these queries for formal domains, including the regular languages, restricted classes of context-free languages, the pattern languages  ...  We consider the problem of using queries to learn an unknown concept.  ...  This paper is a revision of an earlier report (Angluin, 1986 ), but is not identical to it.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1023/a:1022821128753">doi:10.1023/a:1022821128753</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/q4euxoaxsza65bhf4fk2gudbbi">fatcat:q4euxoaxsza65bhf4fk2gudbbi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808171208/http://homepages.math.uic.edu/~lreyzin/f14_mcs548/angluin88.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e1/63/e16333259bb4a688fe2568f0d757299846a3e696.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1023/a:1022821128753"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Page 8166 of Mathematical Reviews Vol. , Issue 2004j [page]

<span title="">2004</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
models of query learning: learning by a minimum adequate teacher (equivalence queries combined with membership queries) and learning by counterexamples (equivalence queries alone).  ...  , Frank (5-NSW-ICT; Sydney) Trees and learning.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2004-10_2004j/page/8166" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_2004-10_2004j/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

On learning unions of pattern languages and tree patterns in the mistake bound model

Sally A. Goldman, Stephen S. Kwek
<span title="">2002</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
We present e cient on-line algorithms for learning unions of a constant number of tree patterns, unions of a constant number of one-variable pattern languages, and unions of a constant number of pattern  ...  Also, our approach is quite general and we give results to learn a class that generalizes pattern languages.  ...  Tree patterns are also closely related to logic program representations [10, 25] . Using the exact learning model with membership and equivalence queries, Arimura et al.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(01)00402-9">doi:10.1016/s0304-3975(01)00402-9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/awgzad7vgbfaniqmq6hmw72b5q">fatcat:awgzad7vgbfaniqmq6hmw72b5q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922083531/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/010/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDMwNDM5NzUwMTAwNDAyOQ%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/da/6d/da6d83db1fa08e299a90e3b88b371bf20c35a14a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0304-3975(01)00402-9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Introduction to Active Automata Learning from a Practical Perspective [chapter]

Bernhard Steffen, Falk Howar, Maik Merten
<span title="">2011</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Characteristic for active learning automata learning is its iterative alternation between a "testing" phase for completing the transitions relation of the model aggregated from the observed behavior, and  ...  During exploration phases so-called membership queries are used to construct hypothesis models of a system under learning.  ...  Give an example of a learning process in which Algorithm 5 actually leads to an extension of the set of suffixes, and therefore to a refinement of the hypothesis automaton.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-21455-4_8">doi:10.1007/978-3-642-21455-4_8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/g5zdn7okxvgm7fj23avo2mbo6e">fatcat:g5zdn7okxvgm7fj23avo2mbo6e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809160521/http://www.falkhowar.de/papers/SFM2011-Introduction-to-Active-Automata-Learning-from-a-Practical-Perspective.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/77/72/7772a288de63124f3c0cd07b04b970019e1cfc03.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-21455-4_8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Identification of Tree Translation Rules from Examples [chapter]

Hiroshi Sakamoto, Hiroki Arimura, Setsuo Arikawa
<span title="">2000</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The ecient learnability of this system using membership and equivalence queries is shown.  ...  Two models for simple translation between ordered trees are introduced. First is that output is obtained from input by renaming labels and deleting nodes.  ...  Next, we show that if we allow a learner additional information obtained by active queries then the class of k-variable linear translation systems is polynomial time identiable using equivalence and membership  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-45257-7_20">doi:10.1007/978-3-540-45257-7_20</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/762qufzaebfypctrdupkpx5wzm">fatcat:762qufzaebfypctrdupkpx5wzm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190224120912/http://pdfs.semanticscholar.org/5805/25abcae17d429cd658d22646ebd6f6efe4d3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/58/05/580525abcae17d429cd658d22646ebd6f6efe4d3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-45257-7_20"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 1,093 results