Articoli correlati a Algorithmic Learning Theory: 9th International Conference,...

Algorithmic Learning Theory: 9th International Conference, ALT'98, Otzenhausen, Germany, October 8-10, 1998 Proceedings - Brossura

 
9783662164655: Algorithmic Learning Theory: 9th International Conference, ALT'98, Otzenhausen, Germany, October 8-10, 1998 Proceedings

Al momento non sono disponibili copie per questo codice ISBN.

Sinossi

Table of Contents Editors'Introduction M.M. Richter, C.H. Smith, R. Wiehagen, and T. Zeugmann Inductive Logic Programming and Data Mining Scalability Issues in Inductive Logic Programming (Invited Lecture) S. Wrobel Inductive Inference Learning to Win Process-Control Games Watching Game-Masters J. Case, M. Ott, A. Sharma, and F. Stephan Closedness Properties in EX-identification of Recursive Functions K. Apsitis, R. Freivalds, R. Simanovskis, and J. Smotrovs Learning via Queries Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries V.N. Shevchenko, and N.Yu. Zolotykh Cryptographic Limitations on Parallelizing Membership and Equivalence Queries with Applications to Random Self-Reductions M. Fischlin Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries G. Melideo, and S. Varricchio Computational Aspects of Parallel Attribute-Efficient Learning P. Damaschke PAC Learning from Positive Statistical Queries F. Denis Prediction Algorithms Structured Weight-Based Prediction Algorithms (Invited Lecture) A. Maruoka, and E. Takimoto Inductive Logic Programming Learning from Entailment of Logic Programs with Local Variables M.K.R. Krishna Rao, and A. Sattar Logical Aspects of Several Bottom-Up Fittings A. Yamamoto Learnability of Translations from Positive Examples N. Sugimoto Analysis of Case-Based Representability of Boolean Functions by Monotone Theory K. Satoh Learning Formal Languages Locality, Reversibility, and Beyond: Learning Languages from Positive Data T. Head, S. Kobayashi, and T. Yokomori Synthesizing Learners Tolerating Computable Noisy Data J. Case, and S. Jain Characteristic Sets for Unions of Regular Pattern Languages and Compactness M. Sato, Y. Mukouchi, and D. Zheng Finding a One-Variable Pattern from Incomplete Data H. Sakamoto A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases H. Arimura, A. Wataki, R. Fujino, and S. Arikawa Inductive Inference A Comparison of IdentificationCriteria for Inductive Inference of Recursive Real-Valued Functions E. Hirowatari, and S. Arikawa Predictive Learning Models for Concept Drift J. Case, S. Jain, S. Kaufmann, A. Sharma, and F. Stephan Learning with Refutation S. Jain Comparing the Power of Probabilistic Learning and Oracle Identification under Monotonicity Constraints L. Meyer Learning Algebraic Structures from Text Using Semantical Knowledge F. Stephan and Y. Ventsov Inductive Logic Programming Lime: A System for Learning Relations (Invited Lecture) E. McCreath, and A. Sharma Miscellaneous On the Sample Complexity for Neural Trees M. Schmitt Learning Sub-Classes of Monotone DNF on the Uniform Distribution K. Verbeurgt Using Attribute Grammars for Description of Inductive Inference Search Space U. Sarkans, and J. Barzdins Towards the Validation of Inductive Learning Systems G. Grieser, K.P. Jantke, and S. Lange Consistent Polynomial Identification in the Limit W. Stein Author Index

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

(nessuna copia disponibile)

Cerca:



Inserisci un desiderata

Non riesci a trovare il libro che stai cercando? Continueremo a cercarlo per te. Se uno dei nostri librai lo aggiunge ad AbeBooks, ti invieremo una notifica!

Inserisci un desiderata

Altre edizioni note dello stesso titolo

9783540650133: Algorithmic Learning Theory: 9th International Conference, ALT '98, Otzenhausen, Germany, October 8-10, 1998, Proceedings: 1501

Edizione in evidenza

ISBN 10:  354065013X ISBN 13:  9783540650133
Casa editrice: Springer, 2008
Brossura