LEADER 07141nam 22007335 450 001 996465282103316 005 20200706222847.0 010 $a3-540-30215-8 024 7 $a10.1007/b100989 035 $a(CKB)1000000000212587 035 $a(DE-He213)978-3-540-30215-5 035 $a(SSID)ssj0000101081 035 $a(PQKBManifestationID)11138382 035 $a(PQKBTitleCode)TC0000101081 035 $a(PQKBWorkID)10037720 035 $a(PQKB)10813922 035 $a(MiAaPQ)EBC3087352 035 $a(PPN)155194992 035 $a(EXLCZ)991000000000212587 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithmic Learning Theory$b[electronic resource] $e15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004. Proceedings /$fedited by Shai Ben David, John Case, Akira Maruoka 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (XIV, 514 p.) 225 1 $aLecture Notes in Artificial Intelligence ;$v3244 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-23356-3 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Papers -- String Pattern Discovery -- Applications of Regularized Least Squares to Classification Problems -- Probabilistic Inductive Logic Programming -- Hidden Markov Modelling Techniques for Haplotype Analysis -- Learning, Logic, and Probability: A Unified View -- Regular Contributions -- Learning Languages from Positive Data and Negative Counterexamples -- Inductive Inference of Term Rewriting Systems from Positive Data -- On the Data Consumption Benefits of Accepting Increased Uncertainty -- Comparison of Query Learning and Gold-Style Learning in Dependence of the Hypothesis Space -- Learning r-of-k Functions by Boosting -- Boosting Based on Divide and Merge -- Learning Boolean Functions in AC 0 on Attribute and Classification Noise -- Decision Trees: More Theoretical Justification for Practical Algorithms -- Application of Classical Nonparametric Predictors to Learning Conditionally I.I.D. Data -- Complexity of Pattern Classes and Lipschitz Property -- On Kernels, Margins, and Low-Dimensional Mappings -- Estimation of the Data Region Using Extreme-Value Distributions -- Maximum Entropy Principle in Non-ordered Setting -- Universal Convergence of Semimeasures on Individual Random Sequences -- A Criterion for the Existence of Predictive Complexity for Binary Games -- Full Information Game with Gains and Losses -- Prediction with Expert Advice by Following the Perturbed Leader for General Weights -- On the Convergence Speed of MDL Predictions for Bernoulli Sequences -- Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm -- On the Complexity of Working Set Selection -- Convergence of a Generalized Gradient Selection Approach for the Decomposition Method -- Newton Diagram and Stochastic Complexity in Mixture of Binomial Distributions -- Learnability of Relatively Quantified Generalized Formulas -- Learning Languages Generated by Elementary Formal Systems and Its Application to SH Languages -- New Revision Algorithms -- The Subsumption Lattice and Query Learning -- Learning of Ordered Tree Languages with Height-Bounded Variables Using Queries -- Learning Tree Languages from Positive Examples and Membership Queries -- Learning Content Sequencing in an Educational Environment According to Student Needs -- Tutorial Papers -- Statistical Learning in Digital Wireless Communications -- A BP-Based Algorithm for Performing Bayesian Inference in Large Perceptron-Type Networks -- Approximate Inference in Probabilistic Models. 330 $aAlgorithmic learning theory is mathematics about computer programs which learn from experience. This involves considerable interaction between various mathematical disciplines including theory of computation, statistics, and c- binatorics. There is also considerable interaction with the practical, empirical ?elds of machine and statistical learning in which a principal aim is to predict, from past data about phenomena, useful features of future data from the same phenomena. The papers in this volume cover a broad range of topics of current research in the ?eld of algorithmic learning theory. We have divided the 29 technical, contributed papers in this volume into eight categories (corresponding to eight sessions) re?ecting this broad range. The categories featured are Inductive Inf- ence, Approximate Optimization Algorithms, Online Sequence Prediction, S- tistical Analysis of Unlabeled Data, PAC Learning & Boosting, Statistical - pervisedLearning,LogicBasedLearning,andQuery&ReinforcementLearning. Below we give a brief overview of the ?eld, placing each of these topics in the general context of the ?eld. Formal models of automated learning re?ect various facets of the wide range of activities that can be viewed as learning. A ?rst dichotomy is between viewing learning as an inde?nite process and viewing it as a ?nite activity with a de?ned termination. Inductive Inference models focus on inde?nite learning processes, requiring only eventual success of the learner to converge to a satisfactory conclusion. 410 0$aLecture Notes in Artificial Intelligence ;$v3244 606 $aArtificial intelligence 606 $aComputers 606 $aAlgorithms 606 $aMathematical logic 606 $aNatural language processing (Computer science) 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aNatural Language Processing (NLP)$3https://scigraph.springernature.com/ontologies/product-market-codes/I21040 615 0$aArtificial intelligence. 615 0$aComputers. 615 0$aAlgorithms. 615 0$aMathematical logic. 615 0$aNatural language processing (Computer science). 615 14$aArtificial Intelligence. 615 24$aComputation by Abstract Devices. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aMathematical Logic and Formal Languages. 615 24$aNatural Language Processing (NLP). 676 $a006.3 702 $aBen David$b Shai$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aCase$b John$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMaruoka$b Akira$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465282103316 996 $aAlgorithmic Learning Theory$9771965 997 $aUNISA LEADER 01140nam a2200313 i 4500 001 991001383759707536 005 20020507192508.0 008 980702s1991 us ||| | eng 020 $a0821816349 035 $ab10840096-39ule_inst 035 $aLE01311452$9ExL 040 $aDip.to Matematica$beng 082 0 $a512.922 084 $aAMS 33E30 084 $aAMS 39B52 084 $aQA342.S77 100 1 $aLewin, Leonard$059630 245 10$aStructural properties of polylogarithms /$cLeonard Lewin, editor 260 $aProvidence, R.I. :$bAmerican Mathematical Society,$cc1991 300 $axviii, 412 p. :$bill. ;$c26 cm 490 0 $aMathematical surveys and monographs,$x0076-5376 ;$v37 500 $aIncludes bibliographical references and index 650 0$aLogarithmic functions 907 $a.b10840096$b23-02-17$c28-06-02 912 $a991001383759707536 945 $aLE013 39B LEW11 (1991)$g1$i2013000101361$lle013$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i10949963$z28-06-02 996 $aStructural properties of polylogarithms$9923874 997 $aUNISALENTO 998 $ale013$b01-01-98$cm$da $e-$feng$gus $h0$i1