V. Estivill-castro, Why so many clustering algorithms, ACM SIGKDD Explorations Newsletter, vol.4, issue.1, pp.65-75, 2002.
DOI : 10.1145/568574.568575

P. S. Lloyd and . Bell, Least squares quantization in PCM, IEEE Transactions on Information Theory, vol.28, issue.2, pp.129-137, 1982.
DOI : 10.1109/TIT.1982.1056489

M. Ester, H. P. Kriegel, J. Sander, and X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), pp.226-231, 1996.

M. Ankerst, M. M. Breunig, H. P. Kriegel, and J. Sander, OPTICS: Ordering Points to Identify the Clustering Structure, Proceedings of the 1999 ACM SIGMOD international conference on Management of data, pp.49-60, 1999.

A. Nanopoulos, Y. Theodoridis, and Y. Manolopoulos, C2P: clustering based on closest pairs, Proceedings of the International Conference on Very Large Databases, pp.331-340, 2001.

A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos, Algorithms for processing K-closest-pair queries in spatial databases, Data & Knowledge Engineering, vol.49, issue.1, pp.67-104, 2004.
DOI : 10.1016/j.datak.2003.08.007

L. Rokach and M. Oded, Clustering methods. Data mining and knowledge discovery handbook, pp.321-352, 2005.

. Sas-institute-inc, The CLUSTER Procedure: Clustering Methods, SAS/STAT 9.2 Users Guide, 2009.

R. Sibson, SLINK: An optimally efficient algorithm for the single-link cluster method, The Computer Journal, vol.16, issue.1, pp.30-34, 1973.
DOI : 10.1093/comjnl/16.1.30

D. Defays, An efficient algorithm for a complete link method, The Computer Journal, vol.20, issue.4, pp.364-366, 1977.
DOI : 10.1093/comjnl/20.4.364

D. Eppstein, Fast hierarchical clustering and other applications of dynamic closest pairs, Proc. Symposium on Discrete Algorithms (SODA'98, 1998.
DOI : 10.1145/351827.351829