Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    almafu_BV008240093
    Format: XI, 423 S. : , graph. Darst.
    ISBN: 3-540-57370-4 , 0-387-57370-4
    Series Statement: Lecture notes in computer science 744 : Lecture notes in artificial intelligence
    Language: English
    Keywords: Maschinelles Lernen ; Mathematische Lerntheorie ; Lerntheorie ; Algorithmus ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift
    Author information: Jantke, Klaus P. 1951-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    b3kat_BV035719037
    Format: 1 Online-Ressource (XI, 423 S. , graph. Darst.)
    ISBN: 3540573704 , 0387573704
    Series Statement: Lecture notes in computer science 744 : Lecture notes in artificial intelligence
    Language: English
    Keywords: Maschinelles Lernen ; Mathematische Lerntheorie ; Lerntheorie ; Algorithmus ; Konferenzschrift
    Author information: Jantke, Klaus P. 1951-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    gbv_595125948
    Format: Online-Ressource (XI, 423 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540480969
    Series Statement: Lecture notes in computer science 744
    Content: Identifying and using patterns in sequential data -- Learning theory toward Genome Informatics -- Optimal layered learning: A PAC approach to incremental sampling -- Reformulation of explanation by linear logic toward logic for explanation -- Towards efficient inductive synthesis of expressions from input/output examples -- A typed ?-calculus for proving-by-example and bottom-up generalization procedure -- Case-based representation and learning of pattern languages -- Inductive resolution -- Generalized unification as background knowledge in learning logic programs -- Inductive inference machines that can refute hypothesis spaces -- On the duality between mechanistic learners and what it is they learn -- On aggregating teams of learning machines -- Learning with growing quality -- Use of reduction arguments in determining Popperian FIN-type learning capabilities -- Properties of language classes with finite elasticity -- Uniform characterizations of various kinds of language learning -- How to invent characterizable inference methods for regular languages -- Neural Discriminant Analysis -- A new algorithm for automatic configuration of Hidden Markov Models -- On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions -- On the sample complexity of consistent learning with one-sided error -- Complexity of computing Vapnik-Chervonenkis dimension -- ?-approximations of k-label spaces -- Exact learning of linear combinations of monotone terms from function value queries -- Thue systems and DNA — A learning algorithm for a subclass -- The VC-dimensions of finite automata with n states -- Unifying learning methods by colored digraphs -- A perceptual criterion for visually controlling learning -- Learning strategies using decision lists -- A decomposition based induction model for discovering concept clusters from databases -- Algebraic structure of some learning systems -- Induction of probabilistic rules based on rough set theory.
    Content: This volume contains all the papers that were presented at the Fourth Workshop on Algorithmic Learning Theory, held in Tokyo in November 1993. In addition to 3 invited papers, 29 papers were selected from 47 submitted extended abstracts. The workshop was the fourth in a series of ALT workshops, whose focus is on theories of machine learning and the application of such theories to real-world learning problems. The ALT workshops have been held annually since 1990, sponsored by the Japanese Society for Artificial Intelligence. The volume is organized into parts on inductive logic and inference, inductive inference, approximate learning, query learning, explanation-based learning, and new learning paradigms.
    Note: Literaturangaben
    Additional Edition: ISBN 3540573704
    Additional Edition: ISBN 9783540573708
    Additional Edition: Erscheint auch als Druck-Ausgabe Algorithmic learning theory Berlin : Springer, 1993 ISBN 3540573704
    Additional Edition: ISBN 0387573704
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Lernender Automat ; Maschinelles Lernen ; Mathematische Lerntheorie ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    Author information: Jantke, Klaus P. 1951-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    almafu_9959186194302883
    Format: 1 online resource (XI, 428 p.)
    Edition: 1st ed. 1993.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-48096-X
    Series Statement: Lecture Notes in Artificial Intelligence ; 744
    Content: This volume contains all the papers that were presented at the Fourth Workshop on Algorithmic Learning Theory, held in Tokyo in November 1993. In addition to 3 invited papers, 29 papers were selected from 47 submitted extended abstracts. The workshop was the fourth in a series of ALT workshops, whose focus is on theories of machine learning and the application of such theories to real-world learning problems. The ALT workshops have been held annually since 1990, sponsored by the Japanese Society for Artificial Intelligence. The volume is organized into parts on inductive logic and inference, inductive inference, approximate learning, query learning, explanation-based learning, and new learning paradigms.
    Note: Bibliographic Level Mode of Issuance: Monograph , Identifying and using patterns in sequential data -- Learning theory toward Genome Informatics -- Optimal layered learning: A PAC approach to incremental sampling -- Reformulation of explanation by linear logic toward logic for explanation -- Towards efficient inductive synthesis of expressions from input/output examples -- A typed ?-calculus for proving-by-example and bottom-up generalization procedure -- Case-based representation and learning of pattern languages -- Inductive resolution -- Generalized unification as background knowledge in learning logic programs -- Inductive inference machines that can refute hypothesis spaces -- On the duality between mechanistic learners and what it is they learn -- On aggregating teams of learning machines -- Learning with growing quality -- Use of reduction arguments in determining Popperian FIN-type learning capabilities -- Properties of language classes with finite elasticity -- Uniform characterizations of various kinds of language learning -- How to invent characterizable inference methods for regular languages -- Neural Discriminant Analysis -- A new algorithm for automatic configuration of Hidden Markov Models -- On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions -- On the sample complexity of consistent learning with one-sided error -- Complexity of computing Vapnik-Chervonenkis dimension -- ?-approximations of k-label spaces -- Exact learning of linear combinations of monotone terms from function value queries -- Thue systems and DNA — A learning algorithm for a subclass -- The VC-dimensions of finite automata with n states -- Unifying learning methods by colored digraphs -- A perceptual criterion for visually controlling learning -- Learning strategies using decision lists -- A decomposition based induction model for discovering concept clusters from databases -- Algebraic structure of some learning systems -- Induction of probabilistic rules based on rough set theory. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-57370-4
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    UID:
    gbv_1649303033
    Format: Online-Ressource
    ISBN: 9783540480969
    Series Statement: Lecture Notes in Computer Science 744
    Additional Edition: ISBN 9783540573708
    Additional Edition: Buchausg. u.d.T. Algorithmic learning theory Berlin : Springer, 1993 ISBN 3540573704
    Additional Edition: ISBN 0387573704
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Maschinelles Lernen ; Mathematische Lerntheorie ; Konferenzschrift
    Author information: Jantke, Klaus P. 1951-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    almahu_9947920721002882
    Format: XI, 428 p. , online resource.
    ISBN: 9783540480969
    Series Statement: Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence, 744
    Content: This volume contains all the papers that were presented at the Fourth Workshop on Algorithmic Learning Theory, held in Tokyo in November 1993. In addition to 3 invited papers, 29 papers were selected from 47 submitted extended abstracts. The workshop was the fourth in a series of ALT workshops, whose focus is on theories of machine learning and the application of such theories to real-world learning problems. The ALT workshops have been held annually since 1990, sponsored by the Japanese Society for Artificial Intelligence. The volume is organized into parts on inductive logic and inference, inductive inference, approximate learning, query learning, explanation-based learning, and new learning paradigms.
    Note: Identifying and using patterns in sequential data -- Learning theory toward Genome Informatics -- Optimal layered learning: A PAC approach to incremental sampling -- Reformulation of explanation by linear logic toward logic for explanation -- Towards efficient inductive synthesis of expressions from input/output examples -- A typed ?-calculus for proving-by-example and bottom-up generalization procedure -- Case-based representation and learning of pattern languages -- Inductive resolution -- Generalized unification as background knowledge in learning logic programs -- Inductive inference machines that can refute hypothesis spaces -- On the duality between mechanistic learners and what it is they learn -- On aggregating teams of learning machines -- Learning with growing quality -- Use of reduction arguments in determining Popperian FIN-type learning capabilities -- Properties of language classes with finite elasticity -- Uniform characterizations of various kinds of language learning -- How to invent characterizable inference methods for regular languages -- Neural Discriminant Analysis -- A new algorithm for automatic configuration of Hidden Markov Models -- On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions -- On the sample complexity of consistent learning with one-sided error -- Complexity of computing Vapnik-Chervonenkis dimension -- ?-approximations of k-label spaces -- Exact learning of linear combinations of monotone terms from function value queries -- Thue systems and DNA — A learning algorithm for a subclass -- The VC-dimensions of finite automata with n states -- Unifying learning methods by colored digraphs -- A perceptual criterion for visually controlling learning -- Learning strategies using decision lists -- A decomposition based induction model for discovering concept clusters from databases -- Algebraic structure of some learning systems -- Induction of probabilistic rules based on rough set theory.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540573708
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    UID:
    almahu_9948621551002882
    Format: XI, 428 p. , online resource.
    Edition: 1st ed. 1993.
    ISBN: 9783540480969
    Series Statement: Lecture Notes in Artificial Intelligence ; 744
    Content: This volume contains all the papers that were presented at the Fourth Workshop on Algorithmic Learning Theory, held in Tokyo in November 1993. In addition to 3 invited papers, 29 papers were selected from 47 submitted extended abstracts. The workshop was the fourth in a series of ALT workshops, whose focus is on theories of machine learning and the application of such theories to real-world learning problems. The ALT workshops have been held annually since 1990, sponsored by the Japanese Society for Artificial Intelligence. The volume is organized into parts on inductive logic and inference, inductive inference, approximate learning, query learning, explanation-based learning, and new learning paradigms.
    Note: Identifying and using patterns in sequential data -- Learning theory toward Genome Informatics -- Optimal layered learning: A PAC approach to incremental sampling -- Reformulation of explanation by linear logic toward logic for explanation -- Towards efficient inductive synthesis of expressions from input/output examples -- A typed ?-calculus for proving-by-example and bottom-up generalization procedure -- Case-based representation and learning of pattern languages -- Inductive resolution -- Generalized unification as background knowledge in learning logic programs -- Inductive inference machines that can refute hypothesis spaces -- On the duality between mechanistic learners and what it is they learn -- On aggregating teams of learning machines -- Learning with growing quality -- Use of reduction arguments in determining Popperian FIN-type learning capabilities -- Properties of language classes with finite elasticity -- Uniform characterizations of various kinds of language learning -- How to invent characterizable inference methods for regular languages -- Neural Discriminant Analysis -- A new algorithm for automatic configuration of Hidden Markov Models -- On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions -- On the sample complexity of consistent learning with one-sided error -- Complexity of computing Vapnik-Chervonenkis dimension -- ?-approximations of k-label spaces -- Exact learning of linear combinations of monotone terms from function value queries -- Thue systems and DNA - A learning algorithm for a subclass -- The VC-dimensions of finite automata with n states -- Unifying learning methods by colored digraphs -- A perceptual criterion for visually controlling learning -- Learning strategies using decision lists -- A decomposition based induction model for discovering concept clusters from databases -- Algebraic structure of some learning systems -- Induction of probabilistic rules based on rough set theory.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662206652
    Additional Edition: Printed edition: ISBN 9783540573708
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 3540057374?
Did you mean 3540173404?
Did you mean 3540073701?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages