Lecture Notes in Computer Science - Algorithmic Learning Theory
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540001706, 9783540361695

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Maximizing Agreements and CoAgnostic Learning

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-36169-3_9 ◽

2002 ◽

pp. 83-97 ◽

Cited By ~ 4

Author(s):

Nader H. Bshouty ◽

Lynn Burroughs

Download Full-text

On Learning Embedded Midbit Functions

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-36169-3_8 ◽

2002 ◽

pp. 69-82

Author(s):

Rocco A. Servedio

Download Full-text

RBF Neural Networks and Descartes’ Rule of Signs

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-36169-3_26 ◽

2002 ◽

pp. 321-335 ◽

Cited By ~ 1

Author(s):

Michael Schmitt

Keyword(s):

Neural Networks ◽

Rbf Neural Networks

Download Full-text

Classes with Easily Learnable Subclasses

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-36169-3_19 ◽

2002 ◽

pp. 218-232 ◽

Cited By ~ 1

Author(s):

Sanjay Jain ◽

Wolfram Menzel ◽

Frank Stephan

Download Full-text

Consistency Queries in Information Extraction

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-36169-3_16 ◽

2002 ◽

pp. 173-187 ◽

Cited By ~ 3

Author(s):

Gunter Grieser ◽

Klaus P. Jantke ◽

Steffen Lange

Keyword(s):

Information Extraction

Download Full-text

Learning Structure from Sequences, with Applications in a Digital Library

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-36169-3_6 ◽

2002 ◽

pp. 42-56 ◽

Cited By ~ 1

Author(s):

Ian H. Witten

Keyword(s):

Digital Library

Download Full-text

Data Mining with Graphical Models

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-36169-3_3 ◽

2002 ◽

pp. 22-22

Author(s):

Rudolf Kruse ◽

Christian Borgelt

Keyword(s):

Data Mining ◽

Graphical Models

Download Full-text

Asymptotic Optimality of Transductive Confidence Machine

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-36169-3_27 ◽

2002 ◽

pp. 336-350 ◽

Cited By ~ 6

Author(s):

Vladimir Vovk

Keyword(s):

Asymptotic Optimality

Download Full-text

A General Dimension for Approximately Learning Boolean Functions

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-36169-3_13 ◽

2002 ◽

pp. 139-148 ◽

Cited By ~ 2

Author(s):

Johannes Köbler ◽

Wolfgang Lindner

Keyword(s):

Boolean Functions ◽

General Dimension ◽

Learning Boolean Functions

Download Full-text

Minimised Residue Hypotheses in Relevant Logic

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-36169-3_23 ◽

2002 ◽

pp. 278-292 ◽

Cited By ~ 1

Author(s):

Bertram Fronhöfer ◽

Akihiro Yamamoto

Keyword(s):

Relevant Logic

Download Full-text

Lecture Notes in Computer Science - Algorithmic Learning TheoryLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Maximizing Agreements and CoAgnostic Learning

On Learning Embedded Midbit Functions

RBF Neural Networks and Descartes’ Rule of Signs

Classes with Easily Learnable Subclasses

Consistency Queries in Information Extraction

Learning Structure from Sequences, with Applications in a Digital Library

Data Mining with Graphical Models

Asymptotic Optimality of Transductive Confidence Machine

A General Dimension for Approximately Learning Boolean Functions

Minimised Residue Hypotheses in Relevant Logic

Lecture Notes in Computer Science - Algorithmic Learning Theory
Latest Publications