@inproceedings{ls_leimeister, author = {Blohm, I. and Ott, F. and Bretschneider, U. and Huber, M. and Rieger, M. and Glatz, F. and Koch, M. and Leimeister, J. M. and Krcmar, H.}, title = {Extending Open Innovation Platforms into the real world -
ing Large Displays in Public Spaces}, booktitle = {10. European Academy of Management Conference (EURAM) 2010}, address = {Rome, Italy}, year = {2010}, number = {10}, note = {197 (45-10) }, url = {http://www.uni-kassel.de/fb7/ibwl/leimeister/pub/JML_197.pdf}, keywords = {IdeaMirror, collaborative, community, computing, evaluation, filtering, idea, innovation, itegpub, myown, open, pub_jml, pub_ubr, support, ubiquitous} }

%0 = inproceedings %A = Blohm, I. and Ott, F. and Bretschneider, U. and Huber, M. and Rieger, M. and Glatz, F. and Koch, M. and Leimeister, J. M. and Krcmar, H. %B = 10. European Academy of Management Conference (EURAM) 2010 %C = Rome, Italy %D = 2010 %T = Extending Open Innovation Platforms into the real world -
ing Large Displays in Public Spaces %U = http://www.uni-kassel.de/fb7/ibwl/leimeister/pub/JML_197.pdf

@inproceedings{ls_leimeister, author = {Blohm, I. and Ott, F. and Bretschneider, U. and Huber, M. and Rieger, M. and Glatz, F. and Koch, M. and Leimeister, J. M. and Krcmar, H.}, title = {Extending Open Innovation Platforms into the real world - Using Large Displays in Public Spaces}, booktitle = {10. European Academy of Management Conference (EURAM) 2010}, address = {Rome, Italy}, year = {2010}, number = {10}, note = {197 (45-10) }, url = {http://pubs.wi-kassel.de/wp-content/uploads/2013/03/JML_248.pdf}, keywords = {IdeaMirror, collaborative, community, computing, dempub, evaluation, filtering, idea, innovation, itegpub, open, pub_jml, pub_ubr, support, ubiquitous} }

%0 = inproceedings %A = Blohm, I. and Ott, F. and Bretschneider, U. and Huber, M. and Rieger, M. and Glatz, F. and Koch, M. and Leimeister, J. M. and Krcmar, H. %B = 10. European Academy of Management Conference (EURAM) 2010 %C = Rome, Italy %D = 2010 %T = Extending Open Innovation Platforms into the real world - Using Large Displays in Public Spaces %U = http://pubs.wi-kassel.de/wp-content/uploads/2013/03/JML_248.pdf

Collaborative tagging applications allow users to annotate online resources. The result is a complex tapestry of interrelated users, resources and tags often called a folksonomy. Folksonomies present an attractive target for data mining applications such as tag recommenders. A challenge of tag recommendation remains the adaptation of traditional recommendation techniques originally designed to work with two dimensional data. To date the most successful recommenders have been graph based approaches which explicitly connects all three components of the folksonomy. In this paper we speculate that graph based tag recommendation can be improved by coupling it with item-based collaborative filtering. We motive this hypothesis with a discussion of informational channels in folksonomies and provide a theoretical explanation of the additive potential for item-based collaborative filtering. We then provided experimental results on hybrid tag recommenders built from graph models and other techniques based on popularity, user-based collaborative filtering and item-based collaborative filtering. We demonstrate that a hybrid recommender built from a graph based model and item-based collaborative filtering outperforms its constituent recommenders. furthermore the inability of the other recommenders to improve upon the graph-based approach suggests that they offer information already included in the graph based model. These results confirm our conjecture. We provide extensive evaluation of the hybrids using data collected from three real world collaborative tagging applications.

@inproceedings{gemmell2009improving, author = {Gemmell, Jonathan and Schimoler, Thomas R. and Christiansen, Laura and Mobasher, Bamshad}, title = {Improving Folkrank With Item-Based Collaborative Filtering}, editor = {Jannach, Dietmar and Geyer, Werner and Freyne, Jill and Anand, Sarabjot Singh and Dugan, Casey and Mobasher, Bamshad and Kobsa, Alfred}, booktitle = {ACM RecSys'09 Workshop on Recommender Systems and the Social Web}, series = {CEUR-WS.org}, year = {2009}, volume = {532}, pages = {17--24}, url = {http://ceur-ws.org/Vol-532/paper3.pdf}, keywords = {bookmarking, collaborative, filtering, folkrank, recommender, social, tagging}, abstract = {Collaborative tagging applications allow users to annotate online resources. The result is a complex tapestry of interrelated users, resources and tags often called a folksonomy. Folksonomies present an attractive target for data mining applications such as tag recommenders. A challenge of tag recommendation remains the adaptation of traditional recommendation techniques originally designed to work with two dimensional data. To date the most successful recommenders have been graph based approaches which explicitly connects all three components of the folksonomy. In this paper we speculate that graph based tag recommendation can be improved by coupling it with item-based collaborative filtering. We motive this hypothesis with a discussion of informational channels in folksonomies and provide a theoretical explanation of the additive potential for item-based collaborative filtering. We then provided experimental results on hybrid tag recommenders built from graph models and other techniques based on popularity, user-based collaborative filtering and item-based collaborative filtering. We demonstrate that a hybrid recommender built from a graph based model and item-based collaborative filtering outperforms its constituent recommenders. furthermore the inability of the other recommenders to improve upon the graph-based approach suggests that they offer information already included in the graph based model. These results confirm our conjecture. We provide extensive evaluation of the hybrids using data collected from three real world collaborative tagging applications.} }

%0 = inproceedings %A = Gemmell, Jonathan and Schimoler, Thomas R. and Christiansen, Laura and Mobasher, Bamshad %B = ACM RecSys'09 Workshop on Recommender Systems and the Social Web %D = 2009 %T = Improving Folkrank With Item-Based Collaborative Filtering %U = http://ceur-ws.org/Vol-532/paper3.pdf

Customer preferences for products are drifting over time. Product perception and popularity are constantly changing as new selection emerges. Similarly, customer inclinations are evolving, leading them to ever redefine their taste. Thus, modeling temporal dynamics should be a key when designing recommender systems or general customer preference models. However, this raises unique challenges. Within the eco-system intersecting multiple products and customers, many different characteristics are shifting simultaneously, while many of them influence each other and often those shifts are delicate and associated with a few data instances. This distinguishes the problem from concept drift explorations, where mostly a single concept is tracked. Classical time-window or instance-decay approaches cannot work, as they lose too much signal when discarding data instances. A more sensitive approach is required, which can make better distinctions between transient effects and long term patterns. The paradigm we offer is creating a model tracking the time changing behavior throughout the life span of the data. This allows us to exploit the relevant components of all data instances, while discarding only what is modeled as being irrelevant. Accordingly, we revamp two leading collaborative filtering recommendation approaches. Evaluation is made on a large movie rating dataset by Netflix. Results are encouraging and better than those previously reported on this dataset.

@inproceedings{koren2009collaborative, author = {Koren, Yehuda}, title = {Collaborative filtering with temporal dynamics}, booktitle = {Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining}, publisher = {ACM}, address = {New York, NY, USA}, year = {2009}, pages = {447--456}, url = {http://doi.acm.org/10.1145/1557019.1557072}, doi = {10.1145/1557019.1557072}, isbn = {978-1-60558-495-9}, keywords = {cf, collaborative, dynamics, filtering, netflix, stair, temporal}, abstract = {Customer preferences for products are drifting over time. Product perception and popularity are constantly changing as new selection emerges. Similarly, customer inclinations are evolving, leading them to ever redefine their taste. Thus, modeling temporal dynamics should be a key when designing recommender systems or general customer preference models. However, this raises unique challenges. Within the eco-system intersecting multiple products and customers, many different characteristics are shifting simultaneously, while many of them influence each other and often those shifts are delicate and associated with a few data instances. This distinguishes the problem from concept drift explorations, where mostly a single concept is tracked. Classical time-window or instance-decay approaches cannot work, as they lose too much signal when discarding data instances. A more sensitive approach is required, which can make better distinctions between transient effects and long term patterns. The paradigm we offer is creating a model tracking the time changing behavior throughout the life span of the data. This allows us to exploit the relevant components of all data instances, while discarding only what is modeled as being irrelevant. Accordingly, we revamp two leading collaborative filtering recommendation approaches. Evaluation is made on a large movie rating dataset by Netflix. Results are encouraging and better than those previously reported on this dataset.} }

%0 = inproceedings %A = Koren, Yehuda %B = Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining %C = New York, NY, USA %D = 2009 %I = ACM %T = Collaborative filtering with temporal dynamics %U = http://doi.acm.org/10.1145/1557019.1557072

Collaborative tagging can help users organize, share and retrieve information in an easy and quick way. For the collaborative tagging information implies user's important personal preference information, it can be used to recommend personalized items to users. This paper proposes a novel tag-based collaborative filtering approach for recommending personalized items to users of online communities that are equipped with tagging facilities. Based on the distinctive three dimensional relationships among users, tags and items, a new similarity measure method is proposed to generate the neighborhood of users with similar tagging behavior instead of similar implicit ratings. The promising experiment result shows that by using the tagging information the proposed approach outperforms the standard user and item based collaborative filtering approaches.

@incollection{citeulike:6386729, author = {Liang, Huizhi and Xu, Yue and Li, Yuefeng and Nayak, Richi}, title = {Tag Based Collaborative Filtering for Recommender Systems}, editor = {Wen, Peng and Li, Yuefeng and Polkowski, Lech and Yao, Yiyu and Tsumoto, Shusaku and Wang, Guoyin}, booktitle = {Rough Sets and Knowledge Technology }, publisher = {Springer Berlin Heidelberg}, address = {Berlin, Heidelberg}, year = {2009}, volume = {5589}, pages = {666--673}, url = {http://dx.doi.org/10.1007/978-3-642-02962-284}, doi = {10.1007/978-3-642-02962-284}, isbn = {978-3-642-02961-5}, keywords = {collaborative, filtering, recommender, tagging, taggingsurvey, toread}, abstract = {Collaborative tagging can help users organize, share and retrieve information in an easy and quick way. For the collaborative tagging information implies user's important personal preference information, it can be used to recommend personalized items to users. This paper proposes a novel tag-based collaborative filtering approach for recommending personalized items to users of online communities that are equipped with tagging facilities. Based on the distinctive three dimensional relationships among users, tags and items, a new similarity measure method is proposed to generate the neighborhood of users with similar tagging behavior instead of similar implicit ratings. The promising experiment result shows that by using the tagging information the proposed approach outperforms the standard user and item based collaborative filtering approaches.} }

%0 = incollection %A = Liang, Huizhi and Xu, Yue and Li, Yuefeng and Nayak, Richi %B = Rough Sets and Knowledge Technology %C = Berlin, Heidelberg %D = 2009 %I = Springer Berlin Heidelberg %T = Tag Based Collaborative Filtering for Recommender Systems %U = http://dx.doi.org/10.1007/978-3-642-02962-284

Motivated by the potential use of collaborative tagging systems to develop new recommender systems, we have implemented and compared three variants of user-based collaborative filtering algorithms to provide recommendations of articles on CiteULike. On our first approach, Classic Collaborative filtering (CCF), we use Pearson correlation to calculate similarity between users and a classic adjusted ratings formula to rank the recommendations. Our second approach, Neighbor-weighted Collaborative Filtering (NwCF), incorporates the amount of raters in the ranking formula of the recommendations. A modified version of the Okapi BM25 IR model over users ’ tags is implemented on our third approach to form the user neighborhood. Our results suggest that incorporating the number of raters into the algorithms leads to an improvement of precision, and they also support that tags can be considered as an alternative to Pearson correlation to calculate the similarity between users and their neighbors in a collaborative tagging system.

@inproceedings{parra2009evaluation, author = {Parra, Denis and Brusilovsky, Peter}, title = {Evaluation of Collaborative Filtering Algorithms for Recommending Articles on CiteULike}, booktitle = {Proceedings of the Workshop on Web 3.0: Merging Semantic Web and Social Web}, series = {CEUR Workshop Proceedings}, year = {2009}, volume = {467}, url = {http://ceur-ws.org/Vol-467/paper5.pdf}, keywords = {algorithms, citedBy:doerfel2012leveraging, collaborative, evaluation, filtering}, abstract = {Motivated by the potential use of collaborative tagging systems to develop new recommender systems, we have implemented and compared three variants of user-based collaborative filtering algorithms to provide recommendations of articles on CiteULike. On our first approach, Classic Collaborative filtering (CCF), we use Pearson correlation to calculate similarity between users and a classic adjusted ratings formula to rank the recommendations. Our second approach, Neighbor-weighted Collaborative Filtering (NwCF), incorporates the amount of raters in the ranking formula of the recommendations. A modified version of the Okapi BM25 IR model over users ’ tags is implemented on our third approach to form the user neighborhood. Our results suggest that incorporating the number of raters into the algorithms leads to an improvement of precision, and they also support that tags can be considered as an alternative to Pearson correlation to calculate the similarity between users and their neighbors in a collaborative tagging system. } }

%0 = inproceedings %A = Parra, Denis and Brusilovsky, Peter %B = Proceedings of the Workshop on Web 3.0: Merging Semantic Web and Social Web %D = 2009 %T = Evaluation of Collaborative Filtering Algorithms for Recommending Articles on CiteULike %U = http://ceur-ws.org/Vol-467/paper5.pdf

Motivated by the potential use of collaborative tagging systems to develop new recommender systems, we have implemented and compared three variants of user-based collaborative filtering algorithms to provide recommendations of articles on CiteULike. On our first approach, Classic Collaborative filtering (CCF), we use Pearson correlation to calculate similarity between users and a classic adjusted ratings formula to rank the recommendations. Our second approach, Neighbor-weighted Collaborative Filtering (NwCF), incorporates the amount of raters in the ranking formula of the recommendations. A modified version of the Okapi BM25 IR model over users ’ tags is implemented on our third approach to form the user neighborhood. Our results suggest that incorporating the number of raters into the algorithms leads to an improvement of precision, and they also support that tags can be considered as an alternative to Pearson correlation to calculate the similarity between users and their neighbors in a collaborative tagging system.

@inproceedings{parra2009evaluation, author = {Parra, Denis and Brusilovsky, Peter}, title = {Evaluation of Collaborative Filtering Algorithms for Recommending Articles on CiteULike}, booktitle = {Proceedings of the Workshop on Web 3.0: Merging Semantic Web and Social Web}, series = {CEUR Workshop Proceedings}, year = {2009}, volume = {467}, url = {http://ceur-ws.org/Vol-467/paper5.pdf}, keywords = {collaborative, filtering, folksonomy, item, recommender, social, tagging}, abstract = {Motivated by the potential use of collaborative tagging systems to develop new recommender systems, we have implemented and compared three variants of user-based collaborative filtering algorithms to provide recommendations of articles on CiteULike. On our first approach, Classic Collaborative filtering (CCF), we use Pearson correlation to calculate similarity between users and a classic adjusted ratings formula to rank the recommendations. Our second approach, Neighbor-weighted Collaborative Filtering (NwCF), incorporates the amount of raters in the ranking formula of the recommendations. A modified version of the Okapi BM25 IR model over users ’ tags is implemented on our third approach to form the user neighborhood. Our results suggest that incorporating the number of raters into the algorithms leads to an improvement of precision, and they also support that tags can be considered as an alternative to Pearson correlation to calculate the similarity between users and their neighbors in a collaborative tagging system. } }

%0 = inproceedings %A = Parra, Denis and Brusilovsky, Peter %B = Proceedings of the Workshop on Web 3.0: Merging Semantic Web and Social Web %D = 2009 %T = Evaluation of Collaborative Filtering Algorithms for Recommending Articles on CiteULike %U = http://ceur-ws.org/Vol-467/paper5.pdf

The collaborative filtering (CF) using known user ratings of items has proved to be effective for predicting user preferences in item selection. This thriving subfield of machine learning became popular in the late 1990s with the spread of online services that use recommender systems, such as Amazon, Yahoo! Music, and Netflix. CF approaches are usually designed to work on very large data sets. Therefore the scalability of the methods is crucial. In this work, we propose various scalable solutions that are validated against the Netflix Prize data set, currently the largest publicly available collection. First, we propose various matrix factorization (MF) based techniques. Second, a neighbor correction method for MF is outlined, which alloys the global perspective of MF and the localized property of neighbor based approaches efficiently. In the experimentation section, we first report on some implementation issues, and we suggest on how parameter optimization can be performed efficiently for MFs. We then show that the proposed scalable approaches compare favorably with existing ones in terms of prediction accuracy and/or required training time. Finally, we report on some experiments performed on MovieLens and Jester data sets.

@article{takacs2009scalable, author = {Takács, Gábor and Pilászy, István and Németh, Bottyán and Tikk, Domonkos}, title = {Scalable Collaborative Filtering Approaches for Large Recommender Systems}, journal = {Journal of Machine Learning Research}, publisher = {JMLR.org}, year = {2009}, volume = {10}, pages = {623--656}, url = {http://dl.acm.org/citation.cfm?id=1577069.1577091}, issn = {1532-4435}, keywords = {collaborative, filtering, recommender}, abstract = {The collaborative filtering (CF) using known user ratings of items has proved to be effective for predicting user preferences in item selection. This thriving subfield of machine learning became popular in the late 1990s with the spread of online services that use recommender systems, such as Amazon, Yahoo! Music, and Netflix. CF approaches are usually designed to work on very large data sets. Therefore the scalability of the methods is crucial. In this work, we propose various scalable solutions that are validated against the Netflix Prize data set, currently the largest publicly available collection. First, we propose various matrix factorization (MF) based techniques. Second, a neighbor correction method for MF is outlined, which alloys the global perspective of MF and the localized property of neighbor based approaches efficiently. In the experimentation section, we first report on some implementation issues, and we suggest on how parameter optimization can be performed efficiently for MFs. We then show that the proposed scalable approaches compare favorably with existing ones in terms of prediction accuracy and/or required training time. Finally, we report on some experiments performed on MovieLens and Jester data sets.} }

%0 = article %A = Takács, Gábor and Pilászy, István and Németh, Bottyán and Tikk, Domonkos %D = 2009 %I = JMLR.org %T = Scalable Collaborative Filtering Approaches for Large Recommender Systems %U = http://dl.acm.org/citation.cfm?id=1577069.1577091

@inproceedings{jaeschke07tagKdml, author = {Jaeschke, Robert and Marinho, Leandro and Hotho, Andreas and Schmidt-Thieme, Lars and Stumme, Gerd}, title = {Tag Recommendations in Folksonomies}, editor = {Hinneburg, Alexander}, booktitle = {Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivität (LWA 2007)}, publisher = {Martin-Luther-Universität Halle-Wittenberg}, year = {2007}, pages = {13-20}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2007/jaeschke07tagrecommendationsKDML.pdf}, isbn = {978-3-86010-907-6}, keywords = {2007, bookmarking, collaborative, filtering, folksonomy, itegpub, l3s, myown, recommender, social} }

%0 = inproceedings %A = Jaeschke, Robert and Marinho, Leandro and Hotho, Andreas and Schmidt-Thieme, Lars and Stumme, Gerd %B = Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivität (LWA 2007) %D = 2007 %I = Martin-Luther-Universität Halle-Wittenberg %T = Tag Recommendations in Folksonomies %U = http://www.kde.cs.uni-kassel.de/stumme/papers/2007/jaeschke07tagrecommendationsKDML.pdf

@inproceedings{jaeschke07tagKdml, author = {Jaeschke, Robert and Marinho, Leandro and Hotho, Andreas and Schmidt-Thieme, Lars and Stumme, Gerd}, title = {Tag Recommendations in Folksonomies}, editor = {Hinneburg, Alexander}, booktitle = {Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivität (LWA 2007)}, publisher = {Martin-Luther-Universität Halle-Wittenberg}, year = {2007}, pages = {13-20}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2007/jaeschke07tagrecommendationsKDML.pdf}, isbn = {978-3-86010-907-6}, keywords = {2007, bookmarking, collaborative, filtering, folksonomy, itegpub, l3s, myown, recommender, social} }

%0 = inproceedings %A = Jaeschke, Robert and Marinho, Leandro and Hotho, Andreas and Schmidt-Thieme, Lars and Stumme, Gerd %B = Workshop Proceedings of Lernen - Wissensentdeckung - Adaptivität (LWA 2007) %D = 2007 %I = Martin-Luther-Universität Halle-Wittenberg %T = Tag Recommendations in Folksonomies %U = http://www.kde.cs.uni-kassel.de/stumme/papers/2007/jaeschke07tagrecommendationsKDML.pdf

One of the potent personalization technologies powering the adaptive web is collaborative filtering. Collaborative filtering (CF) is the process of filtering or evaluating items through the opinions of other people. CF technology brings together the opinions of large interconnected communities on the web, supporting filtering of substantial quantities of data. In this chapter we introduce the core concepts of collaborative filtering, its primary uses for users of the adaptive web, the theory and practice of CF algorithms, and design decisions regarding rating systems and acquisition of ratings. We also discuss how to evaluate CF systems, and the evolution of rich interaction interfaces. We close the chapter with discussions of the challenges of privacy particular to a CF recommendation service and important open research questions in the field.

@incollection{schafer07, author = {Schafer, J. Ben and Frankowski, Dan and Herlocker, Jon and Sen, Shilad}, title = {Collaborative Filtering Recommender Systems}, editor = {Brusilovsky, Peter and Kobsa, Alfred and Nejdl, Wolfgang}, booktitle = {The Adaptive Web: Methods and Strategies of Web Personalization}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, address = {Berlin, Heidelberg}, year = {2007}, volume = {4321}, pages = {291-324}, url = {http://dx.doi.org/10.1007/978-3-540-72079-9_9}, isbn = {978-3-540-72078-2}, keywords = {cf, collaborative, filtering, recommender, webzu}, abstract = {One of the potent personalization technologies powering the adaptive web is collaborative filtering. Collaborative filtering (CF) is the process of filtering or evaluating items through the opinions of other people. CF technology brings together the opinions of large interconnected communities on the web, supporting filtering of substantial quantities of data. In this chapter we introduce the core concepts of collaborative filtering, its primary uses for users of the adaptive web, the theory and practice of CF algorithms, and design decisions regarding rating systems and acquisition of ratings. We also discuss how to evaluate CF systems, and the evolution of rich interaction interfaces. We close the chapter with discussions of the challenges of privacy particular to a CF recommendation service and important open research questions in the field.} }

%0 = incollection %A = Schafer, J. Ben and Frankowski, Dan and Herlocker, Jon and Sen, Shilad %B = The Adaptive Web: Methods and Strategies of Web Personalization %C = Berlin, Heidelberg %D = 2007 %I = Springer %T = Collaborative Filtering Recommender Systems %U = http://dx.doi.org/10.1007/978-3-540-72079-9_9

This paper presents an overview of the field of recommender systems and describes the current generation of recommendation methods that are usually classified into the following three main categories: content-based, collaborative, and hybrid recommendation approaches. This paper also describes various limitations of current recommendation methods and discusses possible extensions that can improve recommendation capabilities and make recommender systems applicable to an even broader range of applications. These extensions include, among others, an improvement of understanding of users and items, incorporation of the contextual information into the recommendation process, support for multicriteria ratings, and a provision of more flexible and less intrusive types of recommendations.

@article{1423975, author = {Adomavicius, G. and Tuzhilin, A.}, title = {Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions}, journal = {Knowledge and Data Engineering, IEEE Transactions on}, year = {2005}, volume = {17}, number = {6}, pages = { 734-749}, doi = {10.1109/TKDE.2005.99}, issn = {1041-4347}, keywords = {collaborative, content-based, contextual, filtering, information, survey}, abstract = { This paper presents an overview of the field of recommender systems and describes the current generation of recommendation methods that are usually classified into the following three main categories: content-based, collaborative, and hybrid recommendation approaches. This paper also describes various limitations of current recommendation methods and discusses possible extensions that can improve recommendation capabilities and make recommender systems applicable to an even broader range of applications. These extensions include, among others, an improvement of understanding of users and items, incorporation of the contextual information into the recommendation process, support for multicriteria ratings, and a provision of more flexible and less intrusive types of recommendations.} }

%0 = article %A = Adomavicius, G. and Tuzhilin, A. %D = 2005 %T = Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions

@article{herlocker2004ecf, author = {Herlocker, J.L. and Konstan, J.A. and Terveen, L.G. and Riedl, J.T.}, title = {Evaluating collaborative filtering recommender systems}, journal = {ACM Transactions on Information Systems}, year = {2004}, volume = {22}, number = {1}, pages = {5--53}, keywords = {collaborative, evaluation, filtering, recommender} }

%0 = article %A = Herlocker, J.L. and Konstan, J.A. and Terveen, L.G. and Riedl, J.T. %D = 2004 %T = Evaluating collaborative filtering recommender systems

Recommender systems have been evaluated in many, often incomparable, ways. In this article, we review the key decisions in evaluating collaborative filtering recommender systems: the user tasks being evaluated, the types of analysis and datasets being used, the ways in which prediction quality is measured, the evaluation of prediction attributes other than quality, and the user-based evaluation of the system as a whole. In addition to reviewing the evaluation strategies used by prior researchers, we present empirical results from the analysis of various accuracy metrics on one content domain where all the tested metrics collapsed roughly into three equivalence classes. Metrics within each equivalency class were strongly correlated, while metrics from different equivalency classes were uncorrelated.

@article{Herlocker:2004:ECF:963770.963772, author = {Herlocker, Jonathan L. and Konstan, Joseph A. and Terveen, Loren G. and Riedl, John T.}, title = {Evaluating collaborative filtering recommender systems}, journal = {ACM Trans. Inf. Syst.}, publisher = {ACM}, address = {New York, NY, USA}, year = {2004}, volume = {22}, pages = {5--53}, url = {http://doi.acm.org/10.1145/963770.963772}, doi = {10.1145/963770.963772}, issn = {1046-8188}, keywords = {collaEvaluating, collaborative, eval, evaluation, filtering, recommend, recommendation, recommender, systems}, abstract = {Recommender systems have been evaluated in many, often incomparable, ways. In this article, we review the key decisions in evaluating collaborative filtering recommender systems: the user tasks being evaluated, the types of analysis and datasets being used, the ways in which prediction quality is measured, the evaluation of prediction attributes other than quality, and the user-based evaluation of the system as a whole. In addition to reviewing the evaluation strategies used by prior researchers, we present empirical results from the analysis of various accuracy metrics on one content domain where all the tested metrics collapsed roughly into three equivalence classes. Metrics within each equivalency class were strongly correlated, while metrics from different equivalency classes were uncorrelated.} }

%0 = article %A = Herlocker, Jonathan L. and Konstan, Joseph A. and Terveen, Loren G. and Riedl, John T. %C = New York, NY, USA %D = 2004 %I = ACM %T = Evaluating collaborative filtering recommender systems %U = http://doi.acm.org/10.1145/963770.963772

@inproceedings{Whitby04filteringout, author = {Whitby, Andrew and Jøsang, Audun and Indulska, Jadwiga}, title = {Filtering Out Unfair Ratings in Bayesian Reputation Systems}, year = {2004}, keywords = {Filtering, bayes, info20, rating, reputation, review, unfair} }

%0 = inproceedings %A = Whitby, Andrew and Jøsang, Audun and Indulska, Jadwiga %D = 2004 %T = Filtering Out Unfair Ratings in Bayesian Reputation Systems

Most recommender systems use Collaborative Filtering or Content-based methods to predict new items of interest for a user. While both methods have their own advantages, individually they fail to provide good recommendations in many situations. Incorporating components from both methods, a hybrid recommender system can overcome these shortcomings. In this paper, we present an elegant and effective framework for combining content and collaboration. Our approach uses a content-based predictor tc enhance existing user data, and then provides personalized suggestions through collaborative filtering. We present experimental results that show how this approach, <i>Content-Boosted Collaborative Filtering</i>, performs better than a pure content-based predictor, pure collaborative filter, and a naive hybrid approach.

@inproceedings{melville2002contentboosted, author = {Melville, Prem and Mooney, Raymod J. and Nagarajan, Ramadass}, title = {Content-boosted Collaborative Filtering for Improved Recommendations}, booktitle = {Eighteenth National Conference on Artificial Intelligence}, publisher = {American Association for Artificial Intelligence}, address = {Menlo Park, CA, USA}, year = {2002}, pages = {187--192}, url = {http://dl.acm.org/citation.cfm?id=777092.777124}, isbn = {0-262-51129-0}, keywords = {collaborative, content, filtering, hybrid, recommender}, abstract = {Most recommender systems use Collaborative Filtering or Content-based methods to predict new items of interest for a user. While both methods have their own advantages, individually they fail to provide good recommendations in many situations. Incorporating components from both methods, a hybrid recommender system can overcome these shortcomings. In this paper, we present an elegant and effective framework for combining content and collaboration. Our approach uses a content-based predictor tc enhance existing user data, and then provides personalized suggestions through collaborative filtering. We present experimental results that show how this approach, <i>Content-Boosted Collaborative Filtering</i>, performs better than a pure content-based predictor, pure collaborative filter, and a naive hybrid approach.} }

%0 = inproceedings %A = Melville, Prem and Mooney, Raymod J. and Nagarajan, Ramadass %B = Eighteenth National Conference on Artificial Intelligence %C = Menlo Park, CA, USA %D = 2002 %I = American Association for Artificial Intelligence %T = Content-boosted Collaborative Filtering for Improved Recommendations %U = http://dl.acm.org/citation.cfm?id=777092.777124

@inproceedings{sarwar2001itembased, author = {Sarwar, Badrul and Karypis, George and Konstan, Joseph and Riedl, John}, title = {Item-based collaborative filtering recommendation algorithms}, booktitle = {Proceedings of the 10th international conference on World Wide Web}, publisher = {ACM}, address = {New York, NY, USA}, year = {2001}, pages = {285--295}, url = {http://doi.acm.org/10.1145/371920.372071}, doi = {10.1145/371920.372071}, isbn = {1-58113-348-0}, keywords = {cf, collaborative, filtering, item, recommender} }

%0 = inproceedings %A = Sarwar, Badrul and Karypis, George and Konstan, Joseph and Riedl, John %B = Proceedings of the 10th international conference on World Wide Web %C = New York, NY, USA %D = 2001 %I = ACM %T = Item-based collaborative filtering recommendation algorithms %U = http://doi.acm.org/10.1145/371920.372071

Recommender systems apply knowledge discovery techniques to the problem of making personalized recommendations for information, products or services during a live interaction. These systems, especially the k-nearest neighbor collaborative filtering based ones, are achieving widespread success on the Web. The tremendous growth in the amount of available information and the number of visitors to Web sites in recent years poses some key challenges for recommender systems. These are: producing high quality recommendations, performing many recommendations per second for millions of users and items and achieving high coverage in the face of data sparsity. In traditional collaborative filtering systems the amount of work increases with the number of participants in the system. New recommender system technologies are needed that can quickly produce high quality recommendations, even for very large-scale problems. To address these issues we have explored item-based collaborative filtering techniques. Item-based techniques first analyze the user-item matrix to identify relationships between different items, and then use these relationships to indirectly compute recommendations for users. In this paper we analyze different item-based recommendation generation algorithms. We look into different techniques for computing item-item similarities (e.g., item-item correlation vs. cosine similarities between item vectors) and different techniques for obtaining recommendations from them (e.g., weighted sum vs. regression model). Finally, we experimentally evaluate our results and compare them to the basic k-nearest neighbor approach. Our experiments suggest that item-based algorithms provide dramatically better performance than user-based algorithms, while at the same time providing better quality than the best available user-based algorithms.

@inproceedings{sarwar2001item, author = {Sarwar, Badrul and Karypis, George and Konstan, Joseph and Riedl, John}, title = {Item-based collaborative filtering recommendation algorithms}, booktitle = {WWW '01: Proceedings of the 10th International Conference on World Wide Web}, publisher = {ACM}, address = {New York, NY, USA}, year = {2001}, pages = {285--295}, url = {http://portal.acm.org/citation.cfm?id=372071}, doi = {10.1145/371920.372071}, isbn = {1-58113-348-0}, keywords = {collaborative, filtering, recommender, stair, tag}, abstract = {Recommender systems apply knowledge discovery techniques to the problem of making personalized recommendations for information, products or services during a live interaction. These systems, especially the k-nearest neighbor collaborative filtering based ones, are achieving widespread success on the Web. The tremendous growth in the amount of available information and the number of visitors to Web sites in recent years poses some key challenges for recommender systems. These are: producing high quality recommendations, performing many recommendations per second for millions of users and items and achieving high coverage in the face of data sparsity. In traditional collaborative filtering systems the amount of work increases with the number of participants in the system. New recommender system technologies are needed that can quickly produce high quality recommendations, even for very large-scale problems. To address these issues we have explored item-based collaborative filtering techniques. Item-based techniques first analyze the user-item matrix to identify relationships between different items, and then use these relationships to indirectly compute recommendations for users. In this paper we analyze different item-based recommendation generation algorithms. We look into different techniques for computing item-item similarities (e.g., item-item correlation vs. cosine similarities between item vectors) and different techniques for obtaining recommendations from them (e.g., weighted sum vs. regression model). Finally, we experimentally evaluate our results and compare them to the basic k-nearest neighbor approach. Our experiments suggest that item-based algorithms provide dramatically better performance than user-based algorithms, while at the same time providing better quality than the best available user-based algorithms.} }

%0 = inproceedings %A = Sarwar, Badrul and Karypis, George and Konstan, Joseph and Riedl, John %B = WWW '01: Proceedings of the 10th International Conference on World Wide Web %C = New York, NY, USA %D = 2001 %I = ACM %T = Item-based collaborative filtering recommendation algorithms %U = http://portal.acm.org/citation.cfm?id=372071

Automated collaborative filtering (ACF) systems predict a person's affinity for items or information by connecting that person's recorded interests with the recorded interests of a community of people and sharing ratings between like-minded persons. However, current recommender systems are black boxes, providing no transparency into the working of the recommendation. Explanations provide that transparency, exposing the reasoning and data behind a recommendation. In this paper, we address explanation interfaces for ACF systems - how they should be implemented and why they should be implemented. To explore how, we present a model for explanations based on the user's conceptual model of the recommendation process. We then present experimental results demonstrating what components of an explanation are the most compelling. To address why, we present experimental evidence that shows that providing explanations can improve the acceptance of ACF systems. We also describe some initial explorations into measuring how explanations can improve the filtering performance of users.

@inproceedings{herlocker2000explaining, author = {Herlocker, Jonathan L. and Konstan, Joseph A. and Riedl, John}, title = {Explaining collaborative filtering recommendations}, booktitle = {CSCW '00: Proceedings of the 2000 ACM Conference on Computer Supported Cooperative Work}, publisher = {ACM}, address = {New York, NY, USA}, year = {2000}, pages = {241--250}, url = {http://portal.acm.org/citation.cfm?id=358995}, doi = {10.1145/358916.358995}, isbn = {1-58113-222-0}, keywords = {cf, collaborative, explaining, filtering, recommender}, abstract = {Automated collaborative filtering (ACF) systems predict a person's affinity for items or information by connecting that person's recorded interests with the recorded interests of a community of people and sharing ratings between like-minded persons. However, current recommender systems are black boxes, providing no transparency into the working of the recommendation. Explanations provide that transparency, exposing the reasoning and data behind a recommendation. In this paper, we address explanation interfaces for ACF systems - how they should be implemented and why they should be implemented. To explore how, we present a model for explanations based on the user's conceptual model of the recommendation process. We then present experimental results demonstrating what components of an explanation are the most compelling. To address why, we present experimental evidence that shows that providing explanations can improve the acceptance of ACF systems. We also describe some initial explorations into measuring how explanations can improve the filtering performance of users.} }

%0 = inproceedings %A = Herlocker, Jonathan L. and Konstan, Joseph A. and Riedl, John %B = CSCW '00: Proceedings of the 2000 ACM Conference on Computer Supported Cooperative Work %C = New York, NY, USA %D = 2000 %I = ACM %T = Explaining collaborative filtering recommendations %U = http://portal.acm.org/citation.cfm?id=358995

@article{kautz1997referral, author = {Kautz, Henry and Selman, Bart and Shah, Mehul}, title = {Referral Web: combining social networks and collaborative filtering}, journal = {Communications of the ACM}, publisher = {ACM}, address = {New York, NY, USA}, year = {1997}, volume = {40}, number = {3}, pages = {63--65}, url = {http://doi.acm.org/10.1145/245108.245123}, doi = {10.1145/245108.245123}, issn = {0001-0782}, keywords = {collaborative, filtering, hybrid, network, recommender, social, stair} }

%0 = article %A = Kautz, Henry and Selman, Bart and Shah, Mehul %C = New York, NY, USA %D = 1997 %I = ACM %T = Referral Web: combining social networks and collaborative filtering %U = http://doi.acm.org/10.1145/245108.245123