nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A geometric approach to leveraging weak learners
|
Duffy, Nigel |
|
2002 |
284 |
1 |
p. 67-108 42 p. |
artikel |
2 |
Avoiding coding tricks by hyperrobust learning
|
Ott, Matthias |
|
2002 |
284 |
1 |
p. 161-180 20 p. |
artikel |
3 |
Direct and indirect algorithms for on-line learning of disjunctions
|
Helmbold, D.P |
|
2002 |
284 |
1 |
p. 109-142 34 p. |
artikel |
4 |
Foreword
|
Fischer, Paul |
|
2002 |
284 |
1 |
p. 1-2 2 p. |
artikel |
5 |
Hardness results for neural network approximation problems
|
Bartlett, Peter L. |
|
2002 |
284 |
1 |
p. 53-66 14 p. |
artikel |
6 |
Lower bounds for the rate of convergence in nonparametric pattern recognition
|
Antos, András |
|
2002 |
284 |
1 |
p. 3-24 22 p. |
artikel |
7 |
Mind change complexity of learning logic programs
|
Jain, Sanjay |
|
2002 |
284 |
1 |
p. 143-160 18 p. |
artikel |
8 |
On the rate of convergence of error estimates for the partitioning classification rule
|
Pintér, Márta |
|
2002 |
284 |
1 |
p. 181-196 16 p. |
artikel |
9 |
Query by committee, linear separation and random walks
|
Fine, Shai |
|
2002 |
284 |
1 |
p. 25-51 27 p. |
artikel |