Margin-Based Algorithms for Information Filtering
暂无分享,去创建一个
[1] Philip M. Long,et al. Associative Reinforcement Learning using Linear Probabilistic Concepts , 1999, ICML.
[2] Y. Censor,et al. An iterative row-action method for interval convex programming , 1981 .
[3] Ellen M. Voorhees,et al. The Tenth Text REtrieval Conference, TREC 2001 | NIST , 2002 .
[4] Philip M. Long,et al. Apple Tasting , 2000, Inf. Comput..
[5] Osamu Watanabe,et al. Sequential Sampling Algorithms: Unified Analysis and Lower Bounds , 2001, SAGA.
[6] Manfred K. Warmuth,et al. Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions , 1999, Machine Learning.
[7] V. Vovk. Competitive On‐line Statistics , 2001 .
[8] Mark Herbster,et al. Tracking the best regressor , 1998, COLT' 98.
[9] Vladimir Vapnik,et al. Statistical learning theory , 1998 .
[10] Peter Auer,et al. Using upper confidence bounds for online learning , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[11] Nicolò Cesa-Bianchi,et al. Analysis of two gradient-based algorithms for on-line regression , 1997, COLT '97.
[12] A. E. Hoerl,et al. Ridge regression: biased estimation for nonorthogonal problems , 2000 .
[13] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[14] Philip M. Long,et al. Worst-case quadratic loss bounds for prediction using linear functions and gradient descent , 1996, IEEE Trans. Neural Networks.