000 04313nam a22005055i 4500
001 978-3-540-69602-5
003 DE-He213
005 20160624102058.0
007 cr nn 008mamaa
008 121227s1997 gw | s |||| 0|eng d
020 _a9783540696025
_9978-3-540-69602-5
024 7 _a10.1007/3-540-63577-7
_2doi
050 4 _aQ334-342
050 4 _aTJ210.2-211.495
072 7 _aUYQ
_2bicssc
072 7 _aTJFM1
_2bicssc
072 7 _aCOM004000
_2bisacsh
082 0 4 _a006.3
_223
245 1 0 _aAlgorithmic Learning Theory
_h[electronic resource] :
_b8th International Workshop, ALT '97 Sendai, Japan, October 6–8, 1997 Proceedings /
_cedited by Ming Li, Akira Maruoka.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1997.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1997.
300 _aXIV, 470 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 Computer Science, Lecture Notes in Artificial Intelligence,
_x0302-9743 ;
_v1316
505 0 _aProgram error detection/correction: Turning PAC learning into Perfect learning -- Team learning as a game -- Inferability of recursive real-valued functions -- Learning of R.E. Languages from good examples -- Identifiability of subspaces and homomorphic images of zero-reversible languages -- On exploiting knowledge and concept use in learning theory -- Partial occam's razor and its applications -- Derandomized learning of boolean functions -- Learning DFA from simple examples -- PAC learning under helpful distributions -- PAC learning using Nadaraya-Watson estimator based on orthonormal systems -- Monotone extensions of boolean data sets -- Classical Brouwer-Heyting-Kolmogorov interpretation -- Inferring a system from examples with time passage -- Polynomial time inductive inference of regular term tree languages from positive data -- Synthesizing noise-tolerant language learners -- Effects of Kolmogorov complexity present in inductive inference as well -- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries -- Oracles in ? 2 p are sufficient for exact learning -- Exact learning via teaching assistants (Extended abstract) -- An efficient exact learning algorithm for ordered binary decision diagrams -- Probability theory for the Brier game -- Learning and revising theories in noisy domains -- A note on a scale-sensitive dimension of linear bounded functionals in Banach Spaces -- On the relevance of time in neural computation and learning -- A simple algorithm for predicting nearly as well as the best pruning labeled with the best prediction values of a decision tree -- Learning disjunctions of features -- Learning simple deterministic finite-memory automata -- Learning acyclic first-order horn sentences from entailment -- On learning disjunctions of zero-one threshold functions with queries.
520 _aThis book constitutes the refereed proceedings of the 8th International Workshop on Algorithmic Learning Theory, ALT'97, held in Sendai, Japan, in October 1997. The volume presents 26 revised full papers selected from 42 submissions. Also included are three invited papers by leading researchers. Among the topics addressed are PAC learning, learning algorithms, inductive learning, inductive inference, learning from examples, game-theoretical aspects, decision procedures, language learning, neural algorithms, and various other aspects of computational learning theory.
650 0 _aComputer science.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aMathematical Logic and Formal Languages.
700 1 _aLi, Ming.
_eeditor.
700 1 _aMaruoka, Akira.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540635772
786 _dSpringer
830 0 _aLecture Notes in Computer Science, Lecture Notes in Artificial Intelligence,
_x0302-9743 ;
_v1316
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-63577-7
942 _2EBK7279
_cEBK
999 _c36573
_d36573