You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Mendeley readers
Chapter title |
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
|
---|---|
Chapter number | 24 |
Book title |
Algorithmic Learning Theory
|
Published by |
Springer, Berlin, Heidelberg, October 2004
|
DOI | 10.1007/978-3-540-30215-5_24 |
Book ISBNs |
978-3-54-023356-5, 978-3-54-030215-5
|
Authors |
Mark Herbster, Herbster, Mark |
Mendeley readers
The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Czechia | 1 | 25% |
Unknown | 3 | 75% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 1 | 25% |
Lecturer | 1 | 25% |
Other | 1 | 25% |
Student > Master | 1 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 4 | 100% |