Algorithmic learning theory : 15th international conference, ALT 2004, Padova, Italy, October 2-5, 2004 : proceedings

Algorithmic 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, e...

Fuld beskrivelse

Enregistré dans:
Bibliografiske detaljer
Institution som forfatter: Algorithmic learning theory :Padova, IT
Andre forfattere: Ben-David, Shai (Directeur de la publication), Case, John (Directeur de la publication), Maruoka, Akira (Directeur de la publication)
Format: Livre numérique
Sprog:Anglais
Udgivet: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Serier:Lecture notes in computer science. Lecture notes in artificial intelligence 3244
Fag:
Online adgang:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Kommentar: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Algorithmic learning theory, 15th international conference, ALT 2004, Padova, Italy, October 2-5, 2004, proceedings, Shai Ben-David, John Case, Akira Maruoka (Eds.), Berlin, Springer, 2004, 1 vol. (XIV-504 p.), Lecture notes in computer science, 3-540-23356-3
• Algorithmic Learning Theory, Texte imprimé, 9783662205204
Beskrivelse
Summary:Algorithmic 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.
Emne beskrivelse:Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
ISBN:9783540302155 (PDF)
ISSN:1611-3349
2945-9141
Adgang:Accès en ligne pour les établissements français bénéficiaires des licences nationales
Accès soumis à abonnement pour tout autre établissement
Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017