R. S. Sutton, Learning to predict by the methods of temporal differences, Machine Learning, pp.9-44, 1988.
DOI : 10.1007/BF00115009

L. Li, W. Chu, J. Langford, and R. E. Schapire, A contextual-bandit approach to personalized news article recommendation, Proceedings of the 19th international conference on World wide web, WWW '10, pp.661-670, 2010.
DOI : 10.1145/1772690.1772758

M. A. Casey, R. Veltkamp, M. Goto, M. Leman, C. Rhodes et al., Content-Based Music Information Retrieval: Current Directions and Future Challenges, Proceedings of the IEEE, pp.668-696, 2008.
DOI : 10.1109/JPROC.2008.916370

O. Nicol, J. Mary, and P. Preux, Icml exploration & exploitation challenge: Keep it simple!, JMLR Proceedings, pp.62-85
URL : https://hal.archives-ouvertes.fr/hal-00747725

T. Graepel, J. Q. Candela, T. Borchert, and R. Herbrich, Webscale Bayesian click-through rate prediction for sponsored search advertising in Microsoft's Bing search engine, Proceedings of the 27th International Conference on Machine Learning (ICML-2010), pp.13-20, 2010.

L. Li, W. Chu, J. Langford, and R. E. Schapire, A contextual-bandit approach to personalized news article recommendation, Proceedings of the 19th international conference on World wide web, WWW '10, pp.661-670, 2010.
DOI : 10.1145/1772690.1772758

J. L. Herlocker, J. A. Konstan, L. G. Terveen, and T. John, Evaluating collaborative filtering recommender systems, ACM Transactions on Information Systems, vol.22, issue.1, pp.5-53, 2004.
DOI : 10.1145/963770.963772

J. Bennett and S. Lanning, The Netflix prize, Proceedings of the KDD Cup Workshop, pp.3-6, 2007.

J. Langford, A. Strehl, and J. Wortman, Exploration scavenging, Proceedings of the 25th international conference on Machine learning, ICML '08, pp.528-535, 2008.
DOI : 10.1145/1390156.1390223

L. Li, W. Chu, J. Langford, and X. Wang, Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms, Proceedings of the fourth ACM international conference on Web search and data mining, WSDM '11, pp.297-306, 2011.
DOI : 10.1145/1935826.1935878

!. Yahoo and . Researsh, R6b -yahoo! front page today module user click log dataset, p.2012

P. Auer, P. Nicoì-o-cesa-bianchi, and . Fischer, Finite-time analysis of the multiarmed bandit problem, Machine Learning, vol.47, issue.2/3, pp.235-256, 2002.
DOI : 10.1023/A:1013689704352

B. Efron, Bootstrap methods: another look at the jackknife. The annals of Statistics, pp.1-26, 1979.

B. W. Silverman and G. A. Young, The bootstrap: To smooth or not to smooth?, Biometrika, vol.74, issue.3, pp.469-479, 1987.
DOI : 10.1093/biomet/74.3.469

D. Bernoulli, Exposition of a new theory on the measurement of risk, Econometrica: Journal of the Econometric Society, pp.23-36, 1954.

A. Wald, Contributions to the Theory of Statistical Estimation and Testing Hypotheses, The Annals of Mathematical Statistics, vol.10, issue.4, pp.299-326, 1939.
DOI : 10.1214/aoms/1177732144

W. B. Powell, Approximate Dynamic Programming: Solving the curses of dimensionality . Wiley Series in Probability and Statistics, 2007.

D. Prelec and G. Loewenstein, Decision Making Over Time and Under Uncertainty: A Common Approach, Management Science, vol.37, issue.7, pp.770-786, 1991.
DOI : 10.1287/mnsc.37.7.770

H. M. Regan, Y. Ben-haim, B. Langford, W. G. Wilson, P. Lundberg et al., ROBUST DECISION-MAKING UNDER SEVERE UNCERTAINTY FOR CONSERVATION MANAGEMENT, Ecological Applications, vol.15, issue.4, pp.1471-1477, 2005.
DOI : 10.1890/1051-0761(2002)012[0618:ATATOU]2.0.CO;2

C. Wang, S. R. Kulkarni, and H. V. Poor, Bandit problems with side observations, IEEE Transactions on Automatic Control, vol.50, issue.3, pp.338-355, 2005.
DOI : 10.1109/TAC.2005.844079

J. Langford and T. Zhang, The epoch-greedy algorithm for multi-armed bandits with side information, Advances in Neural Information Processing Systems Proceedings of the 21st Annual Conference on Neural Information Processing Systems (NIPS-2007), 2008.

D. Jannach, M. Zanker, A. Felfernig, and G. Friedrich, Recommender Systems: An Introduction, 2010.
DOI : 10.1017/CBO9780511763113

D. Goldberg, D. Nichols, B. M. Oki, and D. Terry, Using collaborative filtering to weave an information tapestry, Communications of the ACM, vol.35, issue.12, pp.61-70, 1992.
DOI : 10.1145/138859.138867

G. Linden, B. Smith, and J. York, Amazon.com recommendations: item-to-item collaborative filtering, IEEE Internet Computing, vol.7, issue.1, pp.76-80, 2003.
DOI : 10.1109/MIC.2003.1167344

K. Goldberg, T. Roeder, D. Gupta, and C. Perkins, Eigentaste: A constant time collaborative filtering algorithm, Information Retrieval, vol.4, issue.2, pp.133-151, 2001.
DOI : 10.1023/A:1011419012209

Y. Koren, R. Bell, and C. Volinsky, Matrix Factorization Techniques for Recommender Systems, Computer, vol.42, issue.8, pp.4230-4267, 2009.
DOI : 10.1109/MC.2009.263

B. Sarwar, G. Karypis, J. Konstan, and J. Riedl, Application of dimensionality reduction in recommender system -a case study, Workshop on Web Mining for E-Commerce ? Challenges and Opportunities (WEBKDD-2000) (at ACM SIGKDD-2000) -without proceedings, 2000.

J. L. Herlocker, J. A. Konstan, and J. Riedl, Explaining collaborative filtering recommendations, Proceedings of the 2000 ACM conference on Computer supported cooperative work , CSCW '00, pp.241-250, 2000.
DOI : 10.1145/358916.358995

D. Mcsherry, Explanation in Recommender Systems, Artificial Intelligence Review, vol.18, issue.2, pp.179-197, 2005.
DOI : 10.1007/s10462-005-4612-x

W. Zeng, M. Shang, and T. Qian, Useful acquiring ratings for collaborative filtering, IEEE Youth Conference on Information, Computing and Telecommunication, pp.483-486, 2009.

W. T. Glaser, T. B. Westergren, J. P. Stearns, and J. M. Kraft, Consumer item matching method and system, US Patent, vol.7003, p.515, 2006.

J. Michael and . Pazzani, A framework for collaborative, content-based and demographic filtering, Artificial Intelligence Review, vol.13, pp.5-6393, 1999.

S. Debnath, N. Ganguly, and P. Mitra, Feature weighting in content based recommendation system using social network analysis, Proceeding of the 17th international conference on World Wide Web , WWW '08, pp.1041-1042, 2008.
DOI : 10.1145/1367497.1367646

J. Michael, D. Pazzani, and . Billsus, Content-based recommendation systems The Adaptive Web: Methods and Strategies of Web Personalization, pp.325-341, 2007.

R. Burke, Hybrid recommender systems: Survey and experiments. User modeling and user-adapted interaction, pp.331-370, 2002.

G. Lekakos and P. Caravelas, A hybrid approach for movie recommendation. Multimedia tools and applications, pp.55-70, 2008.

R. S. Sutton and A. G. Barto, Reinforcement Learning: An Introduction. Adaptive Computation and Machine Learning Series, 1998.
DOI : 10.1007/978-1-4615-3618-5

H. Robbins, Some aspects of the sequential design of experiments, Bulletin of the American Mathematical Society, vol.58, issue.5, pp.527-535, 1952.
DOI : 10.1090/S0002-9904-1952-09620-8

W. R. Thompson, On the likelihood that one unknown probability exceeds another in view of the evidence of two samples, Biometrika, vol.25, pp.3-4285, 1933.

T. L. Lai and H. Robbins, Asymptotically efficient adaptive allocation rules, Advances in Applied Mathematics, vol.6, issue.1, pp.4-22, 1985.
DOI : 10.1016/0196-8858(85)90002-8

S. Bubeck-andnicoì-o-cesa-bianchi, Regret analysis of stochastic and nonstochastic multi-armed bandit problems, Machine Learning, pp.1-122, 2012.

A. N. Burnetas and M. N. Katehakis, Optimal Adaptive Policies for Sequential Allocation Problems, Advances in Applied Mathematics, vol.17, issue.2, pp.122-142, 1996.
DOI : 10.1006/aama.1996.0007

J. Audibert, R. Munos, and C. Szepesvári, Exploration???exploitation tradeoff using variance estimates in multi-armed bandits, Theoretical Computer Science, vol.410, issue.19, pp.1876-1902, 2009.
DOI : 10.1016/j.tcs.2009.01.016

URL : https://hal.archives-ouvertes.fr/hal-00711069

S. Filippi, O. Cappé, and A. Garivier, Optimism in reinforcement learning and Kullback-Leibler divergence, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp.115-122, 2010.
DOI : 10.1109/ALLERTON.2010.5706896

URL : https://hal.archives-ouvertes.fr/hal-00476116

A. Garivier and O. Cappé, The KL-UCB algorithm for bounded stochastic bandits and beyond, The 24th Annual Conference on Learning Theory (COLT-2011) JMLR Proceedings, pp.359-376, 2011.

O. Cappé and A. Garivier, Kullback???Leibler upper confidence bounds for optimal sequential allocation, The Annals of Statistics, vol.41, issue.3, pp.1516-1541, 2013.
DOI : 10.1214/13-AOS1119SUPP

S. Grünewälder, J. Audibert, M. Opper, and J. Shawe-taylor, Regret bounds for gaussian process bandit problems, Proceedings of the 13th International Conference on Artificial Intelligence and Statistics (AISTATS-2010), Chia Laguna Resort JMLR Proceedings, pp.273-280, 2010.

C. John and . Gittins, Bandit processes and dynamic allocation indices, Journal of the Royal Statistical Society. Series B (Methodological), vol.41, issue.2, pp.148-177, 1979.

E. Kaufmann, N. Korda, and R. Munos, Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis, Algorithmic Learning Theory -Proceedings of the 23rd International Conference (ALT-2012), pp.199-213, 2012.
DOI : 10.1007/978-3-642-34106-9_18

URL : https://hal.archives-ouvertes.fr/hal-00830033

O. Chapelle, L. Shawe-taylor, R. S. Zemel, P. L. Bartlett, F. C. Pereira et al., An empirical evaluation of thompson sampling, Advances in Neural Information Processing Systems 24: Proceedings of the 25th Annual Conference on Neural Information Processing Systems (NIPS-2011), pp.2249-2257, 2011.

L. Steven and . Scott, A modern bayesian look at the multi-armed bandit, Applied Stochastic Models in Business and Industry, vol.26, issue.6, pp.639-658, 2010.

A. G. Barto and P. Anandan, Pattern-recognizing stochastic learning automata. Systems, Man and Cybernetics, IEEE Transactions, issue.3, pp.15360-375, 1985.

J. Glenford, C. Myers, T. Sandler, and . Badgett, The art of software testing. Business Data Processing: A Wiley Series, 2011.

D. Coleman, D. Ash, B. Lowther, and P. Oman, Using metrics to evaluate software system maintainability, Computer, vol.27, issue.8, pp.44-49, 1994.
DOI : 10.1109/2.303623

J. Bar-ilan, Google Bombing from a Time Perspective, Journal of Computer-Mediated Communication, vol.33, issue.4, pp.910-938, 2007.
DOI : 10.1111/j.1083-6101.2007.00356.x

K. Shyong, J. Lam, and . Riedl, Shilling recommender systems for fun and profit, Proceedings of the 13th international conference on World Wide Web, pp.393-402, 2004.

B. Mobasher, R. Burke, R. Bhaumik, and C. Williams, Effective attack models for shilling item-based collaborative filtering systems, Olfa Nasraoui

B. Mobasher, R. Burke, R. Bhaumik, and C. Williams, Toward trustworthy recommender systems, ACM Transactions on Internet Technology, vol.7, issue.4, p.23, 2007.
DOI : 10.1145/1278366.1278372

B. Mobasher, R. Burke, C. Williams, R. Bhaumik-osmar, R. Za¨?aneza¨?ane et al., Analysis and Detection of Segment-Focused Attacks Against Collaborative Recommendation, Olfa Nasraoui , Proceedings of the 7th International Workshop on Knowledge Discovery on the Web (WebKDD-2005) (at ACM SIGKDD-2005), volume 4198 of Lecture Notes in Computer Science, pp.96-118, 2006.
DOI : 10.1007/11891321_6

S. Zhang, Y. Ouyang, J. Ford, and F. Makedon, Analysis of a low-dimensional linear model under recommendation attacks, Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval , SIGIR '06, pp.517-524, 2006.
DOI : 10.1145/1148170.1148259

P. Massa and P. Avesani, Trust Metrics on Controversial Users, International Journal on Semantic Web and Information Systems, vol.3, issue.1, pp.39-64, 2007.
DOI : 10.4018/jswis.2007010103

R. Bhaumik, R. D. Burke, and B. Mobasher, Crawling attacks against webbased recommender systems, Proceedings of the 2007 International Conference on Data Mining (DMIN-2007), pp.183-189, 2007.

J. Elazar, Pedhazur and Liora Pedhazur Schmelkin. Measurement, design, and analysis: An integrated approach, 1991.

B. Matthew, A. M. Miles, and . Huberman, Qualitative data analysis: An expanded sourcebook, SAGE, 1994.

J. W. Creswell, Research design: Qualitative, quantitative, and mixed methods approaches, SAGE, 2009.

R. Kohavi, R. Longbotham, D. Sommerfield, and R. M. Henne, Controlled experiments on the web: survey and practical guide, Data Mining and Knowledge Discovery, vol.33, issue.6, pp.140-181, 2009.
DOI : 10.1007/s10618-008-0114-1

R. Kohavi, A study of cross-validation and bootstrap for accuracy estimation and model selection, Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-1995), pp.1137-1145

L. Steven and . Salzberg, On comparing classifiers: Pitfalls to avoid and a recommended approach, Data Mining and knowledge discovery, vol.1, issue.3, pp.317-328, 1997.

A. Michael and . Babyak, What you see may not be what you get: a brief, nontechnical introduction to overfitting in regression-type models, Psychosomatic medicine, vol.66, issue.3, pp.411-421, 2004.

T. Mahmood, F. R. , M. L. Gini, R. J. Kauffman, and D. Sarppo, Learning and adaptivity in interactive recommender systems, Proceedings of the ninth international conference on Electronic commerce, ICEC '07, pp.75-84, 2007.
DOI : 10.1145/1282100.1282114

G. Fischer, User modeling in human?computer interaction, User Modeling and User-Adapted Interaction, vol.11, issue.1/2, pp.65-86, 2001.
DOI : 10.1023/A:1011145532042

Y. Zhang and J. Koren, Efficient bayesian hierarchical user modeling for recommendation system, Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, SIGIR '07, pp.47-54, 2007.
DOI : 10.1145/1277741.1277752

A. Gunawardana and G. Shani, A survey of accuracy evaluation metrics of recommendation tasks, The Journal of Machine Learning Research (JMLR), vol.10, pp.2935-2962, 2009.

G. Carenini and R. Sharma, Exploring more realistic evaluation measures for collaborative filtering, Proceedings of the 19th National Conference on Artificial Intelligence, 16th Conference on Innovative Applications of Artificial Intelligence (AAAI-2004), pp.749-754, 2004.

S. M. Mcnee, J. Riedl, and J. A. Konstan, Being accurate is not enough, CHI '06 extended abstracts on Human factors in computing systems, CHI EA '06, pp.1097-1101, 2006.
DOI : 10.1145/1125451.1125659

U. Shardanand and P. Maes, Social information filtering, Proceedings of the SIGCHI conference on Human factors in computing systems, CHI '95, pp.210-217
DOI : 10.1145/223904.223931

S. Girgin, J. Mary, . Ph, O. Preux, and . Nicol, Advertising Campaigns Management: Should We Be Greedy?, 2010 IEEE International Conference on Data Mining, pp.821-826, 2010.
DOI : 10.1109/ICDM.2010.78

URL : https://hal.archives-ouvertes.fr/hal-00772447

M. Claypool, P. Le, M. Wased, and D. Brown, Implicit interest indicators, Proceedings of the 6th international conference on Intelligent user interfaces , IUI '01, pp.33-40, 2001.
DOI : 10.1145/359784.359836

H. Zheng, D. Wang, Q. Zhang, H. Li, and T. Yang, Do clicks measure recommendation relevancy?, Proceedings of the fourth ACM conference on Recommender systems, RecSys '10, pp.249-252, 2010.
DOI : 10.1145/1864708.1864759

R. Herbrich, T. Minka, and T. Graepel, Trueskill tm : A bayesian skill rating system, Advances in Neural Information Processing Systems, pp.569-576, 2007.

X. Amatriain and J. Basilico, Netflix recommendations: Beyond the 5 stars (part 1) The Netflix Tech Blog -http, 2012.

F. Rosenblatt, The perceptron: A probabilistic model for information storage and organization in the brain., Psychological Review, vol.65, issue.6, pp.386-408, 1958.
DOI : 10.1037/h0042519

R. Frank, B. J. Kschischang, H. Frey, and . Loeliger, Factor graphs and the sumproduct algorithm, IEEE Transactions on Information Theory, vol.47, issue.2, pp.498-519, 2001.

G. J. Mc-lachlan and T. Krishnan, The EM Algorithm and Extensions. Wiley series in Probability and Statistics, 1997.

C. Salperwyck and T. Urvoy, Stumping along a Summary for Exploration & Exploitation Challenge, JMLR Proceedings, pp.86-97, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00757998

J. Sherman and W. J. Morrison, Adjustment of an inverse matrix corresponding to changes in the elements of a given column or a given row of the original matrix, The Annals of Mathematical Statistics, vol.20, issue.12, pp.620-624

J. Sherman and W. J. Morrison, Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix, The Annals of Mathematical Statistics, vol.21, issue.1, pp.124-127, 1950.
DOI : 10.1214/aoms/1177729893

Y. Chen, P. Berkhin, B. Anderson, and . Devanur, Real-time bidding algorithms for performance-based display ad allocation, Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '11, pp.1307-1315, 2011.
DOI : 10.1145/2020408.2020604

R. Bellman, Dynamic Programming, 1957.

L. Bennett and . Fox, Finite horizon behavior of policies for two-arm bandits, Journal of the American Statistical Association, vol.69, issue.348, pp.963-965, 1974.

A. L. Strehl, J. Langford, L. Li, and S. Kakade, Learning from logged implicit exploration data, pp.2217-2225, 2010.

L. Bottou, J. Peters, J. Qui-nonero-candela, D. X. Charles, D. M. Chickering et al., Counterfactual reasoning and learning systems: The example of computational advertising, Journal of Machine Learning Research, vol.14, issue.1, pp.3207-3260, 2013.

A. Beygelzimer and J. Langford, The offset tree for learning with partial labels, Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '09, pp.129-138, 2009.
DOI : 10.1145/1557019.1557040

M. Dudík, J. Langford, and L. Li, Doubly robust policy evaluation and learning, pp.1097-1104, 2011.

F. Maes, L. Wehenkel, and D. Ernst, Automatic Discovery of Ranking Formulas for Playing with Multi-armed Bandits, Recent Advances in Reinforcement Learning -9th European Workshop (EWRL-2011)
DOI : 10.1007/978-3-642-29946-9_5

P. Law and K. Adamski, Adrosa?adaptive personalization of web advertising, Information Sciences, vol.177, issue.11, pp.2269-2295, 2007.

D. Agarwal, B. Chen, P. Elango, N. Motgi, S. Park et al., Online models for content optimization, Advances in Neural Information Processing Systems 21, Proceedings of the 22nd Annual Conference on Neural Information Processing Systems (NIPS-2008), pp.17-24, 2009.

J. Antonio-martín, H. , and A. M. Vargas, Linear Bayes policy for learning in contextual-bandits, Expert Systems with Applications, vol.40, issue.18, pp.7400-7406, 2013.
DOI : 10.1016/j.eswa.2013.07.041

J. Mary and O. Nicol, Challenge exploration and exploitation 3. INRIA website https, p.2012

L. Breiman, Random forests, Machine Learning, vol.45, issue.1, pp.5-32, 2001.
DOI : 10.1023/A:1010933404324

I. Steinwart and A. Christmann, Support vector machines. Information Science and Statistics, 2008.

A. Mccallum and K. Nigam, A comparison of event models for naive bayes text classification, Proceedings of the AAAI-98 workshop on learning for text categorization, pp.41-48, 1998.

B. Efron and R. Tibshirani, An introduction to the bootstrap, of Monographs on Statistics and Applied Probability, 1993.
DOI : 10.1007/978-1-4899-4541-9

N. Golbandi, Y. Koren, and R. Lempel, Adaptive bootstrapping of recommender systems using decision trees, Proceedings of the fourth ACM international conference on Web search and data mining, WSDM '11, pp.595-604, 2011.
DOI : 10.1145/1935826.1935910

M. H. Quenouille, Problems in Plane Sampling, The Annals of Mathematical Statistics, vol.20, issue.3, pp.355-375, 1949.
DOI : 10.1214/aoms/1177729989

M. H. Quenouille, Notes on Bias in Estimation, Biometrika, vol.43, issue.3/4, pp.353-360, 1956.
DOI : 10.2307/2332914

A. Kleiner, A. Talwalkar, P. Sarkar, and M. Jordan, The big data bootstrap, Proceedings of the 29th International Conference on Machine Learning (ICML-12), pp.1759-1766, 2012.

D. Agarwal, B. Chen, and P. Elango, Spatio-temporal models for estimating click-through rate, Proceedings of the 18th international conference on World wide web, WWW '09, pp.21-30, 2009.
DOI : 10.1145/1526709.1526713

J. Herman, G. J. Ader, D. J. Mellenbergh, and . Hand, Advising on Research Methods: a consultant's companion, 2008.

Q. Li and S. Wang, A simple consistent bootstrap test for a parametric regression function, Journal of Econometrics, vol.87, issue.1, pp.145-165, 1998.
DOI : 10.1016/S0304-4076(98)00011-6

B. Efron, Estimating the Error Rate of a Prediction Rule: Improvement on Cross-Validation, Journal of the American Statistical Association, vol.78, issue.382, pp.316-331, 1983.
DOI : 10.1080/01621459.1983.10477973

B. Efron and R. Tibshirani, Improvements on cross-validation: the 632+ bootstrap method, Journal of the American Statistical Association, vol.92, issue.438, pp.548-560, 1997.

L. Breiman, Bagging predictors, Machine Learning, vol.10, issue.2, pp.123-140, 1996.
DOI : 10.1007/BF00058655

R. Esposito and L. Saitta, Monte carlo theory as an explanation of bagging and boosting, Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-2003), pp.499-504, 2003.

J. L. Horowitz, The bootstrap. Handbook of econometrics, pp.3159-3228, 2001.

P. Koistinen and L. Holmström, Kernel regression and backpropagation training with noise, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks, pp.1033-1039, 1992.
DOI : 10.1109/IJCNN.1991.170429

C. M. Bishop, Neural Networks for Pattern Recognition, 1995.

P. Hall, The bootstrap and edgeworth expansion, 1992.
DOI : 10.1007/978-1-4612-4384-7

P. Auer, N. Cesa-bianchi, Y. Freund, and R. E. Schapire, The Nonstochastic Multiarmed Bandit Problem, SIAM Journal on Computing, vol.32, issue.1, pp.48-77, 2002.
DOI : 10.1137/S0097539701398375

O. Nicol, J. Mary, and P. Preux, Improving offline evaluation of contextual bandit algorithms via bootstrapping techniques, Proceedings of the 31th International Conference on Machine Learning (ICML-2014) JMLR Proceedings, pp.172-180, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00990840

Y. M. Bishop, S. E. Fienberg, and P. W. Holland, Discrete multivariate analysis: theory and practice, Theory and Applications, 2007.

J. Peter, D. A. Bickel, and . Freedman, Some asymptotic theory for the bootstrap, The Annals of Statistics, vol.9, issue.6, pp.1196-1217, 1981.

E. Giné and J. Zinn, Bootstrapping general empirical measures. The Annals of Probability, pp.851-869, 1990.

R. N. Bhattacharya and J. K. Ghosh, On the Validity of the Formal Edgeworth Expansion, The Annals of Statistics, vol.6, issue.2, pp.434-451, 1978.
DOI : 10.1214/aos/1176344134

P. J. Bickel, F. Götze, and W. R. Van-zwet, Resampling Fewer Than n Observations: Gains, Losses, and Remedies for Losses, Statistica Sinica, vol.7, issue.1, pp.1-32, 1997.
DOI : 10.1007/978-1-4614-1314-1_17

E. Leo-lehmann and G. Casella, Theory of point estimation, Texts in Applied Mathematics, vol.31, 1998.

A. Vassiliy and . Epanechnikov, Non-parametric estimation of a multivariate probability density . Theory of Probability & Its Applications, pp.153-158, 1969.

M. P. Wand and M. C. Jones, Kernel smoothing, of Monographs on Statistics and Applied Probability, 1995.
DOI : 10.1007/978-1-4899-4493-1

W. Bernard and . Silverman, Density estimation for statistics and data analysis, of Monographs on Statistics and Applied Probability, 1986.

M. , C. Jones, J. S. Marron, and S. J. Sheather, A brief survey of bandwidth selection for density estimation, Journal of the American Statistical Association, issue.433, pp.91401-407, 1996.

D. W. Scott, Multivariate Density Estimation: Theory, Practice, and Visualization. Wiley Series in Probability and Statistics, 1992.

D. Edgar and L. , Bootstrapping: estimating confidence intervals, standard errors, and bias. Data sorcery blog http://data-sorcery.org/category, 2009.

M. Peter and . Robinson, Nonparametric estimators for time series, Journal of Time Series Analysis, vol.4, issue.3, pp.185-207, 1983.

J. Simon, M. C. Sheather, and . Jones, A reliable data-based bandwidth selection method for kernel density estimation, Journal of the Royal Statistical Society, Series B, vol.53, issue.3, pp.683-690, 1991.

A. W. Bowman, An alternative method of cross-validation for the smoothing of density estimates, Biometrika, vol.71, issue.2, pp.353-360, 1984.
DOI : 10.1093/biomet/71.2.353

P. Hall, J. S. Marron, and B. U. Park, Smoothed cross-validation. Probability Theory and Related Fields, pp.1-20, 1992.

J. Langford, . Li, A. James, B. Hanley, and . Macgibbon, Vowpal wabbit online learning project Creating non-parametric bootstrap samples using poisson frequencies. computer methods and programs in biomedicine, pp.57-62, 2006.

A. Sani, A. Lazaric, R. Peter, L. Bartlett, F. C. Pereira et al., Risk-aversion in multi-armed bandits, Advances in Neural Information Processing Systems 25: Proceedings of the 26th Annual Conference on Neural Information Processing Systems (NIPS-2012), pp.3284-3292, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00772609

N. Galichet, M. Sebag, and O. Teytaud, Exploration vs exploitation vs safety: Risk-aware multi-armed bandits, pp.245-260, 2013.

P. Auer and R. Ortner, UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem, Periodica Mathematica Hungarica, vol.5, issue.1-2, pp.55-65, 2010.
DOI : 10.1007/s10998-010-3055-6

J. Audibert and S. Bubeck, Regret bounds and minimax policies under partial monitoring, The Journal of Machine Learning Research (JMLR), vol.11, pp.2785-2836, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00654356

R. Likert, A technique for the measurement of attitudes. Archives of psychology, pp.1-55, 1932.

D. Cosley, S. K. Lam, I. Albert, J. A. Konstan, and J. Riedl, Is seeing believing?, Proceedings of the conference on Human factors in computing systems , CHI '03, pp.585-592, 2003.
DOI : 10.1145/642611.642713

J. B. Schafer, D. Frankowski, J. Herlocker, and S. Sen, Collaborative filtering recommender systems The adaptive web, Methods and Strategies of Web Personalization, Lecture Notes in Computer Science, pp.291-324, 2007.

J. L. Herlocker, J. A. Konstan, A. Borchers, and J. Riedl, An algorithmic framework for performing collaborative filtering, Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval , SIGIR '99, pp.230-237, 1999.
DOI : 10.1145/312624.312682

J. S. Breese, D. Heckerman, and C. Kadie, Empirical analysis of predictive algorithm for collaborative filtering, Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (UAI-1998), pp.43-52, 1998.

J. L. Herlocker, J. A. Konstan, and J. Riedl, An empirical analysis of design choices in neighborhood-based collaborative filtering algorithms, Information Retrieval, vol.5, issue.4, pp.287-310, 2002.
DOI : 10.1023/A:1020443909834

B. Sarwar, G. Karypis, J. Konstan, and J. Riedl, Item-based collaborative filtering recommendation algorithms, Proceedings of the tenth international conference on World Wide Web , WWW '01
DOI : 10.1145/371920.372071

S. Deerwester, S. T. Dumais, G. W. Furnas, T. K. Landauer, and R. Harshman, Indexing by latent semantic analysis, Journal of the American Society for Information Science, vol.41, issue.6, pp.41391-407, 1990.
DOI : 10.1002/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9

G. Golub and W. Kahan, Calculating the Singular Values and Pseudo-Inverse of a Matrix, Journal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis, vol.2, issue.2, pp.205-224, 1965.
DOI : 10.1137/0702016

C. Eckart and G. Young, The approximation of one matrix by another of lower rank, Psychometrika, vol.1, issue.3, pp.211-218, 1936.
DOI : 10.1007/BF02288367

S. Funk, Netflix update: Try this at home. Project Sifter http://sifter.org/ ~ simon, 2006.

L. Bottou, Online algorithms and stochastic approximations, Online Learning and Neural Networks, pp.9-42, 1998.

C. Krzysztof and . Kiwiel, Convergence and efficiency of subgradient methods for quasiconvex minimization, Mathematical programming, vol.90, issue.1, pp.1-25, 2001.

M. Robert, Y. Bell, and . Koren, Scalable collaborative filtering with jointly derived neighborhood interpolation weights, Proceedings of the 7th IEEE International Conference on Data Mining (ICDM-2007), pp.43-52, 2007.

Y. Zhou, D. Wilkinson, R. Schreiber, and R. Pan, Large-Scale Parallel Collaborative Filtering for the Netflix Prize, Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM-2008), pp.337-348, 2008.
DOI : 10.1007/978-3-540-68880-8_32

Y. Hu, Y. Koren, and C. Volinsky, Collaborative Filtering for Implicit Feedback Datasets, 2008 Eighth IEEE International Conference on Data Mining, pp.263-272, 2008.
DOI : 10.1109/ICDM.2008.22

R. Salakhutdinov, A. Mnih, and G. Hinton, Restricted Boltzmann machines for collaborative filtering, Proceedings of the 24th international conference on Machine learning, ICML '07, pp.791-798, 2007.
DOI : 10.1145/1273496.1273596

C. Sutton and Q. Castella, Recommendation track of the 2012 international conference in machine learning (icml-2012). Session 8D http, p.2012, 2012.

A. I. Schein, A. Popescul, L. H. Ungar, and D. M. Pennock, Methods and metrics for cold-start recommendations, Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval , SIGIR '02, pp.253-260, 2002.
DOI : 10.1145/564376.564421

X. Nhat-lam, T. Vu, T. Duc-le, and A. D. Duong, Addressing cold-start problem in recommendation systems Recommending and evaluating choices in a virtual community of use, Proceedings of the 2nd International Conference on Ubiquitous Information Management and Communication (ICUIMC-2008) Proceedings of the 2005 Conference on Human Factors in Computing Systems (CHI-1995), pp.208-211, 1995.

C. Ziegler, S. M. Mcnee, J. A. Konstan, and G. Lausen, Improving recommendation lists through topic diversification, Proceedings of the 14th international conference on World Wide Web , WWW '05, pp.22-32, 2005.
DOI : 10.1145/1060745.1060754

H. Chernoff, A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations, The Annals of Mathematical Statistics, vol.23, issue.4, pp.493-507, 1952.
DOI : 10.1214/aoms/1177729330