Arthur, D. & Vassilvitskii, S.: k-means++: the advantages of careful seeding.
SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2007, S. 1027-1035
[BibTeX]
Falkowski, T.; Barth, A. & Spiliopoulou, M.: DENGRAPH: A Density-based Community Detection Algorithm.
In Proc. of the 2007 IEEE / WIC / ACM International Conference on Web Intelligence,. 2007, S. 112-115
[Volltext]
[BibTeX]
Brandes, U.; Gaertler, M. & Wagner, D.: Experiments on graph clustering algorithms. In:
Lecture notes in computer science (2003), S. 568-579
[Volltext]
[BibTeX]
Newman, M. E. J.:
The structure and function of complex networks. , 2003
[Volltext] [Kurzfassung]
[BibTeX]
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.
Newman, M.: Fast algorithm for detecting community structure in networks. In:
Physical Review E 69 (2003),
[Volltext]
[BibTeX]
Newman, M.: Fast algorithm for detecting community structure in networks. In:
Physical Review E 69 (2003),
[Volltext]
[BibTeX]
Wang, H.; 0010, W. W.; Yang, J. & Yu, P. S.: Clustering by pattern similarity in large data sets.. In: Franklin, M. J.; Moon, B. & Ailamaki, A. (Hrsg.):
SIGMOD Conference. ACM, 2002, S. 394-405
[Volltext]
[BibTeX]
Robardet, C. & Feschet, F.: A New Methodology to Compare Clustering Algorithms.
IDEAL '00: Proceedings of the Second International Conference on Intelligent Data Engineering and Automated Learning, Data Mining, Financial Engineering, and Intelligent Agents. London, UK: Springer-Verlag, 2000, S. 565-570
[BibTeX]
Ester, M.; Kriegel, H.-P.; Sander, Jö. & Xu, X.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise.
Proc. of 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96). 1996, S. 226-231
[BibTeX]
MacQueen, J.: Some Methods for Classification and Analysis of Multivariate Observations. In: Le Cam, L. M. & Neyman, J. (Hrsg.):
Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability - Vol. 1. University of California Press, Berkeley, CA, USA, 1967, S. 281-297
[Volltext]
[BibTeX]