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.
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
Algorithmic Learning Theory
Springer, Berlin, Heidelberg, October 2004
Mark Herbster, Herbster, Mark
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.
|Readers by professional status||Count||As %|
|Student > Ph. D. Student||1||25%|
|Student > Master||1||25%|
|Readers by discipline||Count||As %|