Abstract
We consider the interactive model of collaborative filtering, where each member of a given set of users has a grade for each object in a given set of objects. The users do not know the grades at start, but a user can probe any object, thereby learning her grade for that object directly. We describe reconstruction algorithms which generate good estimates of all user grades (“preference vectors”) using only few probes. To this end, the outcomes of probes are posted on some public “billboard”, allowing users to adopt results of probes executed by others. We give two new algorithms for this task under very general assumptions on user preferences: both improve the best known query complexity for reconstruction, and one improving resilience in the presence of many users with esoteric taste.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Awerbuch, B., Azar, Y., Patt-Shamir, B.: Tell me who I am: an interactive recommendation system. In: Proc. 18th Ann. ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp. 1–10 (2006)
Awerbuch, B., Azar, Y., Lotker, Z., Patt-Shamir, B., Tuttle, M.: Collaborate with strangers to find own preferences. In: Proc. 17th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp. 263–269 (2005)
Awerbuch, B., Nisgav, A., Patt-Shamir, B.: Asynchronous Active Recommendation Systems. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol. 4878, pp. 48–61. Springer, Heidelberg (2007)
Awerbuch, B., Patt-Shamir, B., Peleg, D., Tuttle, M.: Improved recommendation systems. In: Proc. 16th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 1174–1183 (2005)
Azar, Y., Fiat, A., Karlin, A., McSherry, F., Saia, J.: Spectral analysis of data. In: Proc. 33rd ACM Symp. on Theory of Computing (STOC), pp. 619–626 (2001)
Azar, Y., Nisgav, A., Patt-Shamir, B.: Recommender systems with non-binary grades. In: Proc. 23rd Ann. ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), San Jose, CA (June 2011)
Drineas, P., Kerenidis, I., Raghavan, P.: Competitive recommendation systems. In: Proc. 34th ACM Symp. on Theory of Computing (STOC), pp. 82–90 (2002)
Gilbert, S., Guerraoui, R., Rad, F.M., Zadimoghaddam, M.: Collaborative scoring with dishonest participants. In: Proc. 22nd Ann. ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp. 41–49 (2010)
Goel, S., Broder, A., Gabrilovich, E., Pang, B.: Anatomy of the long tail: ordinary people with extraordinary tastes. In: Proc. 3rd ACM Int. Conf. on Web Search and Data Mining (WSDM), pp. 201–210. ACM, New York (2010)
Goldberg, K., Roeder, T., Gupta, D., Perkins, C.: Eigentaste: A constant time collaborative filtering algorithm. Information Retrieval Journal 4(2), 133–151 (2001)
Kleinberg, J., Sandler, M.: Convergent algorithms for collaborative filtering. In: Proc. 4th ACM Conf. on Electronic Commerce (EC), pp. 1–10 (2003)
Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Recommendation systems: A probabilistic analysis. In: Proc. 39th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 664–673 (1998)
Nisgav, A., Patt-Shamir, B.: Finding similar users in social networks: extended abstract. In: Proc. 21st Ann. ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp. 169–177 (2009)
Papadimitriou, C.H., Raghavan, P., Tamaki, H., Vempala, S.: Latent semantic indexing: A probabilistic analysis. In: Proc. 17th ACM Symp. on Principles of Database Systems (PODS), pp. 159–168. ACM Press (1998)
Sarwar, B., Karypis, G., Konstan, J., Riedl, J.: Analysis of recommendation algorithms for e-commerce. In: Proc. 2nd ACM Conf. on Electronic Commerce (EC), pp. 158–167. ACM Press (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nisgav, A., Patt-Shamir, B. (2011). Improved Collaborative Filtering. In: Asano, T., Nakano, Si., Okamoto, Y., Watanabe, O. (eds) Algorithms and Computation. ISAAC 2011. Lecture Notes in Computer Science, vol 7074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25591-5_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-25591-5_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25590-8
Online ISBN: 978-3-642-25591-5
eBook Packages: Computer ScienceComputer Science (R0)