000 | 04774nam a22006015i 4500 | ||
---|---|---|---|
001 | 978-3-642-16108-7 | ||
003 | DE-He213 | ||
005 | 20140220084548.0 | ||
007 | cr nn 008mamaa | ||
008 | 100831s2010 gw | s |||| 0|eng d | ||
020 |
_a9783642161087 _9978-3-642-16108-7 |
||
024 | 7 |
_a10.1007/978-3-642-16108-7 _2doi |
|
050 | 4 | _aQ334-342 | |
050 | 4 | _aTJ210.2-211.495 | |
072 | 7 |
_aUYQ _2bicssc |
|
072 | 7 |
_aTJFM1 _2bicssc |
|
072 | 7 |
_aCOM004000 _2bisacsh |
|
082 | 0 | 4 |
_a006.3 _223 |
100 | 1 |
_aHutter, Marcus. _eeditor. |
|
245 | 1 | 0 |
_aAlgorithmic Learning Theory _h[electronic resource] : _b21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings / _cedited by Marcus Hutter, Frank Stephan, Vladimir Vovk, Thomas Zeugmann. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010. |
|
300 |
_aXIII, 421p. 45 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v6331 |
|
505 | 0 | _aEditors’ Introduction -- Editors’ Introduction -- Invited Papers -- Towards General Algorithms for Grammatical Inference -- The Blessing and the Curse of the Multiplicative Updates -- Discovery of Abstract Concepts by a Robot -- Contrast Pattern Mining and Its Application for Building Robust Classifiers -- Optimal Online Prediction in Adversarial Environments -- Regular Contributions -- An Algorithm for Iterative Selection of Blocks of Features -- Bayesian Active Learning Using Arbitrary Binary Valued Queries -- Approximation Stability and Boosting -- A Spectral Approach for Probabilistic Grammatical Inference on Trees -- PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation -- Inferring Social Networks from Outbreaks -- Distribution-Dependent PAC-Bayes Priors -- PAC Learnability of a Concept Class under Non-atomic Measures: A Problem by Vidyasagar -- A PAC-Bayes Bound for Tailored Density Estimation -- Compressed Learning with Regular Concept -- A Lower Bound for Learning Distributions Generated by Probabilistic Automata -- Lower Bounds on Learning Random Structures with Statistical Queries -- Recursive Teaching Dimension, Learning Complexity, and Maximum Classes -- Toward a Classification of Finite Partial-Monitoring Games -- Switching Investments -- Prediction with Expert Advice under Discounted Loss -- A Regularization Approach to Metrical Task Systems -- Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations -- Learning without Coding -- Learning Figures with the Hausdorff Metric by Fractals -- Inductive Inference of Languages from Samplings -- Optimality Issues of Universal Greedy Agents with Static Priors -- Consistency of Feature Markov Processes -- Algorithms for Adversarial Bandit Problems with Multiple Plays -- Online Multiple Kernel Learning: Algorithms and Mistake Bounds -- An Identity for Kernel Ridge Regression. | |
520 | _aThis book constitutes the refereed proceedings of the 21th International Conference on Algorithmic Learning Theory, ALT 2010, held in Canberra, Australia, in October 2010, co-located with the 13th International Conference on Discovery Science, DS 2010. The 26 revised full papers presented together with the abstracts of 5 invited talks were carefully reviewed and selected from 44 submissions. The papers are divided into topical sections of papers on statistical learning; grammatical inference and graph learning; probably approximately correct learning; query learning and algorithmic teaching; on-line learning; inductive inference; reinforcement learning; and on-line learning and kernel methods. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer software. | |
650 | 0 | _aLogic design. | |
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aEducation. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aComputation by Abstract Devices. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
650 | 2 | 4 | _aComputers and Education. |
700 | 1 |
_aStephan, Frank. _eeditor. |
|
700 | 1 |
_aVovk, Vladimir. _eeditor. |
|
700 | 1 |
_aZeugmann, Thomas. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783642161070 |
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v6331 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-16108-7 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-LNC | ||
999 |
_c112770 _d112770 |