Editors' Introduction | | 1 - 9
|
Nicolò Cesa-Bianchi,
Masayuki Numao, and
Rüdiger Reischuk
|
| |
|
| |
|
INVITED PAPERS
| |
|
| |
|
Mathematics Based on Learning,
Abstract.
| | 7 - 21
|
Susumu Hayashi
| |
|
Data Mining with Graphical Models,
Abstract.
| | 22 - 22
|
Rudolf Kruse
and Christian Borgelt.
| |
|
On the Eigenspectrum of the Gram Matrix and Its Relationship to the Operator Eigenspectrum,
Abstract.
| | 23 - 40
|
John Shawe-Taylor,
Chris Williams, Nello Cristianini and Jaz Kandola
| |
|
In Search of the Horowitz Factor: Interim Report on a Musical Discovery Project,
Abstract.
| | 41 - 41
|
Gerhard Widmer.
| |
|
Learning Structure from Sequences, with Applications in a Digital Library,
Abstract.
| | 42 - 56
|
Ian H. Witten
|
| |
|
| |
|
REGULAR
CONTRIBUTIONS
| |
|
| |
|
|
| |
|
| |
|
Learning Boolean Functions
| |
|
| |
|
On Learning Monotone Boolean Functions under the Uniform Distribution,
Abstract.
| | 57 - 68
|
Kazuyuki Amano,
and Akira Maruoka.
| |
|
On Learning Embedded Midbit Functions,
Abstract.
| | 69 - 82
|
Rocco A. Servedio.
| |
|
Maximizing Agreements and CoAgnostic Learning,
Abstract.
| | 83 - 97
|
Nader H. Bshouty and
Lynn Burroughs.
|
| |
|
| |
|
Boosting and Margin-Based Learning
| |
|
| |
|
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning,
Abstract.
| | 98 - 112
|
Dmitry Gavinsky.
|
Large Margin Classification for Moving Targets,
Abstract.
| | 113 - 127
|
Jyrki Kivinen,
Alex J. Smola and
Robert C. Williamson
| |
|
On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution,
Abstract.
| | 128 - 138
|
Jürgen Forster and
Hans Ulrich Simon
|
| |
|
| |
|
Learning with Queries
| |
|
| |
|
A General Dimension for Approximately Learning Boolean Functions,
Abstract.
| | 139 - 148
|
Johannes Köbler and
Wolfgang Lindner.
| |
|
The Complexity of Learning Concept Classes with Polynomial General Dimension,
Abstract.
| | 149 - 163
|
Johannes Köbler and
Wolfgang Lindner.
| |
|
On the Absence of Predictive Complexity for Some Games,
Abstract.
| | 164 - 172
|
Yuri Kalnishkan and
Michael V. Vyugin.
|
| |
|
| |
|
Learning abd Information Extraction
| |
|
| |
|
Consistency Queries in Information Extraction,
Abstract.
| | 173 - 187
|
Gunter Grieser, Klaus P. Jantke, and
Steffen Lange.
| |
|
Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data,
Abstract.
| | 188 - 202
|
Yusuke Suzuki,
Takayoshi Shoudai,
Tomoyuki Uchida and Tetsuhiro Miyahara
|
| |
|
| |
|
Inductive Inference
| |
|
| |
|
Reflective Inductive Inference of Recursive Functions,
Abstract.
| | 203 - 217
|
Gunter Grieser.
| |
|
Classes with Easily Learnable Subclasses,
Abstract.
| | 218 - 232
|
Sanjay Jain,
Wolfram Menzel and
Frank Stephan.
| |
|
On the Learnability of Vector Spaces,
Abstract.
| | 233 - 247
|
Valentina S. Harizanov and
Frank Stephan.
| |
|
Learning, Logic, and Topology in a Common Framework,
Abstract.
| | 248 - 262
|
Eric Martin,
Arun Sharma, and
Frank Stephan.
|
| |
|
| |
|
Inductive Logic Programming
| |
|
| |
|
A Pathology of Bottom-Up Hill-Climbing in Inductive Rule Learning,
Abstract.
| | 263 - 277
|
Johannes Fürnkranz.
| |
|
Minimised Residue Hypotheses in Relevant Logic,
Abstract.
| | 278 - 292
|
Bertram Fronhöfer
and
Akihiro Yamamoto.
|
| |
|
| |
|
Language Learning
| |
|
| |
|
Compactness and Learning of Classes of Unions of Erasing Regular Pattern Languages,
Abstract.
| | 293 - 307
|
Jin Uemura and Masako Sato.
| |
|
A Negative Result on Inductive Inference of Extended Pattern Languages,
Abstract.
| | 308 - 320
|
Daniel Reidenbach.
|
| |
|
| |
|
Statistical Learning
| |
|
| |
|
RBF Neural Networks and Descartes' Rule of Signs,
Abstract.
| | 321 - 335
|
Michael Schmitt
| |
|
Asymptotic Optimality of Transductive Confidence Machine,
Abstract.
| | 336 - 350
|
Vladimir Vovk.
| |
|
An Efficient PAC Algorithm for Reconstructing a Mixture of Lines,
Abstract.
| | 351 - 364
|
Sanjoy Dasgupta,
Elan Pavlov,
and
Yoram Singer.
| |
|
Constraint Classification: A New Approach to Multiclass Classification,
Abstract.
| | 365 - 379
|
Sariel Har-Peled,
Dan Roth,
and
Dav Zimak.
| |
|
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution,
Abstract.
| | 380 - 394
|
Dietrich Braess,
Jürgen Forster,
Tomas Sauer,
and
Hans U. Simon.
|
| |
|
| |
|
Applications and Heuristics
| |
|
| |
|
Classification with Intersecting Rules
,
Abstract.
| | 395 - 402
|
Tony Lindgren and
Henrik Boström.
| |
|
Feedforward Neural Networks in Reinforcement Learning Applied to High-Dimensional Motor Control,
Abstract.
| | 403 - 414
|
Rémi Coulom.
| |
|
Author Index
| | 415
|