000 05372nam a22006495i 4500
001 978-3-540-45583-7
003 DE-He213
005 20240423132531.0
007 cr nn 008mamaa
008 121227s2001 gw | s |||| 0|eng d
020 _a9783540455837
_9978-3-540-45583-7
024 7 _a10.1007/3-540-45583-3
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_223
245 1 0 _aAlgorithmic Learning Theory
_h[electronic resource] :
_b12th International Conference, ALT 2001, Washington, DC, USA, November 25-28, 2001. Proceedings. /
_cedited by Naoki Abe, Roni Khardon, Thomas Zeugmann.
250 _a1st ed. 2001.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2001.
300 _aXII, 388 p.
_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 Artificial Intelligence,
_x2945-9141 ;
_v2225
505 0 _aEditors’ 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.
520 _aThis 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 0 _aComputer programming.
650 0 _aArtificial intelligence.
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aMachine theory.
650 0 _aNatural language processing (Computer science).
650 1 4 _aProgramming Techniques.
650 2 4 _aArtificial Intelligence.
650 2 4 _aTheory of Computation.
650 2 4 _aAlgorithms.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aNatural Language Processing (NLP).
700 1 _aAbe, Naoki.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aKhardon, Roni.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aZeugmann, Thomas.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540428756
776 0 8 _iPrinted edition:
_z9783662215340
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v2225
856 4 0 _uhttps://doi.org/10.1007/3-540-45583-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188810
_d188810