%0 Conference Proceedings
%T Linear Probability Forecasting
%+ Computer Learning Research Centre and Department of Computer Science, Royal Holloway
%A Zhdanov, Fedor
%A Kalnishkan, Yuri
%< avec comité de lecture
%( IFIP Advances in Information and Communication Technology
%B 6th IFIP WG 12.5 International Conference on Artificial Intelligence Applications and Innovations (AIAI)
%C Larnaca, Cyprus
%Y Harris Papadopoulos; Andreas S. Andreou; Max Bramer
%I Springer
%3 Artificial Intelligence Applications and Innovations
%V AICT-339
%P 4-11
%8 2010-10-06
%D 2010
%R 10.1007/978-3-642-16239-8_4
%K Online prediction
%K classification
%K linear regression
%K Aggregating Algorithm
%K Aggre- gating Algorithm
%Z Computer Science [cs]/Digital Libraries [cs.DL]Conference papers
%X In this paper we consider two online multi-class classification problems: classification with linear models and with kernelized models. The predictions can be thought of as probability distributions. The quality of predictions is measured by the Brier loss function. We suggest two computationally efficient algorithms to work with these problems, the second algorithm is derived by considering a new class of linear prediction models. We prove theoretical guarantees on the cumulative losses of the algorithms. We kernelize one of the algorithms and prove theoretical guarantees on the loss of the kernelized version. We perform experiments and compare our algorithms with logistic regression.
%G English
%2 https://inria.hal.science/hal-01060645/document
%2 https://inria.hal.science/hal-01060645/file/ZhdanovK10.pdf
%L hal-01060645
%U https://inria.hal.science/hal-01060645
%~ IFIP
%~ IFIP-AICT
%~ IFIP-AICT-339
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC12
%~ IFIP-AIAI
%~ IFIP-WG12-5