%0 Conference Paper %1 ekstrand2010automatically %A Ekstrand, Michael D. %A Kannan, Praveen %A Stemper, James A. %A Butler, John T. %A Konstan, Joseph A. %A Riedl, John T. %B Proceedings of the fourth ACM conference on Recommender systems %C New York, NY, USA %D 2010 %I ACM %K literaturverwaltung recommender %P 159--166 %R 10.1145/1864708.1864740 %T Automatically building research reading lists %U http://doi.acm.org/10.1145/1864708.1864740 %X All new researchers face the daunting task of familiarizing themselves with the existing body of research literature in their respective fields. Recommender algorithms could aid in preparing these lists, but most current algorithms do not understand how to rate the importance of a paper within the literature, which might limit their effectiveness in this domain. We explore several methods for augmenting existing collaborative and content-based filtering algorithms with measures of the influence of a paper within the web of citations. We measure influence using well-known algorithms, such as HITS and PageRank, for measuring a node's importance in a graph. Among these augmentation methods is a novel method for using importance scores to influence collaborative filtering. We present a task-centered evaluation, including both an offline analysis and a user study, of the performance of the algorithms. Results from these studies indicate that collaborative filtering outperforms content-based approaches for generating introductory reading lists. %@ 978-1-60558-906-0

@inproceedings{ekstrand2010automatically, abstract = {All new researchers face the daunting task of familiarizing themselves with the existing body of research literature in their respective fields. Recommender algorithms could aid in preparing these lists, but most current algorithms do not understand how to rate the importance of a paper within the literature, which might limit their effectiveness in this domain. We explore several methods for augmenting existing collaborative and content-based filtering algorithms with measures of the influence of a paper within the web of citations. We measure influence using well-known algorithms, such as HITS and PageRank, for measuring a node's importance in a graph. Among these augmentation methods is a novel method for using importance scores to influence collaborative filtering. We present a task-centered evaluation, including both an offline analysis and a user study, of the performance of the algorithms. Results from these studies indicate that collaborative filtering outperforms content-based approaches for generating introductory reading lists.}, acmid = {1864740}, added-at = {2012-03-19T19:21:47.000+0100}, address = {New York, NY, USA}, author = {Ekstrand, Michael D. and Kannan, Praveen and Stemper, James A. and Butler, John T. and Konstan, Joseph A. and Riedl, John T.}, biburl = {https://www.bibsonomy.org/bibtex/2fbe0d5fca62781e5156d04e20d324a46/klekih_petra}, booktitle = {Proceedings of the fourth ACM conference on Recommender systems}, doi = {10.1145/1864708.1864740}, interhash = {71ea85067f7d5f46bbb3a5da7e18ba34}, intrahash = {fbe0d5fca62781e5156d04e20d324a46}, isbn = {978-1-60558-906-0}, keywords = {literaturverwaltung recommender}, location = {Barcelona, Spain}, numpages = {8}, pages = {159--166}, publisher = {ACM}, timestamp = {2012-03-19T19:21:47.000+0100}, title = {Automatically building research reading lists}, url = {http://doi.acm.org/10.1145/1864708.1864740}, year = 2010 }