Interactive Social Recommendation
暂无分享,去创建一个
Xin Wang | Steven C. H. Hoi | Martin Ester | Chenghao Liu | S. Hoi | Chenghao Liu | M. Ester | Xin Wang
[1] Qing Wang,et al. Online Context-Aware Recommendation with Time Varying Multi-Armed Bandit , 2016, KDD.
[2] H. Robbins,et al. Asymptotically efficient adaptive allocation rules , 1985 .
[3] Jun Wang,et al. Interactive collaborative filtering , 2013, CIKM.
[4] Aleksandrs Slivkins,et al. Contextual Bandits with Similarity Information , 2009, COLT.
[5] Yehuda Koren,et al. Matrix Factorization Techniques for Recommender Systems , 2009, Computer.
[6] Umar Syed,et al. Graphical Models for Bandit Problems , 2011, UAI.
[7] Liang Tang,et al. Personalized Recommendation via Parameter-Free Contextual Bandits , 2015, SIGIR.
[8] John Langford,et al. The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information , 2007, NIPS.
[9] Shuai Li,et al. Online Clustering of Bandits , 2014, ICML.
[10] Michael R. Lyu,et al. Learning to recommend with social trust ensemble , 2009, SIGIR.
[11] Jiming Liu,et al. Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence Social Collaborative Filtering by Trust , 2022 .
[12] Lihong Li,et al. An Empirical Evaluation of Thompson Sampling , 2011, NIPS.
[13] Kewei Cheng,et al. Unsupervised Feature Selection in Signed Social Networks , 2017, KDD.
[14] Xin Wang,et al. Recommending Groups to Users Using User-Group Engagement and Time-Dependent Matrix Factorization , 2016, AAAI.
[15] Tong Zhao,et al. Leveraging Social Connections to Improve Personalized Ranking for Collaborative Filtering , 2014, CIKM.
[16] Richard S. Sutton,et al. Introduction to Reinforcement Learning , 1998 .
[17] Wei Chu,et al. A contextual-bandit approach to personalized news article recommendation , 2010, WWW '10.
[18] J. Gittins. Bandit processes and dynamic allocation indices , 1979 .
[19] Wei Chu,et al. Contextual Bandits with Linear Payoff Functions , 2011, AISTATS.
[20] Liang Tang,et al. Ensemble contextual bandits for personalized recommendation , 2014, RecSys '14.
[21] Wei Li,et al. Exploitation and exploration in a performance based contextual advertising system , 2010, KDD.
[22] R. Duncan Luce,et al. Individual Choice Behavior: A Theoretical Analysis , 1979 .
[23] Chao Liu,et al. Recommender systems with social regularization , 2011, WSDM '11.
[24] Martin Ester,et al. A matrix factorization technique with trust propagation for recommendation in social networks , 2010, RecSys '10.
[25] Claudio Gentile,et al. A Gang of Bandits , 2013, NIPS.
[26] Yisong Yue,et al. Hierarchical Exploration for Accelerating Contextual Bandits , 2012, ICML.
[27] R. Duncan Luce,et al. Individual Choice Behavior , 1959 .
[28] Richard S. Sutton,et al. Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.
[29] Andreas Krause,et al. Explore-exploit in top-N recommender systems via Gaussian processes , 2014, RecSys '14.
[30] Huazheng Wang,et al. Factorization Bandits for Interactive Recommendation , 2017, AAAI.
[31] Keith D. Kastella,et al. Foundations and Applications of Sensor Management , 2010 .
[32] Nicolò Cesa-Bianchi,et al. Gambling in a rigged casino: The adversarial multi-armed bandit problem , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[33] Xin Wang,et al. Social Recommendation with Strong and Weak Ties , 2016, CIKM.
[34] Peter Auer,et al. Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.
[35] Peter Auer,et al. Using upper confidence bounds for online learning , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[36] Long Tran-Thanh,et al. Efficient Thompson Sampling for Online Matrix-Factorization Recommendation , 2015, NIPS.
[37] Xiaoyan Zhu,et al. Contextual Combinatorial Bandit and its Application on Diversified Online Recommendation , 2014, SDM.
[38] John Langford,et al. Exploration scavenging , 2008, ICML '08.
[39] Huan Liu,et al. Radar: Residual Analysis for Anomaly Detection in Attributed Networks , 2017, IJCAI.
[40] Mao Ye,et al. Exploring social influence for recommendation: a generative model approach , 2012, SIGIR '12.
[41] Aurélien Garivier,et al. Parametric Bandits: The Generalized Linear Case , 2010, NIPS.
[42] Quanquan Gu,et al. Contextual Bandits in a Collaborative Environment , 2016, SIGIR.
[43] Michael R. Lyu,et al. Learning to recommend with explicit and implicit social relations , 2011, TIST.
[44] Li Zhou,et al. Latent Contextual Bandits and their Application to Personalized Recommendations for New Users , 2016, IJCAI.
[45] Wei Chu,et al. Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms , 2010, WSDM '11.
[46] Peter Auer,et al. Using Confidence Bounds for Exploitation-Exploration Trade-offs , 2003, J. Mach. Learn. Res..
[47] Alda Lopes Gançarski,et al. A Contextual-Bandit Algorithm for Mobile Context-Aware Recommender System , 2012, ICONIP.
[48] Zheng Wen,et al. Cascading Bandits for Large-Scale Recommendation Problems , 2016, UAI.
[49] Martin Ester,et al. TrustWalker: a random walk model for combining trust-based and item-based recommendation , 2009, KDD.
[50] Shuai Li,et al. Collaborative Filtering Bandits , 2015, SIGIR.
[51] Bee-Chung Chen,et al. Explore/Exploit Schemes for Web Content Optimization , 2009, 2009 Ninth IEEE International Conference on Data Mining.
[52] Kenneth O. May,et al. Review: R. Duncan Luce, Individual choice behavior, a theoretical analysis , 1960 .
[53] Demosthenis Teneketzis,et al. Multi-Armed Bandit Problems , 2008 .
[54] Michael R. Lyu,et al. SoRec: social recommendation using probabilistic matrix factorization , 2008, CIKM '08.
[55] Doina Precup,et al. Algorithms for multi-armed bandit problems , 2014, ArXiv.
[56] Alexander J. Smola,et al. Like like alike: joint friendship and interest propagation in social networks , 2011, WWW.
[57] Yan Liu,et al. Collaborative Topic Regression with Social Matrix Factorization for Recommendation Systems , 2012, ICML.
[58] Donald A. Berry,et al. Bandit Problems: Sequential Allocation of Experiments. , 1986 .
[59] J. Langford,et al. The Epoch-Greedy algorithm for contextual multi-armed bandits , 2007, NIPS 2007.
[60] T. L. Lai Andherbertrobbins. Asymptotically Efficient Adaptive Allocation Rules , 1985 .
[61] Ruslan Salakhutdinov,et al. Probabilistic Matrix Factorization , 2007, NIPS.
[62] Xin Wang,et al. Learning Personalized Preference of Strong and Weak Ties for Social Recommendation , 2017, WWW.
[63] Csaba Szepesvári,et al. Improved Algorithms for Linear Stochastic Bandits , 2011, NIPS.
[64] H. Robbins. Some aspects of the sequential design of experiments , 1952 .