| 2000 | Conceptual Classifications Guided by a Concept Hierarchy. | Yuhsuke Itoh, Makoto Haraguchi |
| 2000 | On the Hardness of Learning Acyclic Conjunctive Queries. | Kouichi Hirata |
| 2000 | Learning Recursive Concepts with Anomalies. | Gunter Grieser, Steffen Lange, Thomas Zeugmann |
| 2000 | Self-Duality of Bounded Monotone Boolean Functions and Related Problems. | Daya Ram Gaur, Ramesh Krishnamurti |
| 2000 | Towards an Algorithmic Statistics. | Pter Gcs, John Tromp, Paul M. B. Vitnyi |
| 2000 | Minimum Message Length Grouping of Ordered Data. | Leigh J. Fitzgibbon, Lloyd Allison, David L. Dowe |
| 2000 | Identification of Function Distinguishable Languages. | Henning Fernau |
| 2000 | A Note on the Generalization Performance of Kernel Classifiers with Margin. | Theodoros Evgeniou, Massimiliano Pontil |
| 2000 | The Divide-and-Conquer Manifesto. | Thomas G. Dietterich |
| 2000 | On Approximate Learning by Multi-layered Feedforward Circuits. | Bhaskar DasGupta, Barbara Hammer |
| 2000 | Extracting Information from the Web for Concept Learning and Collaborative Filtering. | William W. Cohen |
| 2000 | Rough Sets and Ordinal Classification. | Jan C. Bioch, Viara Popova |
| 1999 | Extended Stochastic Complexity and Minimax Relative Loss Analysis. | Kenji Yamanishi |
| 1999 | The Computational Limits to the Cognitive Power of the Neuroidal Tabula Rasa. | Jir Wiedermann |
| 1999 | Inductive Learning with Corroboration. | Phil Watson |
| 1999 | Algebraic Analysis for Singular Statistical Estimation. | Sumio Watanabe |
| 1999 | Predicting Nearly as well as the best Pruning of a Planar Decision Graph. | Eiji Takimoto, Manfred K. Warmuth |
| 1999 | On the Uniform Learnability of Approximations to Non-Recursive Functions. | Frank Stephan, Thomas Zeugmann |
| 1999 | Theoretical Views of Boosting and Applications. | Robert E. Schapire |
| 1999 | Induction of Logic Programs Based on psi-Terms. | Yutaka Sasaki |
| 1999 | Learning from Random Text. | Peter Rossmanith |
| 1999 | A Note on Support Vector Machine Degeneracy. | Ryan M. Rifkin, Massimiliano Pontil, Alessandro Verri |
| 1999 | Complexity in the Case against Accuracy: When Building one Function-Free Horn Clause is as Hard as Any. | Richard Nock |
| 1999 | Learnability of Enumerable Classes of Recursive Functions from "Typical" Examples. | Jochen Nessel |
| 1999 | A Method of Similarity-Driven Knowledge Revision for Type Specializations. | Nobuhiro Morita, Makoto Haraguchi, Yoshiaki Okubo |