%0 Conference Paper %1 brusilovsky:Cremonesi2011CrossDomain %A Cremonesi, Paolo %A Tripodi, Antonio %A Turrin, Roberto %B 2011 IEEE 11th International Conference on Data Mining Workshops %D 2011 %I IEEE %K cross-domain recommender shpaws %P 496--503 %R 10.1109/icdmw.2011.57 %T Cross-Domain Recommender Systems %U http://dx.doi.org/10.1109/icdmw.2011.57 %X Most recommender systems work on single domains, i.e., they recommend items related to the same domain where users have expressed ratings. However, the integration of different domains into one recommender system could allow users to span over different types of items. For instance, users that have watched live TV programs could like to be recommended with on-demand movies, music, mobile applications, friends to connect to, etc. This paper focuses on cross-domain collaborative recommender systems, whose aim is to suggest items related to multiple domains. We first formalize the cross-domain problem in order to provide a common framework for the classification and the evaluation of state-of-the-art algorithms. We later define a new class of cross-domain algorithms based on neighborhood collaborative filtering, either item-based or user-based. The main idea is to first model the classical similarity relationships (e.g., Pearson, cosine) as a direct graph and to later explore all possible paths connecting users or items in order to find new, cross-domain, relationships. The algorithms have been tested on three cross-domain scenarios artificially reproduced by partitioning the Netflix dataset. %@ 978-1-4673-0005-6

@inproceedings{brusilovsky:Cremonesi2011CrossDomain, abstract = {{Most recommender systems work on single domains, i.e., they recommend items related to the same domain where users have expressed ratings. However, the integration of different domains into one recommender system could allow users to span over different types of items. For instance, users that have watched live TV programs could like to be recommended with on-demand movies, music, mobile applications, friends to connect to, etc. This paper focuses on cross-domain collaborative recommender systems, whose aim is to suggest items related to multiple domains. We first formalize the cross-domain problem in order to provide a common framework for the classification and the evaluation of state-of-the-art algorithms. We later define a new class of cross-domain algorithms based on neighborhood collaborative filtering, either item-based or user-based. The main idea is to first model the classical similarity relationships (e.g., Pearson, cosine) as a direct graph and to later explore all possible paths connecting users or items in order to find new, cross-domain, relationships. The algorithms have been tested on three cross-domain scenarios artificially reproduced by partitioning the Netflix dataset.}}, added-at = {2018-03-19T12:24:51.000+0100}, author = {Cremonesi, Paolo and Tripodi, Antonio and Turrin, Roberto}, biburl = {https://www.bibsonomy.org/bibtex/2601daf68ef60cea193b8066e164f0654/aho}, booktitle = {2011 IEEE 11th International Conference on Data Mining Workshops}, citeulike-article-id = {10545219}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/icdmw.2011.57}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6137420}, doi = {10.1109/icdmw.2011.57}, interhash = {535f4c2f8ec4d051442f2cc3c144f144}, intrahash = {601daf68ef60cea193b8066e164f0654}, isbn = {978-1-4673-0005-6}, keywords = {cross-domain recommender shpaws}, location = {Vancouver, BC, Canada}, month = dec, pages = {496--503}, posted-at = {2012-04-08 01:00:43}, priority = {2}, publisher = {IEEE}, timestamp = {2018-03-19T12:24:51.000+0100}, title = {{Cross-Domain Recommender Systems}}, url = {http://dx.doi.org/10.1109/icdmw.2011.57}, year = 2011 }