%0 Conference Paper %1 paper:weimer:2008 %A Weimer, Markus %A Karatzoglou, Alexandros %A Smola, Alex %B RecSys '08: Proceedings of the 2008 ACM Conference on Recommender Systems %C New York, NY, USA %D 2008 %I ACM %K RecSys RecSys08 collaborative-filtering to-read %P 275--282 %R http://doi.acm.org/10.1145/1454008.1454050 %T Adaptive collaborative filtering %U http://portal.acm.org/citation.cfm?id=1454050 %X We present a flexible approach to collaborative filtering which stems from basic research results. The approach is flexible in several dimensions: We introduce an algorithm where the loss can be tailored to a particular recommender problem. This allows us to optimize the prediction quality in a way that matters for the specific recommender system. The introduced algorithm can deal with structured estimation of the predictions for one user. The most prominent outcome of this is the ability of learning to rank items along user preferences. To this end, we also present a novel algorithm to compute the ordinal loss in O(n log(n)) as apposed to O(n2). We extend this basic model such that it can accommodate user and item offsets as well as user and item features if they are present. The latter unifies collaborative filtering with content based filtering. We present an analysis of the algorithm which shows desirable properties in terms of privacy needs of users, parallelization of the algorithm as well as collaborative filtering as a service. We evaluate the algorithm on data provided by WikiLens. This data is a cross-domain data set as it contains ratings on items from a vast array of categories. Evaluation shows that cross-domain prediction is possible. %@ 978-1-60558-093-7

@inproceedings{paper:weimer:2008, abstract = {We present a flexible approach to collaborative filtering which stems from basic research results. The approach is flexible in several dimensions: We introduce an algorithm where the loss can be tailored to a particular recommender problem. This allows us to optimize the prediction quality in a way that matters for the specific recommender system. The introduced algorithm can deal with structured estimation of the predictions for one user. The most prominent outcome of this is the ability of learning to rank items along user preferences. To this end, we also present a novel algorithm to compute the ordinal loss in O(n log(n)) as apposed to O(n2). We extend this basic model such that it can accommodate user and item offsets as well as user and item features if they are present. The latter unifies collaborative filtering with content based filtering. We present an analysis of the algorithm which shows desirable properties in terms of privacy needs of users, parallelization of the algorithm as well as collaborative filtering as a service. We evaluate the algorithm on data provided by WikiLens. This data is a cross-domain data set as it contains ratings on items from a vast array of categories. Evaluation shows that cross-domain prediction is possible.}, added-at = {2009-04-10T09:41:17.000+0200}, address = {New York, NY, USA}, author = {Weimer, Markus and Karatzoglou, Alexandros and Smola, Alex}, biburl = {https://www.bibsonomy.org/bibtex/272f7be883a8175500c78e1d2a4566bfa/mschuber}, booktitle = {RecSys '08: Proceedings of the 2008 ACM Conference on Recommender Systems}, description = {Adaptive collaborative filtering}, doi = {http://doi.acm.org/10.1145/1454008.1454050}, interhash = {17d80d5e78020c1d7befdba0a1ec781f}, intrahash = {72f7be883a8175500c78e1d2a4566bfa}, isbn = {978-1-60558-093-7}, keywords = {RecSys RecSys08 collaborative-filtering to-read}, location = {Lausanne, Switzerland}, pages = {275--282}, publisher = {ACM}, timestamp = {2009-05-08T14:07:15.000+0200}, title = {Adaptive collaborative filtering}, url = {http://portal.acm.org/citation.cfm?id=1454050}, year = 2008 }