, Processus général de la capture de données

, Gain vs temps base USElections modèle statique

, Gain vs temps base OlympicGames modèle statique

, Gain vs temps base Brexit modèle statique

, Gain vs temps vs k base USElections modèle statique

, Gain vs temps XP en ligne modèle statique

.. .. Score,

. .. , Score OFUL en deux dimensions avec incertitude sur les profils, p.79

, Gain vs temps base USElections modèle statique

, Gain vs temps base OlympicGames modèle statique

, Gain vs temps base Brexit modèle statique

. .. Modèle-contextuel-génératif,

, Récompense finale pour tous les algorithmes testés sur la base USElections, p.117

, Récompense finale pour tous les algorithmes testés sur la base OlympicGames, p.118

. .. Brexit, Récompense finale pour tous les algorithmes testés sur la base, p.119

, Récompense cumulée en fonction du temps dans l'expérience

. .. Modèle, 101 7.2.2 Prise en compte des utilisateurs dont le contexte n'est pas visible

. .. Expérimentations,

. .. Données-réelles,

.. .. Conclusion,

. Bibliographie-;-abbasi-yadkori, Improved algorithms for linear stochastic bandits, Advances in Neural Information Processing Systems 24 : 25th Annual Conference on Neural Information Processing Systems, pp.12-14, 2011.

. Abiteboul, Adaptive on-line page importance computation, Proceedings of the Twelfth International World Wide Web Conference, pp.280-290, 2003.

. Aggarwal, A framework for clustering evolving data streams, Proceedings of the 29th International Conference on Very Large Data Bases, vol.29, p.15, 2003.

. Aggarwal, On demand classification of data streams, Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '04, p.15, 2004.

. Agrawal, S. Agrawal, and N. Goyal, Analysis of thompson sampling for the multi-armed bandit problem, COLT 2012 -The 25th Annual Conference on Learning Theory, vol.26, p.37, 2012.

. Agrawal, S. Agrawal, and N. Goyal, Further optimal regret bounds for thompson sampling, vol.35, p.113, 2012.

. Agrawal, S. Agrawal, and N. Goyal, Thompson sampling for contextual bandits with linear payoffs, Proceedings of the 30th International Conference on Machine Learning, ICML 2013, vol.1, p.45, 2013.

[. Alla, Event tracking, p.17, 1998.

A. , Online learning with feedback graphs : Beyond bandits. CoRR, 2015.

A. , From bandits to experts : A tale of domination and independence, Advances in Neural Information Processing Systems 26 : 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held, vol.48, pp.1610-1618, 2013.

[. Anantharam, Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-part i : I.i.d. rewards, IEEE Transactions on Automatic Control, vol.45, p.46, 1987.

J. Audibert and S. Bubeck, Minimax policies for adversarial and stochastic bandits, COLT 2009 -The 22nd Conference on Learning Theory, vol.32, p.68, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00834882

. Audibert, Regret in online combinatorial optimization, Math. Oper. Res, vol.39, issue.1, pp.31-45, 2014.

. Audibert, Exploration-exploitation tradeoff using variance estimates in multi-armed bandits, Theor. Comput. Sci, vol.410, issue.19, p.31, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00711069

. Audiffren, J. Ralaivola-;-audiffren, and L. Ralaivola, Cornering stationary and restless mixing bandits with remix-ucb, Advances in Neural Information Processing Systems 28 : Annual Conference on Neural Information Processing Systems, vol.49, pp.3339-3347, 2015.

[. Auer, Finite-time analysis of the multiarmed bandit problem, Machine Learning, vol.47, p.64, 2002.

[. Auer, Finite-time analysis of the multiarmed bandit problem, Machine Learning, vol.47, pp.235-256, 2002.

B. Awerbuch and R. D. Kleinberg, Adaptive routing with endto-end feedback : Distributed learning and geometric approaches, Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing, STOC '04, p.23, 2004.

[. Babcock, Models and issues in data stream systems, Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, vol.15, pp.1-16, 2002.

[. Babcock, Load shedding for aggregation queries over data streams, Proceedings of the 20th International Conference on Data Engineering, vol.15, pp.350-361, 2004.

[. Babcock, Load Shedding in Data Stream Systems, p.15, 2007.

[. Bao, Effective deployment of monitoring points on social networks, International Conference on Computing, Networking and Communications, vol.18, pp.62-66, 2015.

M. J. Beal, Variational Algorithms for Approximate Bayesian Inference, p.131, 2003.

[. Bechini, Towards a general architecture for social media data capture from a multi-domain perspective, 30th IEEE International Conference on Advanced Information Networking and Applications, vol.2016, pp.1093-1100, 2016.

N. Belkin, M. Belkin, and P. Niyogi, Laplacian eigenmaps for dimensionality reduction and data representation, Neural Comput, vol.15, issue.6, pp.1373-1396, 2003.

A. Bifet and E. Frank, Sentiment knowledge discovery in twitter streaming data, Discovery Science -13th International Conference, DS 2010, vol.18, pp.1-15, 2010.

, Pattern Recognition and Machine Learning (Information Science and Statistics), p.103, 2006.

[. Blei, Latent dirichlet allocation, Journal of Machine Learning Research, vol.3, p.59, 2003.

[. Bnaya, Bandit algorithms for social network queries, 2013 International Conference on Social Computing, vol.24, pp.148-153, 2013.

[. Boanjak, Twitterecho : A distributed focused crawler to support open research with twitter data, Proceedings of the 21st International Conference Companion on World Wide Web, WWW '12 Companion, p.13, 2012.

[. Bourigault, Learning social network embeddings for predicting information diffusion, Seventh ACM International Conference on Web Search and Data Mining, pp.393-402, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01211783

[. Bourigault, Learning distributed representations of users for source detection in online social networks, Machine Learning and Knowledge Discovery in Databases -European Conference, ECML PKDD 2016, pp.265-281, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01345751

[. Bubeck, C. Bubeck, S. Cesa-bianchi, and N. , Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems. Foundations and Trends® in Machine Learning, vol.5, p.25, 2012.

S. Bubeck and C. Liu, Prior-free and prior-dependent regret bounds for thompson sampling, 48th Annual Conference on Information Sciences and Systems, vol.35, pp.1-9, 2014.

[. Bubeck, Online optimization in x-armed bandits, Advances in Neural Information Processing Systems 21, Proceedings of the Twenty-Second Annual Conference on Neural Information Processing Systems, vol.39, pp.201-208, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00329797

[. Buccapatnam, Stochastic bandits with side observations on networks, ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS '14, vol.47, pp.289-300, 2014.

[. Cappé, , 2013.

, Kullback-leibler upper confidence bounds for optimal sequential allocation, Annals of Statistics, vol.41, issue.3, p.34

[. Caron, Leveraging side observations in stochastic bandits, Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, vol.47, pp.142-151, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01270324

[. Carpentier, A. Valko-;-carpentier, and M. Valko, Revealing graph bandits for maximizing local influence, Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, vol.47, pp.10-18, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01304020

[. Cataldi, Emerging topic detection on twitter based on temporal and social terms evaluation, Proceedings of the Tenth International Workshop on Multimedia Data Mining, MDMKDD '10, vol.4, p.17, 2010.

[. Catanese, Crawling facebook for social network analysis purposes, Proceedings of the International Conference on Web Intelligence, Mining and Semantics, pp.52-65, 2011.

. Cesa-bianchi, A gang of bandits, Advances in Neural Information Processing Systems 26 : 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held, vol.24, p.47, 2013.

[. Chakrabarti, Focused crawling : A new approach to topic-specific web resource discovery, Proceedings of the Eighth International Conference on World Wide Web, WWW '99, pp.1623-1640, 1999.

L. ;. Chapelle, O. Chapelle, and L. Li, An empirical evaluation of thompson sampling, Advances in Neural Information Processing Systems 24 : 25th Annual Conference on Neural Information Processing Systems, vol.35, p.43, 2011.

[. Chen, Combinatorial multi-armed bandit : General framework and applications, Proceedings of the 30th International Conference on Machine Learning, ICML 2013, vol.45, p.64, 2013.

[. Cho, G. Cho, J. Garcia-molina, and H. , Effective page refresh policies for web crawlers, ACM Trans. Database Syst, vol.28, issue.4, pp.390-426, 2003.

[. Chu, Contextual bandits with linear payoff functions, Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, vol.1, p.42, 2011.

R. Colbaugh and K. Glass, Emerging topic detection for business intelligence via predictive analysis of 'meme' dynamics, AI for Business Agility, Papers from the 2011 AAAI Spring Symposium, p.18, 2011.

R. Combes and A. Proutière, Unimodal bandits : Regret lower bounds and optimal algorithms, Proceedings of the 31th International Conference on Machine Learning, vol.39, pp.521-529, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01092662

. Combes, Combinatorial bandits revisited, Advances in Neural Information Processing Systems 28 : Annual Conference on Neural Information Processing Systems, vol.45, pp.2116-2124, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01257796

[. Dani, Stochastic linear optimization under bandit feedback, 21st Annual Conference on Learning Theory -COLT, vol.42, pp.355-366, 2008.

[. Datar, Maintaining stream statistics over sliding windows : (extended abstract), Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '02, p.16, 2002.

P. De-la, Self-Normalized Processes : Limit Theory and Statistical Applications. Springer Series in Probability and its Applications. Springer, vol.31, p.11, 1974.

. Domingos, P. M. Hulten-;-domingos, and G. Hulten, Mining high-speed data streams, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, vol.15, pp.71-80, 2000.

[. Filippi, Regret Bounds for Opportunistic Channel Access, 2009.

. Fogaras, Towards scaling fully personalized pagerank : Algorithms, lower bounds, and experiments, Internet Mathematics, vol.2, issue.3, pp.333-358, 2005.

S. Fortunato, Community detection in graphs, Physics Reports, vol.13, 2010.

[. Gaber, Mining data streams : a review, SIGMOD Record, vol.34, issue.2, pp.18-26, 2005.

A. Garivier, The kl-ucb algorithm for bounded stochastic bandits and beyond, COLT. 1, vol.33, p.34, 2011.

A. Garivier and E. Moulines, On upper-confidence bound policies for switching bandit problems, Algorithmic Learning Theory -22nd International Conference, vol.49, p.135, 2011.

[. Gentile, Online clustering of bandits, Proceedings of the 31th International Conference on Machine Learning, vol.24, p.47, 2014.

[. Gisselbrecht, Apprentissage en temps réel pour la collecte d'information dans les réseaux sociaux, vol.18, pp.39-58, 2015.

[. Gisselbrecht, Apprentissage en temps réel pour la collecte d'information dans les réseaux sociaux, CORIA 2015 -Conférence en Recherche d'Infomations et Applications -12th French Information Retrieval Conference, pp.7-22, 2015.

[. Gisselbrecht, Whichstreams : A dynamic approach for focused data capture from large social media, Proceedings of the Ninth International Conference on Web and Social Media, ICWSM 2015, pp.130-139, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01355397

[. Gisselbrecht, Policies for contextual bandit problems with count payoffs, 27th IEEE International Conference on Tools with Artificial Intelligence, vol.2015, pp.542-549, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01355404

[. Gisselbrecht, Bandit contextuel pour la capture de données temps réel sur les médias sociaux, CORIA 2016 -Conférence en Recherche d'Informations et Applications-13th French Information Retrieval Conference, 2016.

[. Gisselbrecht, Collecte ciblée à partir de flux de données en ligne dans les médias sociaux : une approche de bandit contextuel, Document Numérique, vol.19, issue.2-3, pp.11-30, 2016.

[. Gisselbrecht, Dynamic data capture from social media streams : A contextual bandit approach, Proceedings of the Tenth International Conference on Web and Social Media, pp.131-140, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01355400

[. Gisselbrecht, Linear bandits in unknown environments, Machine Learning and Knowledge Discovery in Databases -European Conference, ECML PKDD 2016, pp.282-298, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01357953

[. Gjoka, Walking in facebook : A case study of unbiased sampling of osns, INFOCOM 2010. 29th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, pp.2498-2506, 2010.

. Gomez-rodriguez, Inferring networks of diffusion and influence, vol.5, 2012.

[. Gopalan, Thompson sampling for complex online problems, Proceedings of the 31th International Conference on Machine Learning, vol.45, pp.100-108, 2014.

[. Guha, Rehist : Relative error histogram construction algorithms, Proceedings of the Thirtieth International Conference on Very Large Data Bases, vol.30, p.16, 2004.

[. Gulli, A. Signorini-;-gulli, and A. Signorini, The indexable web is more than 11.5 billion pages, Special Interest Tracks and Posters of the 14th International Conference on World Wide Web, WWW '05, p.11, 2005.

[. Gupta, WTF : the who to follow service at twitter, 22nd International World Wide Web Conference, WWW '13, pp.505-514, 2013.

[. Gur, Stochastic multi-armed-bandit problem with non-stationary rewards, Advances in Neural Information Processing Systems 27 : Annual Conference on Neural Information Processing Systems, vol.48, p.49, 2014.

. Guralnik, V. Srivastava-;-guralnik, and J. Srivastava, Event detection from time series data, Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '99, p.16, 1999.

[. Hannon, Recommending twitter users to follow using content and collaborative filtering approaches, Proceedings of the 2010 ACM Conference on Recommender Systems, pp.199-206, 2010.

, Distributional structure, Z. S, 1954.

[. Hesabi, Anytime concurrent clustering of multiple streams with an indexing tree, Proceedings of the 4th International Conference on Big Data, Streams and Heterogeneous Source Mining : Algorithms, Systems, Programming Models and Applications, vol.41, pp.19-32, 2015.

[. Himberg, Time series segmentation for context recognition in mobile devices, Proceedings 2001 IEEE International Conference on Data Mining, vol.16, pp.203-210, 2001.

W. Hoeffding, Probability inequalities for sums of bounded random variables, Journal of the American Statistical Association, vol.58, issue.301, p.29, 1963.

T. Hofmann, Probabilistic latent semantic indexing, SIGIR '99 : Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, vol.12, pp.50-57, 1999.

T. Honda, J. Honda, and A. Takemura, An asymptotically optimal bandit algorithm for bounded support models, Proceedings of the Twenty-third Conference on Learning Theory (COLT 2010, p.37, 2010.

T. Honda, J. Honda, A. Takemura, L. Hong, and B. D. Davison, An asymptotically optimal policy for finite support models in the multiarmed bandit problem, Machine Learning, vol.85, issue.3, pp.361-391, 2010.

P. Indyk and R. Motwani, Approximate nearest neighbors : Towards removing the curse of dimensionality, Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC '98, p.15, 1998.

T. Joachims, Text categorization with suport vector machines : Learning with many relevant features, Proceedings of the 10th European Conference on Machine Learning, ECML '98, vol.58, pp.137-142, 1998.

[. Joshi, S. Boyd-;-joshi, and S. Boyd, Sensor selection via convex optimization, Trans. Sig. Proc, vol.57, issue.2, pp.451-462, 2009.

R. E. Kalman, A new approach to linear filtering and prediction problems, Transactions of the ASME-Journal of Basic Engineering, vol.82, pp.35-45, 1960.

[. Kargupta, VEDAS : A mobile and distributed data stream mining system for real-time vehicle monitoring, Proceedings of the Fourth SIAM International Conference on Data Mining, vol.15, pp.300-311, 2004.

[. Karlsson, Forecasting with bayesian vector autoregressions. Handbook of Economic Forecasting, vol.2, pp.791-897, 2013.

[. Kaufmann, On bayesian upper confidence bounds for bandit problems, Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, vol.2012, p.37, 2012.
URL : https://hal.archives-ouvertes.fr/hal-02286440

[. Kaufmann, Thompson sampling : An asymptotically optimal finite-time analysis, Algorithmic Learning Theory -23rd International Conference, ALT 2012, vol.1, p.36, 2012.
URL : https://hal.archives-ouvertes.fr/hal-02286442

[. Kempe, Maximizing the spread of influence through a social network, Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.137-146, 2003.

W. Kingma, D. P. Kingma, and M. Welling, Auto-encoding variational bayes, 2013.

[. Kleinberg, Regret bounds for sleeping experts and bandits, 21st COLT, vol.65, pp.425-436, 2008.

[. Kocák, Online learning with noisy side observations, Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, vol.48, pp.1186-1194, 2016.

[. Kocák, Efficient learning by implicit exploration in bandit problems with side observations, Advances in Neural Information Processing Systems 27 : Annual Conference on Neural Information Processing Systems, vol.48, pp.613-621, 2014.

[. Kocák, Spectral thompson sampling, Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, vol.47, pp.1911-1917, 2014.

L. Kocsis and C. Szepesvári, Bandit based monte-carlo planning, Machine Learning : ECML 2006, 17th European Conference on Machine Learning, pp.282-293, 2006.

[. Komiyama, Optimal regret analysis of thompson sampling in stochastic multi-armed bandit problem with multiple plays, Proceedings of the 32nd International Conference on Machine Learning, vol.45, p.46, 2015.

B. Kulis and K. Grauman, Kernelized locality-sensitive hashing for scalable image search, IEEE International Conference on Computer Vision (ICCV, p.15, 2009.

[. Kumar, Survey of web crawling algorithms. Advances in Vision Computing, An International Journal, p.11, 2014.

[. Lage, Choosing which message to publish on social networks : a contextual bandit approach, Advances in Social Networks Analysis and Mining 2013, ASONAM '13, vol.24, pp.620-627, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01215178

[. Lai, T. Robbins-;-lai, and H. Robbins, Asymptotically efficient adaptive allocation rules, Advances in Applied Mathematics, vol.6, issue.1, pp.4-22, 1985.

Y. Lee, Spherical hashing, Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), CVPR '12, p.15, 2012.

[. Li, Unbiased offline evaluation of contextualbandit-based news article recommendation algorithms, Proceedings of the Fourth International Conference on Web Search and Web Data Mining (WSDM-11), pp.297-306, 2011.

[. Li, Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms, Proceedings of the Forth International Conference on Web Search and Web Data Mining, WSDM 2011, vol.38, p.111, 2011.

[. Li, Towards social data platform : Automatic topic-focused monitor for twitter stream, PVLDB, vol.6, issue.14, pp.1966-1977, 2013.

[. Li, Collaborative filtering bandits, Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, SIGIR 2016, vol.47, pp.539-548, 2016.

T. Liu, Learning to rank for information retrieval, Found. Trends Inf. Retr, vol.3, issue.3, pp.225-331, 2009.

Z. Lv, Y. Lv, and C. Zhai, Lower-bounding term frequency normalization, Proceedings of the 20th ACM Conference on Information and Knowledge Management, CIKM 2011, vol.12, pp.7-16, 2011.

[. Maillard, A finite-time analysis of multiarmed bandits problems with kullback-leibler divergences, COLT 2011 -The 24th Annual Conference on Learning Theory, vol.33, pp.497-514, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00574987

[. Mane, Real time sentiment analysis of twitter data using hadoop, International Journal of Computer Science and Information Technologies, issue.18, 2014.

. Mannor, S. Shamir-;-mannor, and O. Shamir, From bandits to experts : On the value of side-observations, Advances in Neural Information Processing Systems 24 : 25th Annual Conference on Neural Information Processing Systems, vol.47, p.48, 2011.

[. Martis, {ECG} beat classification using pca, lda, {ICA} and discrete wavelet transform, Biomedical Signal Processing and Control, vol.8, issue.5, pp.437-448, 2013.

A. O. Mendelzon, Review -authoritative sources in a hyperlinked environment, ACM SIGMOD Digital Review, vol.1, p.11, 2000.

[. Micarelli, A. Gasparetti-;-micarelli, and F. Gasparetti, Adaptive focused crawling, The Adaptive Web, vol.4321, p.11, 2007.

[. Mikolov, Efficient estimation of word representations in vector space, CoRR, 2013.

T. P. Minka, A Family of Algorithms for Approximate Bayesian Inference, 2001.

[. Ortner, Regret bounds for restless markov bandits, Theor. Comput. Sci, vol.558, p.131, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00765450

[. Osband, (more) efficient reinforcement learning via posterior sampling, Advances in Neural Information Processing Systems 26 : 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held, vol.35, pp.3003-3011, 2013.

[. Page, The pagerank citation ranking : Bringing order to the web, p.11, 1999.

[. Pandey, Multi-armed bandit problems with dependent arms, Proceedings of the 24th International Conference on Machine Learning, ICML '07, p.23, 2007.

B. Pang and L. Lee, Opinion mining and sentiment analysis. Foundations and Trends in Information Retrieval, vol.2, pp.1-135, 2007.

[. Papadimitriou, Adaptive, hands-off stream mining, Proceedings of the 29th International Conference on Very Large Data Bases, vol.29, p.15, 2003.

[. Pinto, Locating the source of diffusion in large-scale networks, 2012.

[. Preux, Bandits attack function optimization, Proceedings of the IEEE Congress on Evolutionary Computation, pp.2245-2252, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00978637

. Qin, Contextual combinatorial bandit and its application on diversified online recommendation, Proceedings of the 2014 SIAM International Conference on Data Mining, vol.45, pp.461-469, 2014.

. Qin, Letor : A benchmark collection for research on learning to rank for information retrieval, Inf. Retr, vol.13, issue.4, pp.346-374, 2010.

L. R. Rabiner, A tutorial on hidden markov models and selected applications in speech recognition, PROCEEDINGS OF THE IEEE, vol.131, pp.257-286, 1989.

O. Rivasplata, Subgaussian random variables : An expository note, vol.39, p.76, 2012.

R. Rosenfeld, Two decades of statistical language modeling : Where do we go from here, Proceedings of the IEEE, p.12, 2000.

P. Rusmevichientong and J. N. Tsitsiklis, Linearly parameterized bandits, Math. Oper. Res, vol.35, issue.2, pp.395-411, 2010.

R. ;. Russo, D. Russo, and B. V. Roy, Learning to optimize via information-directed sampling, Advances in Neural Information Processing Systems 27 : Annual Conference on Neural Information Processing Systems, vol.35, pp.1583-1591, 2014.

[. , Okapi at trec-3, Overview of the Third Text REtrieval Conference, p.12, 1995.

[. Saito, Prediction of information diffusion probabilities for independent cascade model, Knowledge-Based Intelligent Information and Engineering Systems, 12th International Conference, pp.67-75, 2008.

A. Slivkins and E. Upfal, Adapting to a changing environment : the brownian restless bandits, 21st Annual Conference on Learning Theory -COLT, vol.48, pp.343-354, 2008.

. Spaan, M. T. Lima-;-spaan, and P. U. Lima, A decision-theoretic approach to dynamic sensor selection in camera networks, Int. Conf. on Automated Planning and Scheduling, vol.16, pp.279-304, 2009.

B. Sutton, R. S. Sutton, and A. G. Barto, Introduction to Reinforcement Learning, p.27, 1998.

I. Taxidou, Realtime analysis of information diffusion in social media, PVLDB, vol.6, issue.12, pp.1416-1421, 2013.

. Taxidou, I. Fischer-;-taxidou, and P. M. Fischer, Rapid : A system for real-time analysis of information diffusion in twitter, Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, CIKM, vol.18, pp.2060-2062, 2014.

C. Tekin and M. Liu, Online learning of rested and restless bandits, IEEE Trans. Information Theory, vol.58, issue.8, pp.5588-5611, 2012.

W. Thompson, On the likelihood that one unknown probability exceeds another in view of the evidence of two samples, Bulletin of the American Mathematics Society, vol.25, pp.285-294, 1933.

. Tsirakis, A platform for real-time opinion mining from social media and news streams, IEEE Trust-Com/BigDataSE/ISPA, vol.2, pp.223-228, 2015.

[. Valko, Spectral bandits for smooth graph functions, Proceedings of the 31th International Conference on Machine Learning, vol.47, pp.46-54, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00986818

L. Vaswani, S. Vaswani, and L. V. Lakshmanan, Influence maximization with bandits, 2015.

[. Wang, A system for real-time twitter sentiment analysis of 2012 U.S. presidential election cycle, The 50th Annual Meeting of the Association for Computational Linguistics, Proceedings of the System Demonstrations, vol.18, pp.115-120, 2012.

G. Wang, Y. Wang, and S. Gelly, Modifications of UCT and sequence-like simulations for monte-carlo go, Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Games, pp.175-182, 2007.

[. Weiss, Multidimensional spectral hashing, Proceedings of the 12th European Conference on Computer Vision -Volume Part V, ECCV'12, vol.15, pp.340-353, 2012.

P. Whittle, Restless bandits : Activity allocation in a changing world, Journal of Applied Probability, vol.25, pp.287-298, 1988.

. Winn, J. M. Bishop-;-winn, and C. M. Bishop, Variational message passing, Journal of Machine Learning Research, vol.6, pp.661-694, 2005.

[. Wu, Contextual bandits in a collaborative environment, Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, SIGIR 2016, vol.47, pp.529-538, 2016.

. Zaragoza, Microsoft cambridge at TREC 13 : Web and hard tracks, Proceedings of the Thirteenth Text REtrieval Conference, p.12, 2004.

[. Zhong, Classifying peer-to-peer applications using imbalanced concept-adapting very fast decision tree on IP data stream. Peer-to-Peer Networking and Applications, vol.6, pp.233-246, 2013.

Y. ;. Zhu, K. Zhu, and L. Ying, Information source detection in networks : Possibility and impossibility results, 35th Annual IEEE International Conference on Computer Communications, INFOCOM 2016, pp.1-9, 2016.