Algorithmic learning theory : 12th international conference, ALT 2001, Washington, DC, USA, November 25-28, 2001 : proceedings

This volume contains the papers presented at the 12th Annual Conference on Algorithmic Learning Theory (ALT 2001), which was held in Washington DC, USA, during November 25 28, 2001. The main objective of the conference is to provide an inter-disciplinary forum for the discussion of theoretical found...

पूर्ण विवरण

में बचाया:
ग्रंथसूची विवरण
निगमित लेखक: Algorithmic learning theory :Washington
अन्य लेखक: Abe, Naoki, 1960- (प्रकाशन निदेशक), Khardon, Roni, 1963- (प्रकाशन निदेशक), Zeugmann, Thomas, 1956- (प्रकाशन निदेशक)
स्वरूप: Livre numérique
भाषा:Anglais
प्रकाशित: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
श्रृंखला:Lecture notes in computer science. Lecture notes in artificial intelligence 2225
विषय:
ऑनलाइन पहुंच:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
टिप्पणी: 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, 12th international conference, ALT 2001, Washington, DC, USA, November 25-28, 2001, proceedings, Naoki Abe, Roni Khardon, Thomas Zeugmann (eds.), 2001, New York, Springer, 1 vol. (XI-377 p.), Lecture notes in computer science, 3-540-42875-5
• Algorithmic Learning Theory, Texte imprimé, 9783662215340
LEADER 05546nam a22004457a 4500
001 948590
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155174169
020 |a 9783540455837 (PDF) 
041 0 |a eng 
082 |a 004 
082 |a 005.1 
111 2 |a Algorithmic learning theory  |n (12  |d  :2001  |c  :Washington). 
245 1 0 |a Algorithmic learning theory :  |b 12th international conference, ALT 2001, Washington, DC, USA, November 25-28, 2001 : proceedings   |c [edited by] Naoki Abe, Roni Khardon, Thomas Zeugmann. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science. Lecture notes in artificial intelligence  |v 2225  |x 1611-3349  |x 2945-9141 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a Editors Introduction -- Editors Introduction -- Invited Papers -- The Discovery Science Project in Japan -- Queries Revisited -- Robot Baby 2001 -- Discovering Mechanisms: A Computational Philosophy of Science Perspective -- Inventing Discovery Tools: Combining Information Visualization with Data Mining -- Complexity of Learning -- On Learning Correlated Boolean Functions Using Statistical Queries (Extended Abstract) -- A Simpler Analysis of the Multi-way Branching Decision Tree Boosting Algorithm -- Minimizing the Quadratic Training Error of a Sigmoid Neuron Is Hard -- Support Vector Machines -- Learning of Boolean Functions Using Support Vector Machines -- A Random Sampling Technique for Training Support Vector Machines -- New Learning Models -- Learning Coherent Concepts -- Learning Intermediate Concepts -- Real-Valued Multiple-Instance Learning with Queries -- Online Learning -- Loss Functions, Complexities, and the Legendre Transformation -- Non-linear Inequalities between Predictive and Kolmogorov Complexities -- Inductive Inference -- Learning by Switching Type of Information -- Learning How to Separate -- Learning Languages in a Union -- On the Comparison of Inductive Inference Criteria for Uniform Learning of Finite Classes -- Refutable Inductive Inference -- Refutable Language Learning with a Neighbor System -- Learning Recursive Functions Refutably -- Refuting Learning Revisited -- Learning Structures and Languages -- Efficient Learning of Semi-structured Data from Queries -- Extending Elementary Formal Systems -- Learning Regular Languages Using RFSA -- Inference of ?-Languages from Prefixes. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a 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 
520 |a This volume contains the papers presented at the 12th Annual Conference on Algorithmic Learning Theory (ALT 2001), which was held in Washington DC, USA, during November 25 28, 2001. The main objective of the conference is to provide an inter-disciplinary forum for the discussion of theoretical foundations of machine learning, as well as their relevance to practical applications. The conference was co-located with the Fourth International Conference on Discovery Science (DS 2001). The volume includes 21 contributed papers. These papers were selected by the program committee from 42 submissions based on clarity, signi?cance, o- ginality, and relevance to theory and practice of machine learning. Additionally, the volume contains the invited talks of ALT 2001 presented by Dana Angluin of Yale University, USA, Paul R. Cohen of the University of Massachusetts at Amherst, USA, and the joint invited talk for ALT 2001 and DS 2001 presented by Setsuo Arikawa of Kyushu University, Japan. Furthermore, this volume includes abstracts of the invited talks for DS 2001 presented by Lindley Darden and Ben Shneiderman both of the University of Maryland at College Park, USA. The complete versions of these papers are published in the DS 2001 proceedings (Lecture Notes in Arti?cial Intelligence Vol. 2226). 
650 |a Informatique 
650 |a Apprentissage automatique 
650 |a Algorithmes 
650 |a Intelligence artificielle 
650 |a Logique symbolique et mathématique 
650 |a Actes de congrès 
700 1 |a Abe, Naoki,  |d 1960-  |4 pbd 
700 1 |a Khardon, Roni,  |d 1963-  |4 pbd 
700 1 |a Zeugmann, Thomas,  |d 1956-  |4 pbd 
776 0 |0 059417463  |t Algorithmic learning theory  |o 12th international conference, ALT 2001, Washington, DC, USA, November 25-28, 2001  |o proceedings  |f Naoki Abe, Roni Khardon, Thomas Zeugmann (eds.)  |d 2001  |c New York  |n Springer  |p 1 vol. (XI-377 p.)  |s Lecture notes in computer science  |z 3-540-42875-5 
776 0 |t Algorithmic Learning Theory  |b Texte imprimé  |z 9783662215340 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-45583-3  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-0GBJT07N-G  |z Accès sur la plateforme Istex 
856 4 |5 452349901:74806267X  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-45583-3  |z Accès Université d'Orléans 
856 4 |5 180339901:751514314  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-45583-3  |z Accès INSA CVL 
997 |0 948590  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/