LEADER 04714nam 22007455 450 001 9910767545003321 005 20250730104810.0 010 $a1-280-80456-4 010 $a9786610804566 010 $a3-540-46769-6 024 7 $a10.1007/3-540-46769-6 035 $a(CKB)1000000000211187 035 $a(EBL)3036569 035 $a(SSID)ssj0000288523 035 $a(PQKBManifestationID)11231401 035 $a(PQKBTitleCode)TC0000288523 035 $a(PQKBWorkID)10381275 035 $a(PQKB)10162948 035 $a(DE-He213)978-3-540-46769-4 035 $a(MiAaPQ)EBC3036569 035 $a(MiAaPQ)EBC6489632 035 $a(PPN)155189530 035 $a(BIP)46081660 035 $a(BIP)6331274 035 $a(EXLCZ)991000000000211187 100 $a20121227d1999 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithmic Learning Theory $e10th International Conference, ALT '99 Tokyo, Japan, December 6-8, 1999 Proceedings /$fedited by Osamu Watanabe, Takashi Yokomori 205 $a1st ed. 1999. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1999. 215 $a1 online resource (374 p.) 225 1 $aLecture Notes in Artificial Intelligence,$x2945-9141 ;$v1720 300 $aDescription based upon print version of record. 311 08$a3-540-66748-2 320 $aIncludes bibliographical references and index. 327 $aInvited Lectures -- Tailoring Representations to Different Requirements -- Theoretical Views of Boosting and Applications -- Extended Stochastic Complexity and Minimax Relative Loss Analysis -- Regular Contributions -- Algebraic Analysis for Singular Statistical Estimation -- Generalization Error of Linear Neural Networks in Unidentifiable Cases -- The Computational Limits to the Cognitive Power of the Neuroidal Tabula Rasa -- The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract) -- The VC-Dimension of Subclasses of Pattern Languages -- On the V ? Dimension for Regression in Reproducing Kernel Hilbert Spaces -- On the Strength of Incremental Learning -- Learning from Random Text -- Inductive Learning with Corroboration -- Flattening and Implication -- Induction of Logic Programs Based on ?-Terms -- Complexity in the Case Against Accuracy: When Building One Function-Free Horn Clause Is as Hard as Any -- A Method of Similarity-Driven Knowledge Revision for Type Specializations -- PAC Learning with Nasty Noise -- Positive and Unlabeled Examples Help Learning -- Learning Real Polynomials with a Turing Machine -- Faster Near-Optimal Reinforcement Learning: Adding Adaptiveness to the E3 Algorithm -- A Note on Support Vector Machine Degeneracy -- Learnability of Enumerable Classes of Recursive Functions from ?Typical? Examples -- On the Uniform Learnability of Approximations to Non-recursive Functions -- Learning Minimal Covers of Functional Dependencies with Queries -- Boolean Formulas Are Hard to Learn for Most Gate Bases -- Finding Relevant Variables in PAC Model with Membership Queries -- General Linear Relations among Different Types of Predictive Complexity -- Predicting Nearly as Well as the Best Pruning of a Planar Decision Graph -- On Learning Unionsof Pattern Languages and Tree Patterns. 330 $aThis book constitutes the refereed proceedings of the 10th International Conference on Algorithmic Learning Theory, ALT'99, held in Tokyo, Japan, in December 1999.The 26 full papers presented were carefully reviewed and selected from a total of 51 submissions. Also included are three invited papers. The papers are organized in sections on Learning Dimension, Inductive Inference, Inductive Logic Programming, PAC Learning, Mathematical Tools for Learning, Learning Recursive Functions, Query Learning and On-Line Learning. 410 0$aLecture Notes in Artificial Intelligence,$x2945-9141 ;$v1720 606 $aArtificial intelligence 606 $aMachine theory 606 $aAlgorithms 606 $aArtificial Intelligence 606 $aFormal Languages and Automata Theory 606 $aAlgorithms 615 0$aArtificial intelligence. 615 0$aMachine theory. 615 0$aAlgorithms. 615 14$aArtificial Intelligence. 615 24$aFormal Languages and Automata Theory. 615 24$aAlgorithms. 676 $a006.3/1 702 $aWatanabe$b Osamu$f1958- 702 $aYokomori$b Takashi 712 12$aALT'99 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910767545003321 996 $aAlgorithmic Learning Theory$9771965 997 $aUNINA LEADER 00955nam2 2200313 450 001 996681171703316 005 20251026143549.0 100 $a20250909d1980----km y0itay5003 ba 101 0 $aita 102 $aIT 105 $ay 00 y 200 1 $aIvo Andric$f[a cura di Bruno Meriggi] 210 $aMilano$cClub degli editori$d1980 215 $aXXXI, 735 p.$c1 ritratto$d20 cm 225 2 $aPremi Nobel 300 $aIn copertina: 1961 300 $aEdizione speciale del Club degli Editori su licenza della Arnoldo Mondadori editore 300 $aContiene: Il ponte sulla Drina ; Racconti. 410 0$1001996673778603316$12001$aPremi Nobel 676 $a891.82 700 1$aANDRIC,$bIvo$0440622 702 1$aMERIGGI,$bBruno$f<1927-1970> 801 0$aIT$bcba$gREICAT 912 $a996681171703316 951 $aXVI.7. Coll. 32/ 54$bFBUO$cXVI.7. Coll. 959 $aBK 969 $aFBUO 996 $aIvo Andric$93616693 997 $aUNISA