Loss Bounds for Online Category Ranking
暂无分享,去创建一个
[1] Koby Crammer,et al. A Family of Additive Online Algorithms for Category Ranking , 2003, J. Mach. Learn. Res..
[2] Koby Crammer. Online Learning for Complex Cat-egorial Problems , 2005 .
[3] Yoram Singer,et al. Improved Boosting Algorithms Using Confidence-rated Predictions , 1998, COLT' 98.
[4] Claudio Gentile,et al. Linear Hinge Loss and Average Margin , 1998, NIPS.
[5] Koby Crammer,et al. Online Passive-Aggressive Algorithms , 2003, J. Mach. Learn. Res..
[6] Jason Weston,et al. Kernel methods for Multi-labelled classification and Categ orical regression problems , 2001, NIPS 2001.
[7] Koby Crammer,et al. A new family of online algorithms for category ranking , 2002, SIGIR '02.
[8] Manfred K. Warmuth,et al. Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions , 1999, Machine Learning.
[9] L. Bregman. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming , 1967 .
[10] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[11] Y. Singer,et al. Ultraconservative online algorithms for multiclass problems , 2003 .
[12] Andrzej Stachurski,et al. Parallel Optimization: Theory, Algorithms and Applications , 2000, Parallel Distributed Comput. Pract..
[13] Yoram Singer,et al. Logistic Regression, AdaBoost and Bregman Distances , 2000, Machine Learning.