Since their introduction in the early 1990’s, automated recommender systems have revolutionized the marketing and delivery of commerce and content by providing personalized recommendations and predictions over a variety of large and complex product offerings. In this article, we review the key advances in collaborative filtering recommender systems, focusing on the evolution from research concentrated purely on algorithms to research concentrated on the rich set of questions around the user experience with the recommender. We show through examples that the embedding of the algorithm in the user experience dramatically affects the value to the user of the recommender. We argue that evaluating the user experience of a recommender requires a broader set of measures than have been commonly used, and suggest additional measures that have proven effective. Based on our analysis of the state of the field, we identify the most important open research problems, and outline key challenges slowing the advance of the state of the art, and in some cases limiting the relevance of research to real-world applications.

@article{konstan2012recommender, author = {Konstan, JosephA. and Riedl, John}, title = {Recommender systems: from algorithms to user experience}, journal = {User Modeling and User-Adapted Interaction}, publisher = {Springer Netherlands}, year = {2012}, volume = {22}, number = {1-2}, pages = {101-123}, url = {http://dx.doi.org/10.1007/s11257-011-9112-x}, doi = {10.1007/s11257-011-9112-x}, issn = {0924-1868}, keywords = {algorithms, experience, overview, recommender, survey, systems, user}, abstract = {Since their introduction in the early 1990’s, automated recommender systems have revolutionized the marketing and delivery of commerce and content by providing personalized recommendations and predictions over a variety of large and complex product offerings. In this article, we review the key advances in collaborative filtering recommender systems, focusing on the evolution from research concentrated purely on algorithms to research concentrated on the rich set of questions around the user experience with the recommender. We show through examples that the embedding of the algorithm in the user experience dramatically affects the value to the user of the recommender. We argue that evaluating the user experience of a recommender requires a broader set of measures than have been commonly used, and suggest additional measures that have proven effective. Based on our analysis of the state of the field, we identify the most important open research problems, and outline key challenges slowing the advance of the state of the art, and in some cases limiting the relevance of research to real-world applications.} }

%0 = article %A = Konstan, JosephA. and Riedl, John %D = 2012 %I = Springer Netherlands %T = Recommender systems: from algorithms to user experience %U = http://dx.doi.org/10.1007/s11257-011-9112-x

@book{goodrich2011structures, author = {Goodrich, Michael T. and Tamassia, Roberto}, title = {Data structures and algorithms in Java}, publisher = {Wiley}, address = {Hoboken, NJ}, year = {2011}, edition = {5. ed., internat. student version}, url = {http://scans.hebis.de/HEBCGI/show.pl?22309560_toc.pdf}, isbn = {9780470398807}, keywords = {Seminar, Sortieralgorithmen, Sortieren, algorithms, data, java, structures} }

%0 = book %A = Goodrich, Michael T. and Tamassia, Roberto %C = Hoboken, NJ %D = 2011 %I = Wiley %T = Data structures and algorithms in Java %U = http://scans.hebis.de/HEBCGI/show.pl?22309560_toc.pdf

@conference{YYPG11, author = {Yang, You, Ping Yu und Yan Can}, title = {Experimental study on the five sort algorithms.}, editor = {Automation, Mechanic and (MACE), Control Engineering}, booktitle = {Experimental study on the five sort algorithms.}, year = {2011}, keywords = {algorithms, datenstrukturen} }

%0 = conference %A = Yang, You, Ping Yu und Yan Can %B = Experimental study on the five sort algorithms.} %C = %D = 2011 %I = %T = Experimental study on the five sort algorithms.} %U =

@incollection{ganter2010basic, author = {Ganter, Bernhard}, title = {Two Basic Algorithms in Concept Analysis}, editor = {Kwuida, Léonard and Sertkaya, Baris}, booktitle = {Formal Concept Analysis}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, address = {Berlin / Heidelberg}, year = {2010}, volume = {5986}, pages = {312-340}, url = {http://dx.doi.org/10.1007/978-3-642-11928-6_22}, doi = {10.1007/978-3-642-11928-6_22}, isbn = {978-3-642-11927-9}, keywords = {algorithms, basic, closure, fca, next} }

%0 = incollection %A = Ganter, Bernhard %B = Formal Concept Analysis %C = Berlin / Heidelberg %D = 2010 %I = Springer %T = Two Basic Algorithms in Concept Analysis %U = http://dx.doi.org/10.1007/978-3-642-11928-6_22

Detecting clusters or communities in large real-world graphs such as large
cial or information networks is a problem of considerable interest. In
actice, one typically chooses an objective function that captures the
tuition of a network cluster as set of nodes with better internal
nnectivity than external connectivity, and then one applies approximation
gorithms or heuristics to extract sets of nodes that are related to the
jective function and that "look like" good communities for the application of
terest. In this paper, we explore a range of network community detection
thods in order to compare them and to understand their relative performance
d the systematic biases in the clusters they identify. We evaluate several
mmon objective functions that are used to formalize the notion of a network
mmunity, and we examine several different classes of approximation algorithms
at aim to optimize such objective functions. In addition, rather than simply
xing an objective and asking for an approximation to the best cluster of any
ze, we consider a size-resolved version of the optimization problem.
nsidering community quality as a function of its size provides a much finer
ns with which to examine community detection algorithms, since objective
nctions and approximation algorithms often have non-obvious size-dependent
havior.

@misc{Leskovec2010, author = {Leskovec, Jure and Lang, Kevin J. and Mahoney, Michael W.}, title = {Empirical Comparison of Algorithms for Network Community Detection}, year = {2010}, note = {cite arxiv:1004.3539
}, url = {http://arxiv.org/abs/1004.3539}, keywords = {algorithms, community, comparison, detection, evaluation, network}, abstract = { Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses an objective function that captures the intuition of a network cluster as set of nodes with better internal connectivity than external connectivity, and then one applies approximation algorithms or heuristics to extract sets of nodes that are related to the objective function and that "look like" good communities for the application of interest. In this paper, we explore a range of network community detection methods in order to compare them and to understand their relative performance and the systematic biases in the clusters they identify. We evaluate several common objective functions that are used to formalize the notion of a network community, and we examine several different classes of approximation algorithms that aim to optimize such objective functions. In addition, rather than simply fixing an objective and asking for an approximation to the best cluster of any size, we consider a size-resolved version of the optimization problem. Considering community quality as a function of its size provides a much finer lens with which to examine community detection algorithms, since objective functions and approximation algorithms often have non-obvious size-dependent behavior. } }

%0 = misc %A = Leskovec, Jure and Lang, Kevin J. and Mahoney, Michael W. %B = } %C = %D = 2010 %I = %T = Empirical Comparison of Algorithms for Network Community Detection} %U = http://arxiv.org/abs/1004.3539

@book{Cormen2009, author = {Cormen, Thomas H.}, title = {Introduction to algorithms}, publisher = {The MIT Press}, address = {Cambridge, Masachusetts; London}, year = {2009}, url = {http://www.amazon.de/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844}, isbn = {9780262033848 0262033844 9780262533058 0262533057}, keywords = {2013, algorithmen, algorithms, kde, quicksort, seminar, sorting} }

%0 = book %A = Cormen, Thomas H. %C = Cambridge, Masachusetts; London %D = 2009 %I = The MIT Press %T = Introduction to algorithms %U = http://www.amazon.de/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844

@book{cormen2009introduction, author = {Cormen, Thomas H.}, title = {Introduction to algorithms}, publisher = {The MIT Press}, address = {Cambridge, Masachusetts; London}, year = {2009}, url = {http://www.amazon.de/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844}, isbn = {9780262033848 0262033844 9780262533058 0262533057}, keywords = {algorithms, kde, seminar, sorting} }

%0 = book %A = Cormen, Thomas H. %C = Cambridge, Masachusetts; London %D = 2009 %I = The MIT Press %T = Introduction to algorithms %U = http://www.amazon.de/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844

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

This paper is devoted to the "Discovery of Slowness." The archetypical perversely awful algorithm bogo-sort, which is sometimes referred to as Monkey-sort, is analyzed with elementary methods. Moreover, practical experiments are performed.

@inproceedings{Gruber:2007:SSW:1760607.1760624, author = {Gruber, Hermann and Holzer, Markus and Ruepp, Oliver}, title = {Sorting the slow way: an analysis of perversely awful randomized sorting algorithms}, booktitle = {Proceedings of the 4th international conference on Fun with algorithms}, series = {FUN'07}, publisher = {Springer-Verlag}, address = {Berlin, Heidelberg}, year = {2007}, pages = {183--197}, url = {http://portal.acm.org/citation.cfm?id=1760607.1760624}, isbn = {978-3-540-72913-6}, keywords = {2011, algorithms, kde, seminar, slow, sorting}, abstract = {This paper is devoted to the "Discovery of Slowness." The archetypical perversely awful algorithm bogo-sort, which is sometimes referred to as Monkey-sort, is analyzed with elementary methods. Moreover, practical experiments are performed.} }

%0 = inproceedings %A = Gruber, Hermann and Holzer, Markus and Ruepp, Oliver %B = Proceedings of the 4th international conference on Fun with algorithms %C = Berlin, Heidelberg %D = 2007 %I = Springer-Verlag %T = Sorting the slow way: an analysis of perversely awful randomized sorting algorithms %U = http://portal.acm.org/citation.cfm?id=1760607.1760624

Event-based network data consists of sets of events over time, each of which may involve multiple entities. Examples include email traffic, telephone calls, and research publications (interpreted as co-authorship events). Traditional network analysis techniques, such as social network models, often aggregate the relational information from each event into a single static network. In contrast, in this paper we focus on the temporal nature of such data. In particular, we look at the problems of temporal link prediction and node ranking, and describe new methods that illustrate opportunities for data mining and machine learning techniques in this context. Experimental results are discussed for a large set of co-authorship events measured over multiple years, and a large corporate email data set spanning 21 months.

@article{1117458, author = {O'Madadhain, Joshua and Hutchins, Jon and Smyth, Padhraic}, title = {Prediction and ranking algorithms for event-based network data}, journal = {SIGKDD Explor. Newsl.}, publisher = {ACM}, address = {New York, NY, USA}, year = {2005}, volume = {7}, number = {2}, pages = {23--30}, url = {http://portal.acm.org/citation.cfm?id=1117458}, doi = {10.1145/1117454.1117458}, issn = {1931-0145}, keywords = {algorithms, event, prediction, ranking, toread}, abstract = {Event-based network data consists of sets of events over time, each of which may involve multiple entities. Examples include email traffic, telephone calls, and research publications (interpreted as co-authorship events). Traditional network analysis techniques, such as social network models, often aggregate the relational information from each event into a single static network. In contrast, in this paper we focus on the temporal nature of such data. In particular, we look at the problems of temporal link prediction and node ranking, and describe new methods that illustrate opportunities for data mining and machine learning techniques in this context. Experimental results are discussed for a large set of co-authorship events measured over multiple years, and a large corporate email data set spanning 21 months.} }

%0 = article %A = O'Madadhain, Joshua and Hutchins, Jon and Smyth, Padhraic %C = New York, NY, USA %D = 2005 %I = ACM %T = Prediction and ranking algorithms for event-based network data %U = http://portal.acm.org/citation.cfm?id=1117458

@book{cullum2002lanczos, author = {Cullum, J.K. and Willoughby, R.A.}, title = {Lanczos algorithms for large symmetric eigenvalue computations: Documentaion and Listings Original Lanczos Codes}, publisher = {Society for Industrial Mathematics}, year = {2002}, url = {http://scholar.google.de/scholar.bib?q=info:zshJq2GVHO8J:scholar.google.com/&output=citation&hl=de&ct=citation&cd=0}, keywords = {algorithms, eigenvalue, lanczos} }

%0 = book %A = Cullum, J.K. and Willoughby, R.A. %D = 2002 %I = Society for Industrial Mathematics %T = Lanczos algorithms for large symmetric eigenvalue computations: Documentaion and Listings Original Lanczos Codes %U = http://scholar.google.de/scholar.bib?q=info:zshJq2GVHO8J:scholar.google.com/&output=citation&hl=de&ct=citation&cd=0

@book{cullum2002lanczos, author = {Cullum, J.K. and Willoughby, R.A.}, title = {Lanczos algorithms for large symmetric eigenvalue computations: Theory}, publisher = {Society for Industrial Mathematics}, year = {2002}, url = {http://scholar.google.de/scholar.bib?q=info:zshJq2GVHO8J:scholar.google.com/&output=citation&hl=de&ct=citation&cd=0}, keywords = {algorithms, eigenvalue, large, symmetric} }

%0 = book %A = Cullum, J.K. and Willoughby, R.A. %D = 2002 %I = Society for Industrial Mathematics %T = Lanczos algorithms for large symmetric eigenvalue computations: Theory %U = http://scholar.google.de/scholar.bib?q=info:zshJq2GVHO8J:scholar.google.com/&output=citation&hl=de&ct=citation&cd=0

@article{kuznetsov2002comparing, author = {Kuznetsov, Sergei O. and Obiedkov, Sergei A.}, title = {Comparing performance of algorithms for generating concept lattices}, journal = {Journal of Experimental & Theoretical Artificial Intelligence}, year = {2002}, volume = {14}, number = {2-3}, pages = {189-216}, url = {http://www.tandfonline.com/doi/abs/10.1080/09528130210164170}, doi = {10.1080/09528130210164170}, keywords = {algorithms, comparing, concept, generating, performance} }

%0 = article %A = Kuznetsov, Sergei O. and Obiedkov, Sergei A. %D = 2002 %T = Comparing performance of algorithms for generating concept lattices %U = http://www.tandfonline.com/doi/abs/10.1080/09528130210164170

@book{knuth1997computer, author = {Knuth, Donald Ervin}, title = {The art of computer programming : 1. Fundamental algorithms}, publisher = {Addison-Wesley}, address = {Upper Saddle River, NJ [u.a.]}, year = {1997}, edition = {3. ed., 1. printing}, url = {http://www.ulb.tu-darmstadt.de/tocs/53995619.pdf}, isbn = {9780201896831}, keywords = {algorithms, knuth, programming} }

%0 = book %A = Knuth, Donald Ervin %C = Upper Saddle River, NJ [u.a.] %D = 1997 %I = Addison-Wesley %T = The art of computer programming : 1. Fundamental algorithms %U = http://www.ulb.tu-darmstadt.de/tocs/53995619.pdf

@book{knuth1997computer, author = {Knuth, Donald Ervin}, title = {The art of computer programming : 1. Fundamental algorithms}, publisher = {Addison-Wesley}, address = {Upper Saddle River, NJ [u.a.]}, year = {1997}, edition = {3. ed., 1. printing}, url = {http://www.ulb.tu-darmstadt.de/tocs/53995619.pdf}, isbn = {9780201896831}, keywords = {algorithms, knuth, computer-science, latexkurs} }

%0 = book %A = Knuth, Donald Ervin %C = Upper Saddle River, NJ [u.a.] %D = 1997 %I = Addison-Wesley %T = The art of computer programming : 1. Fundamental algorithms %U = http://www.ulb.tu-darmstadt.de/tocs/53995619.pdf

@book{knuth1997computer, author = {Knuth, Donald Ervin}, title = {The art of computer programming : 1. Fundamental algorithms}, publisher = {Addison-Wesley}, address = {Upper Saddle River, NJ [u.a.]}, year = {1997}, edition = {3. ed., 1. printing}, url = {http://www.ulb.tu-darmstadt.de/tocs/53995619.pdf}, isbn = {9780201896831}, keywords = {programm, art, knuth, algorithms} }

%0 = book %A = Knuth, Donald Ervin %C = Upper Saddle River, NJ [u.a.] %D = 1997 %I = Addison-Wesley %T = The art of computer programming : 1. Fundamental algorithms %U = http://www.ulb.tu-darmstadt.de/tocs/53995619.pdf

@book{knuth1997computer, author = {Knuth, Donald Ervin}, title = {The art of computer programming : 1. Fundamental algorithms}, publisher = {Addison-Wesley}, address = {Upper Saddle River, NJ [u.a.]}, year = {1997}, edition = {3. ed., 1. printing}, url = {http://www.ulb.tu-darmstadt.de/tocs/53995619.pdf}, isbn = {9780201896831}, keywords = {algorithms, knuth, computer-science, latexkurs} }

%0 = book %A = Knuth, Donald Ervin %C = Upper Saddle River, NJ [u.a.] %D = 1997 %I = Addison-Wesley %T = The art of computer programming : 1. Fundamental algorithms %U = http://www.ulb.tu-darmstadt.de/tocs/53995619.pdf

@book{knuth1997computer, author = {Knuth, Donald Ervin}, title = {The art of computer programming : 1. Fundamental algorithms}, publisher = {Addison-Wesley}, address = {Upper Saddle River, NJ [u.a.]}, year = {1997}, edition = {3. ed., 1. printing}, url = {http://www.ulb.tu-darmstadt.de/tocs/53995619.pdf}, isbn = {9780201896831}, keywords = {algorithms, knuth, computerscience, latexkurs} }

%0 = book %A = Knuth, Donald Ervin %C = Upper Saddle River, NJ [u.a.] %D = 1997 %I = Addison-Wesley %T = The art of computer programming : 1. Fundamental algorithms %U = http://www.ulb.tu-darmstadt.de/tocs/53995619.pdf

@article{musser1997introspective, author = {Musser, David R.}, title = {Introspective sorting and selection algorithms}, journal = {Software — Practice and Experience}, year = {1997}, volume = {27}, number = {8}, pages = {983 - 993 }, keywords = {algorithms, introsort, kdesems2013, sorting} }

%0 = article %A = Musser, David R. %D = 1997 %T = Introspective sorting and selection algorithms

@book{0898713560, author = {Lawson, Charles L. and Hanson, Richard J.}, title = {Solving Least Squares Problems (Classics in Applied Mathematics)}, publisher = {Society for Industrial Mathematics}, year = {1987}, edition = {New edition}, url = {http://www.amazon.de/Solving-Squares-Problems-Classics-Mathematics/dp/0898713560%3FSubscriptionId%3D192BW6DQ43CK9FN0ZGG2%26tag%3Dws%26linkCode%3Dxm2%26camp%3D2025%26creative%3D165953%26creativeASIN%3D0898713560}, isbn = {0898713560}, keywords = {algorithms, svd} }

%0 = book %A = Lawson, Charles L. and Hanson, Richard J. %D = 1987 %I = Society for Industrial Mathematics %T = Solving Least Squares Problems (Classics in Applied Mathematics) %U = http://www.amazon.de/Solving-Squares-Problems-Classics-Mathematics/dp/0898713560%3FSubscriptionId%3D192BW6DQ43CK9FN0ZGG2%26tag%3Dws%26linkCode%3Dxm2%26camp%3D2025%26creative%3D165953%26creativeASIN%3D0898713560