Naoki Abe  Home/Search
Context Related
| es.dis.titech.ac.jp/~abe/inform.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: es.dis.titech.ac.j...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The learnability of the class of letter-counts of regular languages (semilinear sets) and other related classes of subsets of N d with respect to the distribution-free learning model of Valiant (PAC-learning model) is characterized. Using the notion of reducibility among learning problems due to Pitt and Warmuth called "prediction preserving reducibility," and a special case thereof, a number of positive and partially negative results are obtained. On the positive side the class of semilinear ... (Update)
Cited by: More
Automata, Boolean Matrices, and Ultimate Periodicity - Zhang (Correct)
Active bibliography (related documents): More All
0.7: Learning Parallel Systems by Regular Trace Languages - Ferretti (Correct)
0.5: XTAG User Manual version 1.0 - An X Window Graphical.. - Schabes, Paroubek, Group (1997) (Correct)
0.3: A formula related to the Frobenius problem in two dimensions - Beck, Robins (2000) (Correct)
Similar documents based on text: More All
0.3: Polynomially Sparse Variations and Reducibility among.. - Abe, Watanabe (1992) (Correct)
0.3: Transient Behavior of the M/G/1 Workload Process - Abate, Whitt (1992) (Correct)
0.3: The Difference Operation on Semilinear Power Series - Petre (Correct)
Related documents from co-citation: More All
2: Regularity preserving functions (context) - Kosaraju
BibTeX entry: (Update)
N. Abe (1995), Characterizing PAC-learnability of semilinear sets. Inform. and Comput. 116, no. 1, 81--102. http://citeseer.ist.psu.edu/abe98characterizing.html More
@article{ abe95characterizing,
author = "Naoki Abe",
title = "Characterizing {PAC}-Learnability of Semilinear Sets",
journal = "Information and Computation",
volume = "116",
number = "1",
pages = "81-102",
year = "1995",
url = "citeseer.ist.psu.edu/abe98characterizing.html" }
Citations (may not include all citations):4212 Computers and Intractability -- A Guide to the Theory of NP-.. (context) - Garey, Johnson - 1979
537 A theory of the learnable (context) - Valiant - 1984
465 Learnability and the Vapnik-Chervonenkis dimension (context) - Blumer, Ehrenfeucht et al. - 1989
412 Language identification in the limit (context) - Gold - 1967
244 Learning regular sets from queries and counter-examples (context) - Angluin - 1987
151 A general lower bound on the number of examples needed for l.. (context) - Ehrenfeucht, Haussler et al. - 1989
144 Computational limitations on learning from examples (context) - Pitt, Valiant - 1988
139 A greedy heuristic for the set-covering problem (context) - Chvatal - 1979
127 Complexity of automaton identification from given data (context) - Gold - 1978
114 The Theory of Partitions (context) - Andrews - 1976
84 Learning disjunctions of conjunctions (context) - Valiant - 1985
81 Equivalence of models for polynomial learnability (context) - Haussler, Kearns et al. - 1991
81 the complexity of minimum inference of regular sets (context) - Angluin - 1978
59 Prediction preserving reducibility (context) - Pitt, Warmuth - 1990
57 Systems That Learn (context) - Osherson, Stob et al. - 1986
54 Learning conjunctive concepts in structural domains (context) - Haussler - 1989
49 Functions on randomly drawn points (context) - Haussler, Littlestone et al. - 1988
45 The minimum consistent DFA problem cannot be approximated wi.. (context) - Pitt, Warmuth - 1989
29 Learning nested differences of intersection closed concept c.. (context) - Helmbold, Sloan et al. - 1990
27 Learning integer lattices (context) - Helmbold, Sloan et al. - 1992
9 bounded context-free grammars (context) - Angluin - 1987
8 Information and Control (context) - Osherson, Weinstein - 1982
7 personal communication (context) - Pitt
4 Language generating devices (context) - Parikh - 1961
4 personal communication (context) - Warmuth
3 Representation of integers by linear forms in nonnegative in.. (context) - Nijenhuis, Wilf - 1972
2 Polynomial learnability of formal languages (context) - Abe - 1989
2 Learning commutative deterministic finite state automata in .. (context) - Abe - 1991
1 Money changing problem is NP-Complete (context) - Abe - 1987
Documents on the same site (http://www.es.dis.titech.ac.jp/~abe/publications.html):
Polynomially Sparse Variations and Reducibility among.. - Abe, Watanabe (1992) (Correct)
On the Computational Complexity of Approximating Distributions .. - Abe, Warmuth (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC