1. 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
2. Baeza-Yates R, Ribeiro-Neto B (1999) Modern information retrieval. Addison-Wesley
3. Blei DM, Ng AY, Jordan MI, Lafferty J (2003) Latent dirichlet allocation. J Machine Learn Res 3
4. Cucchiarelli A, D’Antonio F, Navigli R, Velardi P (2009) Semantically interconnected social networks. TKDD (submitted)
5. Finin T, Ding L, Zhou L, Joshi A (2005) Social networking on the semantic web. Learn Organ 12(5):418–435