R. Feldman and J. Sanger, The text mining handbook. Beijing [M]: posts & telecom press, pp.82-92, 2009.
DOI : 10.1017/cbo9780511546914

C. Aggarwal and C. Zhai, A Survey of Text Clustering Algorithms, pp.77-128
DOI : 10.1007/978-1-4614-3223-4_4

D. Cutting, D. Karger, J. Pedersen, and . Scatter, Scatter/Gather: a cluster-based approach to browsing large document collections, Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval , SIGIR '92, 1992.
DOI : 10.1145/133160.133214

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

A. Likas, N. Vlassis, and J. Jakob, The global k-means clustering algorithm, Pattern Recognition, vol.36, issue.2, pp.451-461, 2003.
DOI : 10.1016/S0031-3203(02)00060-2

URL : https://hal.archives-ouvertes.fr/inria-00321515

D. Arthur and S. Vassilvitskii, K-means++: the advantages of careful seeding, ACM- SIAM Symposium, 2007.

T. Onoda, M. Sakai, and S. Yamada, Independent Component Analysis based Seeding method for k-means Clustering, 2011.
DOI : 10.1109/wi-iat.2011.29

P. Tan, M. Steinbach, and V. Kumar, Introduction to Data Mining [M]: posts & telecom press, pp.385-387, 2011.

R. F. Cancho and R. Sole, The small world of human language, Proceedings of the Royal Society B: Biological Sciences, vol.268, issue.1482, pp.268-2261, 1482.
DOI : 10.1098/rspb.2001.1800

D. J. Wars and . S. Strogatz, Collective dynamics of small-world networks, pp.440-442, 1998393.

M. J. Thomas and M. R. Edward, Graph Drawing by Force-directed Placement [J]. Software: Practice and Experience, pp.1129-1164, 1991.