000			03506nam a22005295i 4500
001			978-3-540-49097-5
003			DE-He213
005			20160624102039.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	_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	_aComputational Learning Theory _h[electronic resource] : _b4th European Conference, EuroCOLT’99 Nordkirchen, Germany, March 29–31, 1999 Proceedings / _cedited by Paul Fischer, Hans Ulrich Simon.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1999.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _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 Computer Science, _x0302-9743 ; _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	_aComputer science.
650		0	_aComputer software.
650		0	_aArtificial intelligence.
650	1	4	_aComputer Science.
650	2	4	_aArtificial Intelligence (incl. Robotics).
650	2	4	_aMathematical Logic and Formal Languages.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aComputation by Abstract Devices.
700	1		_aFischer, Paul. _eeditor.
700	1		_aSimon, Hans Ulrich. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540657019
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v1572
856	4	0	_uhttp://dx.doi.org/10.1007/3-540-49097-3
942			_2EBK6657 _cEBK
999			_c35951 _d35951