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.
ER - TY - BOOK AU - Cormen, Thomas H. A2 - T1 - Introduction to algorithms PB - The MIT Press C1 - Cambridge, Masachusetts; London PY - 2009/ VL - IS - SP - EP - UR - http://www.amazon.de/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844 DO - KW - 2013 KW - algorithmen KW - algorithms KW - kde KW - quicksort KW - seminar KW - sorting L1 - SN - 9780262033848 0262033844 9780262533058 0262533057 N1 - Introduction to Algorithms: Amazon.de: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Englische Bücher N1 - AB - ER - TY - BOOK AU - Cormen, Thomas H. A2 - T1 - Introduction to algorithms PB - The MIT Press C1 - Cambridge, Masachusetts; London PY - 2009/ VL - IS - SP - EP - UR - http://www.amazon.de/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844 DO - KW - algorithms KW - kde KW - seminar KW - sorting L1 - SN - 9780262033848 0262033844 9780262533058 0262533057 N1 - Introduction to Algorithms: Amazon.de: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Englische Bücher N1 - AB - ER - TY - CONF AU - Parra, Denis AU - Brusilovsky, Peter A2 - T1 - Evaluation of Collaborative Filtering Algorithms for Recommending Articles on CiteULike T2 - Proceedings of the Workshop on Web 3.0: Merging Semantic Web and Social Web PB - C1 - PY - 2009/06 CY - VL - 467 IS - SP - EP - UR - http://ceur-ws.org/Vol-467/paper5.pdf DO - KW - algorithms KW - citedBy:doerfel2012leveraging KW - collaborative KW - evaluation KW - filtering L1 - SN - N1 - N1 - AB - 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. ER - TY - CONF AU - Gruber, Hermann AU - Holzer, Markus AU - Ruepp, Oliver A2 - T1 - Sorting the slow way: an analysis of perversely awful randomized sorting algorithms T2 - Proceedings of the 4th international conference on Fun with algorithms PB - Springer-Verlag C1 - Berlin, Heidelberg PY - 2007/ CY - VL - IS - SP - 183 EP - 197 UR - http://portal.acm.org/citation.cfm?id=1760607.1760624 DO - KW - 2011 KW - algorithms KW - kde KW - seminar KW - slow KW - sorting L1 - SN - 978-3-540-72913-6 N1 - Sorting the slow way N1 - AB - 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. ER - TY - JOUR AU - O'Madadhain, Joshua AU - Hutchins, Jon AU - Smyth, Padhraic T1 - Prediction and ranking algorithms for event-based network data JO - SIGKDD Explor. Newsl. PY - 2005/ VL - 7 IS - 2 SP - 23 EP - 30 UR - http://portal.acm.org/citation.cfm?id=1117458 DO - 10.1145/1117454.1117458 KW - algorithms KW - event KW - prediction KW - ranking KW - toread L1 - SN - N1 - Prediction and ranking algorithms for event-based network data N1 - AB - 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. ER - TY - BOOK AU - Cullum, J.K. AU - Willoughby, R.A. A2 - T1 - Lanczos algorithms for large symmetric eigenvalue computations: Documentaion and Listings Original Lanczos Codes PB - Society for Industrial Mathematics C1 - PY - 2002/ VL - IS - SP - EP - UR - http://scholar.google.de/scholar.bib?q=info:zshJq2GVHO8J:scholar.google.com/&output=citation&hl=de&ct=citation&cd=0 DO - KW - algorithms KW - eigenvalue KW - lanczos L1 - SN - N1 - N1 - AB - ER - TY - BOOK AU - Cullum, J.K. AU - Willoughby, R.A. A2 - T1 - Lanczos algorithms for large symmetric eigenvalue computations: Theory PB - Society for Industrial Mathematics C1 - PY - 2002/ VL - IS - SP - EP - UR - http://scholar.google.de/scholar.bib?q=info:zshJq2GVHO8J:scholar.google.com/&output=citation&hl=de&ct=citation&cd=0 DO - KW - algorithms KW - eigenvalue KW - large KW - symmetric L1 - SN - N1 - N1 - AB - ER - TY - JOUR AU - Kuznetsov, Sergei O. AU - Obiedkov, Sergei A. T1 - Comparing performance of algorithms for generating concept lattices JO - Journal of Experimental & Theoretical Artificial Intelligence PY - 2002/ VL - 14 IS - 2-3 SP - 189 EP - 216 UR - http://www.tandfonline.com/doi/abs/10.1080/09528130210164170 DO - 10.1080/09528130210164170 KW - algorithms KW - comparing KW - concept KW - generating KW - performance L1 - SN - N1 - Taylor & Francis Online :: Comparing performance of algorithms for generating concept lattices - Journal of Experimental & Theoretical Artificial Intelligence - Volume 14, Issue 2-3 N1 - AB - ER - TY - BOOK AU - Knuth, Donald Ervin A2 - T1 - The art of computer programming : 1. Fundamental algorithms PB - Addison-Wesley C1 - Upper Saddle River, NJ [u.a.] PY - 1997/ VL - IS - SP - EP - UR - http://www.ulb.tu-darmstadt.de/tocs/53995619.pdf DO - KW - algorithms KW - knuth KW - programming L1 - SN - 9780201896831 N1 - N1 - AB - ER - TY - BOOK AU - Knuth, Donald Ervin A2 - T1 - The art of computer programming : 1. Fundamental algorithms PB - Addison-Wesley C1 - Upper Saddle River, NJ [u.a.] PY - 1997/ VL - IS - SP - EP - UR - http://www.ulb.tu-darmstadt.de/tocs/53995619.pdf DO - KW - algorithms KW - knuth KW - computer-science KW - latexkurs L1 - SN - 9780201896831 N1 - N1 - AB - ER - TY - BOOK AU - Knuth, Donald Ervin A2 - T1 - The art of computer programming : 1. Fundamental algorithms PB - Addison-Wesley C1 - Upper Saddle River, NJ [u.a.] PY - 1997/ VL - IS - SP - EP - UR - http://www.ulb.tu-darmstadt.de/tocs/53995619.pdf DO - KW - programm KW - art KW - knuth KW - algorithms L1 - SN - 9780201896831 N1 - N1 - AB - ER - TY - BOOK AU - Knuth, Donald Ervin A2 - T1 - The art of computer programming : 1. Fundamental algorithms PB - Addison-Wesley C1 - Upper Saddle River, NJ [u.a.] PY - 1997/ VL - IS - SP - EP - UR - http://www.ulb.tu-darmstadt.de/tocs/53995619.pdf DO - KW - algorithms KW - knuth KW - computer-science KW - latexkurs L1 - SN - 9780201896831 N1 - N1 - AB - ER - TY - BOOK AU - Knuth, Donald Ervin A2 - T1 - The art of computer programming : 1. Fundamental algorithms PB - Addison-Wesley C1 - Upper Saddle River, NJ [u.a.] PY - 1997/ VL - IS - SP - EP - UR - http://www.ulb.tu-darmstadt.de/tocs/53995619.pdf DO - KW - algorithms KW - knuth KW - computerscience KW - latexkurs L1 - SN - 9780201896831 N1 - N1 - AB - ER - TY - JOUR AU - Musser, David R. T1 - Introspective sorting and selection algorithms JO - Software — Practice and Experience PY - 1997/08 VL - 27 IS - 8 SP - 983 EP - 993 UR - DO - KW - algorithms KW - introsort KW - kdesems2013 KW - sorting L1 - SN - N1 - N1 - AB - ER - TY - BOOK AU - Lawson, Charles L. AU - Hanson, Richard J. A2 - T1 - Solving Least Squares Problems (Classics in Applied Mathematics) PB - Society for Industrial Mathematics C1 - PY - 1987/ VL - IS - SP - EP - UR - http://www.amazon.de/Solving-Squares-Problems-Classics-Mathematics/dp/0898713560%3FSubscriptionId%3D192BW6DQ43CK9FN0ZGG2%26tag%3Dws%26linkCode%3Dxm2%26camp%3D2025%26creative%3D165953%26creativeASIN%3D0898713560 DO - KW - algorithms KW - svd L1 - SN - 0898713560 N1 - N1 - AB - ER -