http://www.bibsonomy.org/user/ans/learningBibSonomy RSS Feed for /user/ans/learningall-bibs-cleaned.bibhttp://www.bibsonomy.org/bibtex/2909a5f2d78fa425920ed29c346a4e60a/ansans2008-01-08T16:43:48+01:00history seminar navigation projekt ws07 recommender kde learning rules <span style="color:#555555;">Xiaobin <a href="http://www.bibsonomy.org/author/Fu">Fu</a> and Jay <a href="http://www.bibsonomy.org/author/Budzik">Budzik</a> and Kristian J. <a href="http://www.bibsonomy.org/author/Hammond">Hammond</a> </span>(<em>2000</em>) <a href="http://www.bibsonomy.org/bibtex/2909a5f2d78fa425920ed29c346a4e60a/ans"><i>Mining Navigation History for Recommendation..</i></a><em>IUI '00: Proceedings of the 5th International Conference on Intelligent User Interfaces, </em><em>page106--112. </em><em>New York, NY, USA, </em><em>ACM Press, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/ans/history">history</a> <a href="http://www.bibsonomy.org/user/ans/seminar">seminar</a> <a href="http://www.bibsonomy.org/user/ans/navigation">navigation</a> <a href="http://www.bibsonomy.org/user/ans/projekt">projekt</a> <a href="http://www.bibsonomy.org/user/ans/ws07">ws07</a> <a href="http://www.bibsonomy.org/user/ans/recommender">recommender</a> <a href="http://www.bibsonomy.org/user/ans/kde">kde</a> <a href="http://www.bibsonomy.org/user/ans/learning">learning</a> <a href="http://www.bibsonomy.org/user/ans/rules">rules</a>]SpringerLink - Book Chapterhttp://www.bibsonomy.org/bibtex/249c80c0aeb3c7eeb1941dcb62a5d26f3/ansans2007-11-21T21:48:52+01:00seminar projekt classification ws07 recommender svm kde learning knn <span style="color:#555555;">Miha <a href="http://www.bibsonomy.org/author/Grčar">Gr&#269;ar</a> and Bla&#382; <a href="http://www.bibsonomy.org/author/Fortuna">Fortuna</a> and Dunja <a href="http://www.bibsonomy.org/author/Mladenič">Mladeni&#269;</a> and Marko <a href="http://www.bibsonomy.org/author/Grobelnik">Grobelnik</a> </span>(<em>2006</em>) <a href="http://www.bibsonomy.org/bibtex/249c80c0aeb3c7eeb1941dcb62a5d26f3/ans"><i>kNN Versus SVM in the Collaborative Filtering Framework.</i></a><em>Data Science and Classification</em><em>page251--260. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/ans/seminar">seminar</a> <a href="http://www.bibsonomy.org/user/ans/projekt">projekt</a> <a href="http://www.bibsonomy.org/user/ans/classification">classification</a> <a href="http://www.bibsonomy.org/user/ans/ws07">ws07</a> <a href="http://www.bibsonomy.org/user/ans/recommender">recommender</a> <a href="http://www.bibsonomy.org/user/ans/svm">svm</a> <a href="http://www.bibsonomy.org/user/ans/kde">kde</a> <a href="http://www.bibsonomy.org/user/ans/learning">learning</a> <a href="http://www.bibsonomy.org/user/ans/knn">knn</a>] <a href="http://db.cs.ualberta.ca/webkdd05/proc/paper25-mladenic.pdf">URL</a>Collaborative Learning and Recommender Systemshttp://www.bibsonomy.org/bibtex/2cf5ddf4740a73d8c161e704cac3240f6/ansans2007-11-21T21:46:43+01:00seminar projekt classification ws07 recommender kde learning <span style="color:#555555;">Wee Sun <a href="http://www.bibsonomy.org/author/Lee">Lee</a> </span>(<em>2001</em>) <a href="http://www.bibsonomy.org/bibtex/2cf5ddf4740a73d8c161e704cac3240f6/ans"><i>Collaborative Learning and Recommender Systems.</i></a><em>ICML '01: Proceedings of the Eighteenth International Conference on Machine Learning, </em><em>page314--321. </em><em>San Francisco, CA, USA, </em><em>Morgan Kaufmann Publishers Inc., </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/ans/seminar">seminar</a> <a href="http://www.bibsonomy.org/user/ans/projekt">projekt</a> <a href="http://www.bibsonomy.org/user/ans/classification">classification</a> <a href="http://www.bibsonomy.org/user/ans/ws07">ws07</a> <a href="http://www.bibsonomy.org/user/ans/recommender">recommender</a> <a href="http://www.bibsonomy.org/user/ans/kde">kde</a> <a href="http://www.bibsonomy.org/user/ans/learning">learning</a>] <a href="http://www.comp.nus.edu.sg/~leews/publications/icml01.pdf">URL</a>Learning Collaborative Information Filtershttp://www.bibsonomy.org/bibtex/2977851e8e6cb73b8b94b0cea69dbb9e3/ansans2007-11-21T21:46:08+01:00seminar projekt classification ws07 recommender kde learning <span style="color:#555555;">Daniel <a href="http://www.bibsonomy.org/author/Billsus">Billsus</a> and Michael J. <a href="http://www.bibsonomy.org/author/Pazzani">Pazzani</a> </span>(<em>1998</em>) <a href="http://www.bibsonomy.org/bibtex/2977851e8e6cb73b8b94b0cea69dbb9e3/ans"><i>Learning Collaborative Information Filters.</i></a><em>ICML '98: Proceedings of the Fifteenth International Conference on Machine Learning, </em><em>page46--54. </em><em>San Francisco, CA, USA, </em><em>Morgan Kaufmann Publishers Inc., </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/ans/seminar">seminar</a> <a href="http://www.bibsonomy.org/user/ans/projekt">projekt</a> <a href="http://www.bibsonomy.org/user/ans/classification">classification</a> <a href="http://www.bibsonomy.org/user/ans/ws07">ws07</a> <a href="http://www.bibsonomy.org/user/ans/recommender">recommender</a> <a href="http://www.bibsonomy.org/user/ans/kde">kde</a> <a href="http://www.bibsonomy.org/user/ans/learning">learning</a>] <a href="http://www.ics.uci.edu/~pazzani/Publications/MLC98.pdf">URL</a>http://www.bibsonomy.org/bibtex/290f4b7eab8a7a308c6e077a993cd19d8/ansans2007-11-21T21:44:17+01:00seminar projekt classification ws07 recommender kde learning <span style="color:#555555;">Chumki <a href="http://www.bibsonomy.org/author/Basu">Basu</a> and Haym <a href="http://www.bibsonomy.org/author/Hirsh">Hirsh</a> and William <a href="http://www.bibsonomy.org/author/Cohen">Cohen</a> </span>(<em>1998</em>) <a href="http://www.bibsonomy.org/bibtex/290f4b7eab8a7a308c6e077a993cd19d8/ans"><i>Recommendation as classification: using social and content-based information in recommendation.</i></a><em>AAAI '98/IAAI '98: Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence, </em><em>page714--720. </em><em>Menlo Park, CA, USA, </em><em>American Association for Artificial Intelligence, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/ans/seminar">seminar</a> <a href="http://www.bibsonomy.org/user/ans/projekt">projekt</a> <a href="http://www.bibsonomy.org/user/ans/classification">classification</a> <a href="http://www.bibsonomy.org/user/ans/ws07">ws07</a> <a href="http://www.bibsonomy.org/user/ans/recommender">recommender</a> <a href="http://www.bibsonomy.org/user/ans/kde">kde</a> <a href="http://www.bibsonomy.org/user/ans/learning">learning</a>] <a href="ftp://ftp.cs.rutgers.edu/pub/hirsh/papers/1998/aaai1.ps">URL</a>http://www.bibsonomy.org/bibtex/22c3aea62cafdd8a01a68e3fbed7b4071/ansans2007-11-01T12:09:31+01:00seminar projekt classification ws07 recommender kde learning <span style="color:#555555;">Lars <a href="http://www.bibsonomy.org/author/Schmidt-Thieme">Schmidt-Thieme</a> </span>(<em>2005</em>) <a href="http://www.bibsonomy.org/bibtex/22c3aea62cafdd8a01a68e3fbed7b4071/ans"><i>Compound Classification Models for Recommender Systems..</i></a><em>Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 27-30 November 2005, </em><em>page378-385. </em><em>Houston, Texas, USA, </em><em>IEEE Computer Society, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/ans/seminar">seminar</a> <a href="http://www.bibsonomy.org/user/ans/projekt">projekt</a> <a href="http://www.bibsonomy.org/user/ans/classification">classification</a> <a href="http://www.bibsonomy.org/user/ans/ws07">ws07</a> <a href="http://www.bibsonomy.org/user/ans/recommender">recommender</a> <a href="http://www.bibsonomy.org/user/ans/kde">kde</a> <a href="http://www.bibsonomy.org/user/ans/learning">learning</a>] <a href="http://www.informatik.uni-freiburg.de/cgnm/pub/pdfs/Schmidt-Thieme2005-compound-classifiers-for-recommender-systems.pdf">URL</a>