04990nam 22007335 450 99646602170331620200705153848.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)99100000000028372720100301d2006 u| 0engurnn|008mamaatxtccrAlgorithmic Learning Theory[electronic resource] 17th International Conference, ALT 2006, Barcelona, Spain, October 7-10, 2006, Proceedings /edited by José L. Balcázar, Philip M. Long, Frank Stephan1st ed. 2006.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2006.1 online resource (XIII, 393 p.) Lecture Notes in Artificial Intelligence ;4264Bibliographic 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 Artificial Intelligence ;4264Artificial intelligenceComputersAlgorithmsMathematical logicNatural language processing (Computer science)Artificial Intelligencehttps://scigraph.springernature.com/ontologies/product-market-codes/I21000Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Mathematical Logic and Formal Languageshttps://scigraph.springernature.com/ontologies/product-market-codes/I16048Natural Language Processing (NLP)https://scigraph.springernature.com/ontologies/product-market-codes/I21040Artificial intelligence.Computers.Algorithms.Mathematical logic.Natural language processing (Computer science).Artificial Intelligence.Computation by Abstract Devices.Algorithm Analysis and Problem Complexity.Mathematical Logic and Formal Languages.Natural Language Processing (NLP).006.31Balcázar José Ledthttp://id.loc.gov/vocabulary/relators/edtLong Philip Medthttp://id.loc.gov/vocabulary/relators/edtStephan Frankedthttp://id.loc.gov/vocabulary/relators/edtALT 2006BOOK996466021703316Algorithmic Learning Theory771965UNISA