Algorithmic Learning Theory
for ALT 2000 in
Theoretical Computer Science
Algorithmic Learning Theoryfor ALT 2000 in Theoretical Computer Science |
|
|
appeared as:
The Special Issue on Algorithmic Learning Theory for ALT 2000 has been edited by Hiroki Arimura and Sanjay Jain. |
|
H. Arimura and S. Jain.
Preface, | pp. 1-2 |
|
|
|
|
Osamu Watanabe,
Sequential sampling techniques for algorithmic learning theory, Abstract. | pp. 3-14 |
|
|
|
|
Steffen Lange,
Gunter Grieser and
Thomas Zeugmann,
Inductive inference of approximations for recursive concepts, Abstract. | pp. 15-40 |
|
|
|
|
Jochen Nessel and Steffen Lange,
Learning erasing pattern languages with queries, Abstract. | pp. 41-57 |
|
|
|
|
Ken Satoh,
Learning taxonomic relation by case-based reasoning, Abstract. | pp. 58-69 |
|
|
|
|
François Denis,
Rémi Gilleron and Fabien Letouzey,
Learning from positive and unlabeled examples, Abstract. | pp. 70-83 |
|
|
|
|
Kouichi Hirata,
Prediction-hardness of acyclic conjunctive queries, Abstract. | pp. 84-94 |
|
|
|
|
Bhaskar DasGupta and
Barbara Hammer,
On approximate learning by multi-layered feedforward circuits, Abstract. | pp. 95-127 |
|
|
|
 back to the ALT
Archives page
|
