LEADER 04597nam 2200613Ia 450 001 9910483550403321 005 20200520144314.0 010 $a3-642-04414-X 024 7 $a10.1007/978-3-642-04414-4 035 $a(CKB)1000000000784698 035 $a(SSID)ssj0000316161 035 $a(PQKBManifestationID)11242656 035 $a(PQKBTitleCode)TC0000316161 035 $a(PQKBWorkID)10263698 035 $a(PQKB)10051989 035 $a(DE-He213)978-3-642-04414-4 035 $a(MiAaPQ)EBC3064617 035 $a(PPN)139955674 035 $a(EXLCZ)991000000000784698 100 $a20090807d2009 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithmic learning theory $e20th International Conference, ALT 2009, Porto, Portugal, October 3-5, 2009 ; proceedings /$fRicard Gavalda, Gabor Lugosi, Thomas Zeugmann (eds.) 205 $a1st ed. 210 $aNew York $cSpringer$d2009 215 $a1 online resource (XI, 399 p.) 225 1 $aLecture notes in computer science. Lecture notes in artificial intelligence ;$v5809 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-04413-1 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- The Two Faces of Active Learning -- Inference and Learning in Planning -- Mining Heterogeneous Information Networks by Exploring the Power of Links -- Learning and Domain Adaptation -- Learning on the Web -- Regular Contributions -- Prediction with Expert Evaluators? Advice -- Pure Exploration in Multi-armed Bandits Problems -- The Follow Perturbed Leader Algorithm Protected from Unbounded One-Step Losses -- Computable Bayesian Compression for Uniformly Discretizable Statistical Models -- Calibration and Internal No-Regret with Random Signals -- St. Petersburg Portfolio Games -- Reconstructing Weighted Graphs with Minimal Query Complexity -- Learning Unknown Graphs -- Completing Networks Using Observed Data -- Average-Case Active Learning with Costs -- Canonical Horn Representations and Query Learning -- Learning Finite Automata Using Label Queries -- Characterizing Statistical Query Learning: Simplified Notions and Proofs -- An Algebraic Perspective on Boolean Function Learning -- Adaptive Estimation of the Optimal ROC Curve and a Bipartite Ranking Algorithm -- Complexity versus Agreement for Many Views -- Error-Correcting Tournaments -- Difficulties in Forcing Fairness of Polynomial Time Inductive Inference -- Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data -- Uncountable Automatic Classes and Learning -- Iterative Learning from Texts and Counterexamples Using Additional Information -- Incremental Learning with Ordinal Bounded Example Memory -- Learning from Streams -- Smart PAC-Learners -- Approximation Algorithms for Tensor Clustering -- Agnostic Clustering. 330 $aThis book constitutes the refereed proceedings of the 20th International Conference on Algorithmic Learning Theory, ALT 2009, held in Porto, Portugal, in October 2009, co-located with the 12th International Conference on Discovery Science, DS 2009. The 26 revised full papers presented together with the abstracts of 5 invited talks were carefully reviewed and selected from 60 submissions. The papers are divided into topical sections of papers on online learning, learning graphs, active learning and query learning, statistical learning, inductive inference, and semisupervised and unsupervised learning. The volume also contains abstracts of the invited talks: Sanjoy Dasgupta, The Two Faces of Active Learning; Hector Geffner, Inference and Learning in Planning; Jiawei Han, Mining Heterogeneous; Information Networks By Exploring the Power of Links, Yishay Mansour, Learning and Domain Adaptation; Fernando C.N. Pereira, Learning on the Web. 410 0$aLecture notes in computer science.$pLecture notes in artificial intelligence ;$v5809. 606 $aComputer algorithms$vCongresses 606 $aMachine learning$vCongresses 615 0$aComputer algorithms 615 0$aMachine learning 676 $a006.3/1 686 $aDAT 708f$2stub 686 $aSS 4800$2rvk 701 $aGavalda$b Ricard$01764063 701 $aLugosi$b Gabor$0441761 701 $aZeugmann$b Thomas$01752472 712 12$aALT 2009 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483550403321 996 $aAlgorithmic learning theory$94204801 997 $aUNINA