Lecture Notes in Computer Science - Algorithmic Learning Theory
Latest Publications

TOTAL DOCUMENTS

32

(FIVE YEARS 0)

H-INDEX

7

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642161070, 9783642161087

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Bayesian Active Learning Using Arbitrary Binary Valued Queries

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-16108-7_8 ◽

2010 ◽

pp. 50-58 ◽

Author(s):

Liu Yang ◽

Steve Hanneke ◽

Jaime Carbonell

Keyword(s):

Active Learning

Download Full-text

A PAC-Bayes Bound for Tailored Density Estimation

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-16108-7_15 ◽

2010 ◽

pp. 148-162 ◽

Author(s):

Matthew Higgs ◽

John Shawe-Taylor

Keyword(s):

Density Estimation

Download Full-text

Editors’ Introduction

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-16108-7_1 ◽

2010 ◽

pp. 1-10

Author(s):

Marcus Hutter ◽

Frank Stephan ◽

Vladimir Vovk ◽

Thomas Zeugmann

Download Full-text

PAC Learnability of a Concept Class under Non-atomic Measures: A Problem by Vidyasagar

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-16108-7_14 ◽

2010 ◽

pp. 134-147 ◽

Author(s):

Vladimir Pestov

Keyword(s):

Download Full-text

PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-16108-7_11 ◽

2010 ◽

pp. 89-103 ◽

Author(s):

Balázs Csanád Csáji ◽

Raphaël M. Jungers ◽

Vincent D. Blondel

Keyword(s):

Polynomial Time ◽

Shortest Path ◽

Stochastic Shortest Path

Download Full-text

Learning without Coding

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-16108-7_25 ◽

2010 ◽

pp. 300-314 ◽

Author(s):

Samuel E. Moelius ◽

Sandra Zilles

Download Full-text

Consistency of Feature Markov Processes

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-16108-7_29 ◽

2010 ◽

pp. 360-374 ◽

Author(s):

Peter Sunehag ◽

Marcus Hutter

Keyword(s):

Markov Processes

Download Full-text

Recursive Teaching Dimension, Learning Complexity, and Maximum Classes

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-16108-7_19 ◽

2010 ◽

pp. 209-223 ◽

Author(s):

Thorsten Doliwa ◽

Hans Ulrich Simon ◽

Sandra Zilles

Keyword(s):

Teaching Dimension

Download Full-text

Approximation Stability and Boosting

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-16108-7_9 ◽

2010 ◽

pp. 59-73 ◽

Author(s):

Wei Gao ◽

Zhi-Hua Zhou

Download Full-text

An Algorithm for Iterative Selection of Blocks of Features

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-16108-7_7 ◽

2010 ◽

pp. 35-49

Author(s):

Pierre Alquier

Keyword(s):

Download Full-text