Online Collaborative Filtering on Graphs

Operations Research

Volumn 64, Issue 3, 2016, Pages 756-769

  Banerjee, Siddhartha ^a   Sanghavi, Sujay ^b   Shakkottai, Sanjay ^b  

^a School of Operations Research and Industrial Engineering   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Competitive analysis; Online recommendation; Social networks

Indexed keywords

COLLABORATIVE FILTERING; ECONOMIC AND SOCIAL EFFECTS; RECOMMENDER SYSTEMS; SOCIAL NETWORKING (ONLINE);

COMPETITIVE ANALYSIS; COMPETITIVE RATIO; CONTENT CURATION; INFINITE HORIZONS; INFINITE NUMBERS; ONLINE RECOMMENDATION; RECOMMENDATION ALGORITHMS; SIMPLE ALGORITHM;

TOPOLOGY;

EID: 84975451982     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.2016.1508     Document Type: Article

References (20)

1. Audibert J-Y, Bubeck S, Lugosi G (2011) Minimax policies for combinatorial prediction games. Proc. 24th Ann. Conf. Learn. Theory, COLT'11, 107-132.
2. Auer P, Cesa-Bianchi N, Fischer N (2002) Finite-time analysis of the multiarmed bandit problem. Machine Learn. 47(2-3):235-256.
3. Babaioff M, Immorlica N, Kempe D, Kleinberg D (2008) Online auctions and generalized secretary problems. ACM SIGecom Exchanges 7(2): Article 7.
4. Bubeck S, Cesa-Bianchi N (2008) Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Foundations Trends Machine Learn. 5(1):1-122.
5. Dimitrov NB, Plaxton CG (2008). Competitive weighted matching in transversal matroids. Algorithmica 62(1-2):333-348.
6. Dudík M, Hsu D, Kale S, Karampatziakis N, Langford J, Reyzin L, Zhang T (2011) Efficient optimal learning for contextual bandits. Proc. 27th Conf. Uncertainty Artificial Intelligence, UAI'11 (AUAI Press, Corvallis, OR), 169-178.
7. Fakcharoenphol J, Laekhanukit B, Nanongkai B (2010) Faster algorithms for semi-matching problems. ACM Trans. Algorithms 10(3): Article 14.
8. Gittins JC (1979) Bandit processes and dynamic allocation indices. J. Roy. Statist. Soc. Ser. B (Methodological) 41(2):148-177.
9. Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell. System Tech. J. 45(9):1563-1581.
10. Harvey N, Ladner R, Lovász L, Tamir T (2003) Semi-matchings for bipartite graphs and load balancing. J. Algorithms 59(1):53-78.
11. Jagabathula S, Shah D (2011) Inferring rankings under constrained sensing. IEEE Trans. Inform. Theory 57(11):7288-7306.
12. Keshavan RH, Montanari A, Oh S (2010) Matrix completion from noisy entries. J. Machine Learn. Res. 11:2057-2078.
13. Kleinberg R, Niculescu-Mizil A, Sharma Y (2010) Regret bounds for sleeping experts and bandits. Machine Learn. 80(2-3):245-272.
14. Lai TL, Robbins H (1985) Asymptotically efficient adaptive allocation rules. Adv. Appl. Math. 6(1):4-22.
15. Mehta A, Saberi A, Vazirani U, Vazirani V (2005) Adwords and generalized on-line matching. 46th Ann. IEEE Sympos. Foundations Comput. Sci., FOCS '05 (IEEE Computer Society, Washington, DC), 264-273.
16. Motwani R, Raghavan P (1997) Randomized Algorithms (Cambridge University Press, Cambridge, UK).
17. Rosania P (2015) While you were away?[blog post]. Retrieved April 15, 2016, https://blog.twitter.com/2015/while-you-were-away-0.
18. Rusmevichientong P, Tsitsiklis JN (2010) Linearly parameterized bandits. Math. Oper. Res. 35(2):395-411.
19. Szabo G, Huberman BA (2010) Predicting the popularity of online content. Comm. ACM 53(8):80-88.
20. Yang J, Leskovec J (2011) Patterns of temporal variation in online media.4th ACM Internat. Conf. Web Search and Data Mining, WSDM '11 (ACM, New York), 177-186.