000 03791nam a22006135i 4500
001 978-3-540-49097-5
003 DE-He213
005 20240423132529.0
007 cr nn 008mamaa
008 121227s1999 gw | s |||| 0|eng d
020 _a9783540490975
_9978-3-540-49097-5
024 7 _a10.1007/3-540-49097-3
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
245 1 0 _aComputational Learning Theory
_h[electronic resource] :
_b4th European Conference, EuroCOLT'99 Nordkirchen, Germany, March 29-31, 1999 Proceedings /
_cedited by Paul Fischer, Hans U. Simon.
250 _a1st ed. 1999.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1999.
300 _aX, 299 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 ;
_v1572
505 0 _aInvited Lectures -- Theoretical Views of Boosting -- Open Theoretical Questions in Reinforcement Learning -- Learning from Random Examples -- A Geometric Approach to Leveraging Weak Learners -- Query by Committee, Linear Separation and Random Walks -- Hardness Results for Neural Network Approximation Problems -- Learning from Queries and Counterexamples -- Learnability of Quantified Formulas -- Learning Multiplicity Automata from Smallest Counterexamples -- Exact Learning when Irrelevant Variables Abound -- An Application of Codes to Attribute-Efficient Learning -- Learning Range Restricted Horn Expressions -- Reinforcement Learning -- On the Asymptotic Behavior of a Constant Stepsize Temporal-Difference Learning Algorithm -- On-line Learning and Expert Advice -- Direct and Indirect Algorithms for On-line Learning of Disjunctions -- Averaging Expert Predictions -- Teaching and Learning -- On Teaching and Learning Intersection-Closed Concept Classes -- Inductive Inference -- Avoiding Coding Tricks by Hyperrobust Learning -- Mind Change Complexity of Learning Logic Programs -- Statistical Theory of Learning and Pattern Recognition -- Regularized Principal Manifolds -- Distribution-Dependent Vapnik-Chervonenkis Bounds -- Lower Bounds on the Rate of Convergence of Nonparametric Pattern Recognition -- On Error Estimation for the Partitioning Classification Rule -- Margin Distribution Bounds on Generalization -- Generalization Performance of Classifiers in Terms of Observed Covering Numbers -- Entropy Numbers, Operators and Support Vector Kernels.
650 0 _aArtificial intelligence.
650 0 _aPattern recognition systems.
650 0 _aMachine theory.
650 0 _aAlgorithms.
650 0 _aComputer science.
650 1 4 _aArtificial Intelligence.
650 2 4 _aAutomated Pattern Recognition.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aAlgorithms.
650 2 4 _aTheory of Computation.
700 1 _aFischer, Paul.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSimon, Hans U.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540657019
776 0 8 _iPrinted edition:
_z9783662208540
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v1572
856 4 0 _uhttps://doi.org/10.1007/3-540-49097-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188770
_d188770