000 06050nam a22006135i 4500
001 978-3-540-36169-5
003 DE-He213
005 20240423132511.0
007 cr nn 008mamaa
008 121227s2002 gw | s |||| 0|eng d
020 _a9783540361695
_9978-3-540-36169-5
024 7 _a10.1007/3-540-36169-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] :
_b13th International Conference, ALT 2002, Lübeck, Germany, November 24-26, 2002, Proceedings /
_cedited by Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk.
250 _a1st ed. 2002.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2002.
300 _aXII, 420 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 ;
_v2533
505 0 _aEditors’ Introduction -- Editors’ Introduction -- Invited Papers -- Mathematics Based on Learning -- Data Mining with Graphical Models -- On the Eigenspectrum of the Gram Matrix and Its Relationship to the Operator Eigenspectrum -- In Search of the Horowitz Factor: Interim Report on a Musical Discovery Project -- Learning Structure from Sequences, with Applications in a Digital Library -- Regular Contributions -- On Learning Monotone Boolean Functions under the Uniform Distribution -- On Learning Embedded Midbit Functions -- Maximizing Agreements and CoAgnostic Learning -- Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning -- Large Margin Classification for Moving Targets -- On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution -- A General Dimension for Approximately Learning Boolean Functions -- The Complexity of Learning Concept Classes with Polynomial General Dimension -- On the Absence of Predictive Complexity for Some Games -- Consistency Queries in Information Extraction -- Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data -- Reflective Inductive Inference of Recursive Functions -- Classes with Easily Learnable Subclasses -- On the Learnability of Vector Spaces -- Learning, Logic, and Topology in a Common Framework -- A Pathology of Bottom-Up Hill-Climbing in Inductive Rule Learning -- Minimised Residue Hypotheses in Relevant Logic -- Compactness and Learning of Classes of Unions of Erasing Regular Pattern Languages -- A Negative Result on Inductive Inference of Extended Pattern Languages -- RBF Neural Networks and Descartes’ Rule of Signs -- Asymptotic Optimality of Transductive Confidence Machine -- An Efficient PAC Algorithm forReconstructing a Mixture of Lines -- Constraint Classification: A New Approach to Multiclass Classification -- How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution -- Classification with Intersecting Rules -- Feedforward Neural Networks in Reinforcement Learning Applied to High-Dimensional Motor Control.
520 _aThis volume contains the papers presented at the 13th Annual Conference on Algorithmic Learning Theory (ALT 2002), which was held in Lub ¨ eck (Germany) during November 24–26, 2002. The main objective of the conference was to p- vide an interdisciplinary forum discussing the theoretical foundations of machine learning as well as their relevance to practical applications. The conference was colocated with the Fifth International Conference on Discovery Science (DS 2002). The volume includes 26 technical contributions which were selected by the program committee from 49 submissions. It also contains the ALT 2002 invited talks presented by Susumu Hayashi (Kobe University, Japan) on “Mathematics Based on Learning”, by John Shawe-Taylor (Royal Holloway University of L- don, UK) on “On the Eigenspectrum of the Gram Matrix and Its Relationship to the Operator Eigenspectrum”, and by Ian H. Witten (University of Waikato, New Zealand) on “Learning Structure from Sequences, with Applications in a Digital Library” (joint invited talk with DS 2002). Furthermore, this volume - cludes abstracts of the invited talks for DS 2002 presented by Gerhard Widmer (Austrian Research Institute for Arti?cial Intelligence, Vienna) on “In Search of the Horowitz Factor: Interim Report on a Musical Discovery Project” and by Rudolf Kruse (University of Magdeburg, Germany) on “Data Mining with Graphical Models”. The complete versions of these papers are published in the DS 2002 proceedings (Lecture Notes in Arti?cial Intelligence, Vol. 2534). ALT has been awarding the E.
650 0 _aComputer programming.
650 0 _aComputer science.
650 0 _aArtificial intelligence.
650 0 _aAlgorithms.
650 1 4 _aProgramming Techniques.
650 2 4 _aTheory of Computation.
650 2 4 _aArtificial Intelligence.
650 2 4 _aComputer Science.
650 2 4 _aAlgorithms.
700 1 _aCesa-Bianchi, Nicolò.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aNumao, Masayuki.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aReischuk, Rüdiger.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540001706
776 0 8 _iPrinted edition:
_z9783662184738
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v2533
856 4 0 _uhttps://doi.org/10.1007/3-540-36169-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188437
_d188437