04002nam 2200613 a 450 991048309540332120200520144314.03-540-46650-910.1007/11894841(CKB)1000000000283727(SSID)ssj0000316163(PQKBManifestationID)11242657(PQKBTitleCode)TC0000316163(PQKBWorkID)10263865(PQKB)11188109(DE-He213)978-3-540-46650-5(MiAaPQ)EBC3068510(PPN)123139112(EXLCZ)99100000000028372720060830d2006 uy 0engurnn|008mamaatxtccrAlgorithmic learning theory 17th international conference, ALT 2006, Barcelona, Spain, October 7-10, 2006 : proceedings /Jose L. Balcazar, Philip M. Long, Frank Stephan, eds1st ed. 2006.Berlin Springer20061 online resource (XIII, 393 p.) Lecture notes in computer science. Lecture notes in artificial intelligence,0302-9743 ;4264LNCS sublibrary. SL 7, Artificial intelligenceBibliographic Level Mode of Issuance: Monograph3-540-46649-5 Includes bibliographical references and index.Editors’ 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.Lecture notes in computer science.Lecture notes in artificial intelligence ;4264.LNCS sublibrary.SL 7,Artificial intelligence.ALT 2006Computer algorithmsCongressesMachine learningCongressesComputer algorithmsMachine learning006.31Balcazar Jose Luis1753945Long Philip M1763084Stephan Frank(Frank Christian)1763085ALT 2006MiAaPQMiAaPQMiAaPQBOOK9910483095403321Algorithmic learning theory4203344UNINA