@misc{citeulike:155,
  abstract = {Inspired by empirical studies of networked systems such as the Internet,
social networks, and biological networks, researchers have in recent years
developed a variety of techniques and models to help us understand or predict
the behavior of these systems. Here we review developments in this field,
including such concepts as the small-world effect, degree distributions,
clustering, network correlations, random graph models, models of network growth
and preferential attachment, and dynamical processes taking place on networks.},
  author = {Newman, M. E. J.},
  citeulike-article-id = {155},
  eprint = {cond-mat/0303516},
  interhash = {7bedd01cb4c06af9f5200b0fb3faa571},
  intrahash = {d53568209eef08fb0a8734cf34c59a71},
  keywords = {affinity algorithm arch clustering complex-systems folksonomy growth information_retrieval math network network_theory readinggroup scale-free-networks small_world socialnetwork systems thesis web web-graph},
  month = {March},
  priority = {5},
  title = {The structure and function of complex networks},
  url = {http://arxiv.org/abs/cond-mat/0303516},
  year = 2003
}

@article{newman03fast,
  author = {Newman, M.E.J.},
  interhash = {4493f03106eb8dd9db41c0ef3f667bb3},
  intrahash = {56de7e6d214faebdbf2f2ef0fce09d7d},
  journal = {Physical Review E},
  month = {September},
  title = {Fast algorithm for detecting community structure in networks},
  url = {http://arxiv.org/abs/cond-mat/0309508},
  volume = 69,
  year = 2003
}

@inproceedings{686448,
  address = {London, UK},
  author = {Robardet, Celine and Feschet, Fabien},
  booktitle = {IDEAL '00: Proceedings of the Second International Conference on Intelligent Data Engineering and Automated Learning, Data Mining, Financial Engineering, and Intelligent Agents},
  interhash = {4f84f6ea55fa08abf881620b0e0a5c08},
  intrahash = {fc7666de531b96ae956d933ea88be3cd},
  isbn = {3-540-41450-9},
  pages = {565--570},
  publisher = {Springer-Verlag},
  title = {A New Methodology to Compare Clustering Algorithms},
  year = 2000
}

@inproceedings{FalBarSpi07,
  author = {Falkowski, Tanja and Barth, Anja and Spiliopoulou, Myra},
  booktitle = {In Proc. of the 2007 IEEE / WIC / ACM International Conference on Web Intelligence,},
  interhash = {abd9653fc405547fd263c72c5bc5ae88},
  intrahash = {c0f9b82222d0c9a0b1cb0a5fa41a735a},
  pages = {112-115},
  title = {DENGRAPH: A Density-based Community Detection Algorithm},
  url = {http://wwwiti.cs.uni-magdeburg.de/~tfalkows/publ/2007/WI_FalBarSpi07.pdf},
  year = 2007
}

@article{newman03fast,
  author = {Newman, M.E.J.},
  interhash = {4493f03106eb8dd9db41c0ef3f667bb3},
  intrahash = {56de7e6d214faebdbf2f2ef0fce09d7d},
  journal = {Physical Review E},
  month = {September},
  title = {Fast algorithm for detecting community structure in networks},
  url = {http://arxiv.org/abs/cond-mat/0309508},
  volume = 69,
  year = 2003
}

@inproceedings{1283494,
  address = {Philadelphia, PA, USA},
  author = {Arthur, David and Vassilvitskii, Sergei},
  booktitle = {SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms},
  interhash = {0be633834158a3c9cba959406c3e1964},
  intrahash = {553bbfa74b13c47b4e9c7c0034a8406e},
  isbn = {978-0-898716-24-5},
  location = {New Orleans, Louisiana},
  pages = {1027--1035},
  publisher = {Society for Industrial and Applied Mathematics},
  title = {k-means++: the advantages of careful seeding},
  year = 2007
}

@inproceedings{conf/sigmod/WangWYY02,
  author = {Wang, Haixun and 0010, Wei Wang and Yang, Jiong and Yu, Philip S.},
  booktitle = {SIGMOD Conference},
  crossref = {conf/sigmod/2002},
  date = {2009-06-28},
  editor = {Franklin, Michael J. and Moon, Bongki and Ailamaki, Anastassia},
  ee = {http://doi.acm.org/10.1145/564691.564737},
  interhash = {9da0e61a2ac3ac371edfb251fbbfc2ae},
  intrahash = {5ad941d8f0a06bb5e570e22a8cc58d92},
  isbn = {1-58113-497-5},
  pages = {394-405},
  publisher = {ACM},
  title = {Clustering by pattern similarity in large data sets.},
  url = {http://dblp.uni-trier.de/db/conf/sigmod/sigmod2002.html#WangWYY02},
  year = 2002
}

@inproceedings{mcqueen1967smc,
  author = {MacQueen, J.},
  booktitle = {Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability - Vol. 1},
  editor = {{Le Cam}, L. M. and Neyman, J.},
  interhash = {8d7d4dfe7d3a06b8c9c3c2bb7aa91e28},
  intrahash = {d23dfdff44ca5121fde221604128ab80},
  pages = {281--297},
  publisher = {University of California Press, Berkeley, CA, USA},
  title = {Some Methods for Classification and Analysis of Multivariate Observations},
  url = {http://projecteuclid.org/euclid.bsmsp/1200512992},
  year = 1967
}

@inproceedings{Ester1996,
  author = {Ester, Martin and Kriegel, Hans-Peter and Sander, J{\"o}rg and Xu, Xiaowei},
  booktitle = {Proc. of 2nd International Conference on Knowledge Discovery and  Data Mining (KDD-96)},
  file = {:KDD96-037.pdf:PDF},
  interhash = {ba33e4d6b4e5b26bd9f543f26b7d250a},
  intrahash = {2f9e50f0a003c4d3067cab2b6fa47fe0},
  pages = {226-231},
  title = {A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise},
  year = 1996
}

@article{brandes2003experiments,
  author = {Brandes, U. and Gaertler, M. and Wagner, D.},
  interhash = {b527c5ab05bac6d10b7768c08fdf7860},
  intrahash = {191613112620e6261271504e5cf992e1},
  journal = {Lecture notes in computer science},
  pages = {568--579},
  publisher = {Springer},
  title = {{Experiments on graph clustering algorithms}},
  url = {http://scholar.google.de/scholar.bib?q=info:gDNQfOoSm6cJ:scholar.google.com/&output=citation&hl=de&ct=citation&cd=2},
  year = 2003
}