Filters








19,781 Hits in 4.9 sec

Query learning of derived ω-tree languages in polynomial time [article]

Dana Angluin, Timos Antonopoulos, Dana Fisman
2019 arXiv   pre-print
The method is a general polynomial time reduction of learning a class of derived ω-tree languages to learning the underlying class of ω-word languages, for any class of ω-word languages recognized by a  ...  Specifically, our algorithm uses membership and equivalence queries to learn classes of ω-tree languages derived from weak regular ω-word languages in polynomial time.  ...  [14] proposed a direct application of L * to learn the full class of regular ω-languages.  ... 
arXiv:1802.04739v2 fatcat:ynt3mozptfcyjbzdau7pz4hz5i

Learning of Elementary Formal Systems with Two Clauses Using Queries [chapter]

Hirotaka Kato, Satoshi Matsumoto, Tetsuhiro Miyahara
2005 Lecture Notes in Computer Science  
An elementary formal system, EFS for short, is a kind of logic program over strings, and regarded as a set of rules to generate a language. For an  ...  We introduce the exact learning model via queries due to Angluin [2] .  ...  The work [8] deals with a class of EFSs under the exact learning model using equivalence and extensions of membership queries.  ... 
doi:10.1007/11564089_18 fatcat:m33jopriffdnnog4xhgxbll7e4

Learnability of Kolmogorov-easy circuit expressions via queries [chapter]

José L. Balcázar, Harry Buhrman, Montserrat Hermo
1995 Lecture Notes in Computer Science  
Circuit expressions were introduced to provide a natural link between Computational Learning and certain aspects of Structural Complexity.  ...  We also exactly characterize the sets that have such circuit expressions, and precisely identify the subclass whose circuit expressions can be learned from membership queries alone.  ...  Introduction This paper presents algorithms to learn circuit expressions in the \learning via queries" model of Computational Learning.  ... 
doi:10.1007/3-540-59119-2_172 fatcat:lum6nk4mrve6xgzwk6ghtemfau

Learning indexed families of recursive languages from positive data: A survey

Steffen Lange, Thomas Zeugmann, Sandra Zilles
2008 Theoretical Computer Science  
One line of research focuses on indexed families of recursive languages -classes of recursive languages described in a representation scheme for which the question of membership for any string in any of  ...  Such language classes are of interest because of their naturalness.  ...  Many thanks are also due to Robert Holte for his comments on a draft version. Both helped to improve the paper significantly. Sandra Zilles was supported by the Alberta Ingenuity Fund.  ... 
doi:10.1016/j.tcs.2008.02.030 fatcat:jzsqdyddvrbz3bhwxeukqnrty4

Learning of Elementary Formal Systems with Two Clauses Using Queries

Hirotaka KATO, Satoshi MATSUMOTO, Tetsuhiro MIYAHARA
2009 IEICE transactions on information and systems  
The class rEFS contains the class of regular patterns, which is extensively studied in Learning Theory. Let Γ * be a target EFS in rEFS of learning.  ...  We consider a new form of EFS, called a restricted twoclause EFS, and denote by rEFS the set of all restricted two-clause EFSs. Then we study the learnability of rEFS in the exact learning model.  ...  Even if we consider only reduced EFSs, the expressive power of EFSs is the same. So we assume that target EFSs are reduced. We introduce the exact learning model via queries due to Angluin [2] .  ... 
doi:10.1587/transinf.e92.d.172 fatcat:efvftkmxzfdd5gptfhp23oxmla

Local Generic Representation for Face Recognition with Single Sample per Person [chapter]

Pengfei Zhu, Meng Yang, Lei Zhang, Il-Yong Lee
2015 Lecture Notes in Computer Science  
Face recognition with single sample per person (SSPP) is a very challenging task because in such a scenario it is difficult to predict the facial variations of a query sample by the gallery samples.  ...  Since the intra-class variations cannot be well estimated in the SSPP problem, the traditional discriminative subspace learning based FR methods can fail ⋆ Corresponding author.  ...  The algorithm of local generic representation (LGR) based classification. Input: The query sample z, gallery set X, reference subset G r , variation subset G v and regularization parameter λ.  ... 
doi:10.1007/978-3-319-16811-1_3 fatcat:zl22jfq3jjfptmmaigobu2n5pq

PR-OWL: A Bayesian Ontology Language for the Semantic Web [chapter]

Paulo Cesar G. da Costa, Kathryn B. Laskey, Kenneth J. Laskey
2008 Lecture Notes in Computer Science  
This paper addresses a major weakness of current technologies for the Semantic Web, namely the lack of a principled means to represent and reason about uncertainty.  ...  PR-OWL will move beyond the current limitations of deterministic classical logic to a full first-order probabilistic logic.  ...  Such a representation could be used by a Bayesian tool (acting as a probabilistic ontology reasoner) to perform inferences to answer queries and/or to learn from newly incoming evidence via Bayesian learning  ... 
doi:10.1007/978-3-540-89765-1_6 fatcat:azbyns4ftfdlvbunfm4kr2mceu

Semantic Regularization: Improve Few-shot Image Classification by Reducing Meta Shift [article]

Da Chen, Yongliang Yang, Zunlei Feng, Xiang Wu, Mingli Song, Wenbin Li, Yuan He, Hui Xue, Feng Mao
2020 arXiv   pre-print
To avoid this problem, we propose a concise Semantic RegularizationNetwork to learn a common semantic space under the framework of meta-learning.  ...  In this space, all class descriptors can be regularized by the learned semantic basis, which can effectively solve the meta shift problem.  ...  Finally, The obtained class descriptors are applied to classify the query samples via a metric module which combines a fixed distance metric and a trainable relation module.  ... 
arXiv:1912.08395v2 fatcat:gfo67ovdcvhjbhjnkge56wvolu

10 Years of Probabilistic Querying – What Next? [chapter]

Martin Theobald, Luc De Raedt, Maximilian Dylla, Angelika Kimmig, Iris Miliaraki
2013 Lecture Notes in Computer Science  
While probabilistic databases have focused on describing tractable query classes based on the structure of query plans and data lineage, probabilistic programming has contributed sophisticated inference  ...  Moreover, we believe that natural-language processing and information extraction will remain a driving factor and in fact a longstanding challenge for developing expressive representation models which  ...  and often require just a handful of fairly simple regular expressions for the extraction step.  ... 
doi:10.1007/978-3-642-40683-6_1 fatcat:lofuquzqgbb4hcjtjeqydyakbe

Automated assume-guarantee reasoning for omega-regular systems and specifications

Sagar Chaki, Arie Gurfinkel
2011 Innovations in Systems and Software Engineering  
We develop two learning algorithms for a class of systems, called ∞-regular systems, that combine finite and infinite behaviors.  ...  We develop a learning-based automated Assume-Guarantee (AG) reasoning framework for verifying ω-regular properties of concurrent systems.  ...  The family of active learning algorithms was originated by Angluin via L * [2] for learning a minimal DFA that accepts an unknown regular language.  ... 
doi:10.1007/s11334-011-0148-1 fatcat:mozrp3cw3jgxpluvj2622bdhze

Inferring answers to queries

William I. Gasarch, Andrew C. Y. Lee
1997 Proceedings of the tenth annual conference on Computational learning theory - COLT '97  
For a given class of computable functions, we consider the learning (in the limit) of properties of these functions that can be captured by queries formulated in a logical language L.  ...  In addition, our techniques can be used to prove a general lemma about query inference [W. Gasarch, C. Smith, Learning via queries, J. ACM 39 (1992) 649-676].  ...  We thank John Case, Jim Royer, and Frank Stephan for discussion of the primitive recursive recursion theorem.  ... 
doi:10.1145/267460.267512 dblp:conf/colt/GasarchL97 fatcat:frsqw5fc3bbuxfi5ezxufdxgui

Grammatical Inference and Language Frameworks for LANGSEC

Dr. Kerry N. Wood, Dr. Richard E. Harang
2015 2015 IEEE Security and Privacy Workshops  
Applicable Otherwise known as membership queries. Given a string, can it be efficiently (polynomial time) determined if the string is a member of the target language?  ...  Finally, we present initial results of pattern language learning on logged HTTP sessions and suggest future areas of research.  ...  At times, we will refer to a class via set notation ሺࣦሻ and others via an indexed set of languages ሺॷ ଵ ǡ ॷ ଶ ǥ ሻ.  ... 
doi:10.1109/spw.2015.17 dblp:conf/sp/WoodH15 fatcat:paiqhvsx6vcifc7f6vzkurbbl4

Inferring answers to queries

William I. Gasarch, Andrew C.Y. Lee
2008 Journal of computer and system sciences (Print)  
For a given class of computable functions, we consider the learning (in the limit) of properties of these functions that can be captured by queries formulated in a logical language L.  ...  In addition, our techniques can be used to prove a general lemma about query inference [W. Gasarch, C. Smith, Learning via queries, J. ACM 39 (1992) 649-676].  ...  We thank John Case, Jim Royer, and Frank Stephan for discussion of the primitive recursive recursion theorem.  ... 
doi:10.1016/j.jcss.2007.06.009 fatcat:ce472uxhqnao5pfqzmql5tli6m

Constructive Learning of Context-Free Languages with a Subpansive Tree [chapter]

Noriko Sugimoto, Takashi Toyoshima, Shinichi Shimozono, Kouichi Hirata
2000 Lecture Notes in Computer Science  
We formalize subpansive trees as background knowledge of CFGs, and investigate query learning of CFGs with the help of subpansive trees.  ...  We show a restricted class of CFGs, which we call hierarchical CFGs, is efficiently learnable, while it is unlikely to be polynomial-time predictable.  ...  A family G of CFGs is said to be polynomial-time learnable via equivalence and nonterminal membership queries if there exists a learning algorithm that use both equivalence and nonterminal membership queries  ... 
doi:10.1007/978-3-540-45257-7_22 fatcat:zin6dd722ngktmyjppnyul62pq

Spartans: Single-Sample Periocular-Based Alignment-Robust Recognition Technique Applied to Non-Frontal Scenarios

Felix Juefei-Xu, Khoa Luu, Marios Savvides
2015 IEEE Transactions on Image Processing  
, a top score among image-restricted and unsupervised protocols.  ...  Our Spartans framework starts by utilizing one single sample per subject class, and generate new face images under a wide range of 3D rotations using the 3D generic elastic model which is both accurate  ...  Following this, optimal feature subset is selected using Laplacian regularized A-optimality.  ... 
doi:10.1109/tip.2015.2468173 pmid:26285149 fatcat:rkk57tr6inezjh3zzs3qutex2a
« Previous Showing results 1 — 15 out of 19,781 results