LEADER 04002nam 2200613 a 450 001 9910483095403321 005 20200520144314.0 010 $a3-540-46650-9 024 7 $a10.1007/11894841 035 $a(CKB)1000000000283727 035 $a(SSID)ssj0000316163 035 $a(PQKBManifestationID)11242657 035 $a(PQKBTitleCode)TC0000316163 035 $a(PQKBWorkID)10263865 035 $a(PQKB)11188109 035 $a(DE-He213)978-3-540-46650-5 035 $a(MiAaPQ)EBC3068510 035 $a(PPN)123139112 035 $a(EXLCZ)991000000000283727 100 $a20060830d2006 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithmic learning theory $e17th international conference, ALT 2006, Barcelona, Spain, October 7-10, 2006 : proceedings /$fJose L. Balcazar, Philip M. Long, Frank Stephan, eds 205 $a1st ed. 2006. 210 $aBerlin $cSpringer$d2006 215 $a1 online resource (XIII, 393 p.) 225 1 $aLecture notes in computer science. Lecture notes in artificial intelligence,$x0302-9743 ;$v4264 225 1 $aLNCS sublibrary. SL 7, Artificial intelligence 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-46649-5 320 $aIncludes bibliographical references and index. 327 $aEditors? Introduction -- Editors? Introduction -- Invited Contributions -- Solving Semi-infinite Linear Programs Using Boosting-Like Methods -- e-Science and the Semantic Web: A Symbiotic Relationship -- Spectral Norm in Learning Theory: Some Selected Topics -- Data-Driven Discovery Using Probabilistic Hidden Variable Models -- Reinforcement Learning and Apprenticeship Learning for Robotic Control -- Regular Contributions -- Learning Unions of ?(1)-Dimensional Rectangles -- On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle -- Active Learning in the Non-realizable Case -- How Many Query Superpositions Are Needed to Learn? -- Teaching Memoryless Randomized Learners Without Feedback -- The Complexity of Learning SUBSEQ (A) -- Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data -- Learning and Extending Sublanguages -- Iterative Learning from Positive Data and Negative Counterexamples -- Towards a Better Understanding of Incremental Learning -- On Exact Learning from Random Walk -- Risk-Sensitive Online Learning -- Leading Strategies in Competitive On-Line Prediction -- Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring -- General Discounting Versus Average Reward -- The Missing Consistency Theorem for Bayesian Learning: Stochastic Model Selection -- Is There an Elegant Universal Theory of Prediction? -- Learning Linearly Separable Languages -- Smooth Boosting Using an Information-Based Criterion -- Large-Margin Thresholded Ensembles for Ordinal Regression: Theory and Practice -- Asymptotic Learnability of Reinforcement Problems with Arbitrary Dependence -- Probabilistic Generalization of Simple Grammars and Its Application to Reinforcement Learning -- Unsupervised Slow Subspace-Learning from Stationary Processes -- Learning-Related Complexity of Linear Ranking Functions. 410 0$aLecture notes in computer science.$pLecture notes in artificial intelligence ;$v4264. 410 0$aLNCS sublibrary.$nSL 7,$pArtificial intelligence. 517 3 $aALT 2006 606 $aComputer algorithms$vCongresses 606 $aMachine learning$vCongresses 615 0$aComputer algorithms 615 0$aMachine learning 676 $a006.31 701 $aBalcazar$b Jose Luis$01753945 701 $aLong$b Philip M$01763084 701 $aStephan$b Frank$g(Frank Christian)$01763085 712 12$aALT 2006 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483095403321 996 $aAlgorithmic learning theory$94203344 997 $aUNINA