Herbster, M; (2004) Relative loss bounds and polynomial-time predictions for the K-LMS-NET algorithm. In: Ben-David, S and Case, J and Maruoka, A, (eds.) Algorithmic Learning Theory: 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004: Proceedings. (pp. 309 - 323). Springer-Verlag: Berlin / Heidelberg, Germany.