Arthur, D. & Vassilvitskii, S. (2007), k-means++: the advantages of careful seeding, in 'SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms' , Society for Industrial and Applied Mathematics, Philadelphia, PA, USA , pp. 1027--1035 .
[BibTeX] [Endnote]

Falkowski, T.; Barth, A. & Spiliopoulou, M. (2007), DENGRAPH: A Density-based Community Detection Algorithm, in 'In Proc. of the 2007 IEEE / WIC / ACM International Conference on Web Intelligence,' , pp. 112-115 .
[BibTeX] [Endnote]

Brandes, U.; Gaertler, M. & Wagner, D. (2003), 'Experiments on graph clustering algorithms', Lecture notes in computer science , 568--579 .
[BibTeX] [Endnote]

Newman, M. E. J. (2003), 'The structure and function of complex networks' .
[BibTeX] [Endnote]

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. (2003), 'Fast algorithm for detecting community structure in networks', Physical Review E 69 .
[BibTeX] [Endnote]

2002

Wang, H.; 0010, W. W.; Yang, J. & Yu, P. S. (2002), Clustering by pattern similarity in large data sets., in Michael J. Franklin; Bongki Moon & Anastassia Ailamaki, ed., 'SIGMOD Conference' , ACM, , pp. 394-405 .
[BibTeX] [Endnote]

2000

Robardet, C. & Feschet, F. (2000), A New Methodology to Compare Clustering Algorithms, in 'IDEAL '00: Proceedings of the Second International Conference on Intelligent Data Engineering and Automated Learning, Data Mining, Financial Engineering, and Intelligent Agents' , Springer-Verlag, London, UK , pp. 565--570 .
[BibTeX] [Endnote]

1996

Ester, M.; Kriegel, H.-P.; Sander, Jö. & Xu, X. (1996), A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise, in 'Proc. of 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96)' , pp. 226-231 .
[BibTeX] [Endnote]

1967

MacQueen, J. (1967), Some Methods for Classification and Analysis of Multivariate Observations, in L. M. Le Cam & J. Neyman, ed., 'Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability - Vol. 1' , University of California Press, Berkeley, CA, USA, , pp. 281--297 .
[BibTeX] [Endnote]