-
1
-
-
84976832596
-
Inference of reversible languages
-
D. Angluin. Inference of reversible languages. J. Assoc. Comput. Mach., 29:741-765, 1982.
-
(1982)
J. Assoc. Comput. Mach
, vol.29
, pp. 741-765
-
-
Angluin, D.1
-
2
-
-
0023453626
-
Learning regular sets from queries and counterexamples
-
D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87-106, 1987.
-
(1987)
Information and Computation
, vol.75
, pp. 87-106
-
-
Angluin, D.1
-
3
-
-
0000710299
-
Queries and concept learning
-
D. Angluin. Queries and concept learning. Machine Learning, 2:319-342, 1988.
-
(1988)
Machine Learning
, vol.2
, pp. 319-342
-
-
Angluin, D.1
-
4
-
-
0025449393
-
Negative results for equivalence queries
-
D. Angluin. Negative results for equivalence queries. Machine Learning, 5:121-150, 1990.
-
(1990)
Machine Learning
, vol.5
, pp. 121-150
-
-
Angluin, D.1
-
5
-
-
84947900996
-
Simple pac learning of simple decision lists
-
Fukuoka, Japan, LNAI. Springer
-
J. Castro and J. L. Balcàzar. Simple pac learning of simple decision lists. In Sixth Internatinal Workshop, ALT'95, pages 239-248, Fukuoka, Japan, 1995. LNAI. Springer.
-
(1995)
Sixth Internatinal Workshop, ALT'95
, pp. 239-248
-
-
Castro, J.1
Balcàzar, J.L.2
-
6
-
-
0001930916
-
On the power of equivalence queries
-
LNAI. Springer
-
R. Gavaldà. On the power of equivalence queries. In EUROCOLT'93, pages 193-203. LNAI. Springer, 1993.
-
(1993)
EUROCOLT'93
, pp. 193-203
-
-
Gavaldà, R.1
-
7
-
-
84949211417
-
Uniform characterization of polynomial-query learnabilities
-
Fukuoka, Japan, LNAI. Springer
-
Y. Hayashi, S. Matsumoto, A. Shinoara, and M. Takeda. Uniform characterization of polynomial-query learnabilities. In First International Conference, DS'98, pages 84-92, Fukuoka, Japan, 1998. LNAI. Springer.
-
(1998)
First International Conference, DS'98
, pp. 84-92
-
-
Hayashi, Y.1
Matsumoto, S.2
Shinoara, A.3
Takeda, M.4
-
8
-
-
0030230237
-
How many queries are needed to learn
-
L. Hellerstein, K. Pillaipakkamnatt, V. Raghavan, and D. Wilkins. How many queries are needed to learn? Journal of the ACM, 43(5):840-862, 1996.
-
(1996)
Journal of the ACM
, vol.43
, Issue.5
, pp. 840-862
-
-
Hellerstein, L.1
Pillaipakkamnatt, K.2
Raghavan, V.3
Wilkins, D.4
-
9
-
-
0026238969
-
Learning simple concepts under simple distributions
-
M. Li and P. Vitányi. Learning simple concepts under simple distributions. SIAM Journal on Computing, 20(5):911-935, 1991.
-
(1991)
SIAM Journal on Computing
, vol.20
, Issue.5
, pp. 911-935
-
-
Li, M.1
Vitányi, P.2
-
10
-
-
0004471991
-
Learning decision lists an trees with equivalence queries
-
Barcelona, Spain, Lecture Notes in Artificial Intelligence
-
H. Simon. Learning decision lists an trees with equivalence queries. In Second European Conference, EuroCOLT'95, pages 322-336, Barcelona, Spain, 1995. Lecture Notes in Artificial Intelligence.
-
(1995)
Second European Conference, EuroCOLT'95
, pp. 322-336
-
-
Simon, H.1
-
11
-
-
0021518106
-
A theory of the learnable
-
L. Valiant. A theory of the learnable. Comm. ACM, 27:1134-1142, 1984.
-
(1984)
Comm. ACM
, vol.27
, pp. 1134-1142
-
-
Valiant, L.1
|