V. D. Blondel, J. L. Guillaume, R. Lambiotte, and E. Lefebvre, Fast unfolding of communities in large networks, Journal of statistical mechanics: theory and experiment, issue.10, p.10008, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01146070

A. Bojchevski and S. Günnemann, Bayesian Robust Attributed Graph Clustering: Joint Learning of Partial Anomalies and Group Structure, 2018.

H. Cheng, Y. Zhou, and J. X. Yu, Clustering large attributed graphs: A balance between structural and attribute similarities, ACM Transactions on Knowledge Discovery from Data (TKDD), vol.5, issue.2, p.12, 2011.

D. Combe, C. Largeron, E. Egyed-zsigmond, and M. Géry, Combining relations and text in scientific network clustering, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp.1248-1253, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00730226

D. Combe, C. Largeron, M. Géry, and E. Egyed-zsigmond, I-louvain: An attributed graph clustering method, International Symposium on Intelligent Data Analysis, pp.181-192, 2015.
URL : https://hal.archives-ouvertes.fr/ujm-01219447

J. D. Cruz, C. Bothorel, and F. Poulet, Entropy based community detection in augmented social networks, 2011 International Conference on computational aspects of social networks (CASoN), pp.163-168, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00640722

K. Dalleau, M. Couceiro, and M. Smail-tabbone, Unsupervised extremely randomized trees, pp.478-489, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01667317

S. Dongen, A cluster algorithm for graphs, 2000.

L. Ehrlinger and W. Wöss, Towards a Definition of Knowledge Graphs, SEMAN-TiCS, 2016.

P. Erd\hos and A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci, vol.5, issue.1, pp.17-60, 1960.

M. Fan, K. Cao, Y. He, and R. Grishman, Jointly Embedding Relations and Mentions for Knowledge Population, Proceedings of the International Conference Recent Advances in Natural Language Processing, pp.186-191, 2015.

M. Girvan and M. E. Newman, Community structure in social and biological networks, Proceedings of the National Academy of Sciences, vol.99, issue.12, pp.7821-7826, 2002.

A. Grover and J. Leskovec, node2vec: Scalable feature learning for networks, Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining, pp.855-864, 2016.

X. Huang, J. Li, and X. Hu, Accelerated attributed network embedding, Proceedings of the 2017 SIAM international conference on data mining, pp.633-641, 2017.

D. R. Karger, Global Min-cuts in RNC, and Other Ramifications of a Simple Min-Cut Algorithm, In: SODA, vol.93, pp.21-30, 1993.

V. Krebs, Political books network. Unpublished, retrieved from Mark Newman's website: www-personal, 2004.

A. Lancichinetti and S. Fortunato, Limits of modularity maximization in community detection, Physical review E, vol.84, issue.6, p.66122, 2011.

J. Leskovec, J. Kleinberg, and C. Faloutsos, Graph evolution: Densification and shrinking diameters, ACM Transactions on Knowledge Discovery from Data (TKDD), vol.1, issue.1, 2007.

L. V. Maaten and G. Hinton, Visualizing data using t-SNE, Journal of machine learning research, vol.9, pp.2579-2605, 2008.

J. Neville, M. Adler, and D. Jensen, Clustering relational data using attribute and link information, Proceedings of the text mining and link analysis workshop, 18th international joint conference on artificial intelligence, pp.9-15, 2003.

M. E. Newman, Modularity and community structure in networks, Proceedings of the national academy of sciences 103, pp.8577-8582, 2006.

F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion et al., Scikit-learn: Machine learning in Python, Journal of machine learning research, vol.12, pp.2825-2830, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00650905

B. Perozzi, R. Al-rfou, and S. Skiena, Deepwalk: Online learning of social representations, Proceedings of the 20th ACM SIGKDD International conference on Knowledge discovery and data mining, pp.701-710, 2014.

S. E. Schaeffer, Graph clustering, Computer science review, vol.1, issue.1, pp.27-64, 2007.

J. Shi and J. Malik, Normalized cuts and image segmentation, IEEE Transactions, vol.22, issue.8, pp.888-905, 2000.

B. Stein and O. Niggemann, On the nature of structure and its identification, International Workshop on Graph-Theoretic Concepts in Computer Science, pp.122-134, 1999.

K. Steinhaeuser and N. V. Chawla, Community detection in a large real-world social network, Social computing, behavioral modeling, and prediction, pp.168-175

. Springer, , 2008.

K. M. Ting, Y. Zhu, M. Carman, Y. Zhu, and Z. H. Zhou, Overcoming key weaknesses of distance-based neighbourhood methods using a data dependent dissimilarity measure, Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp.1205-1214, 2016.

Z. Xu, Y. Ke, Y. Wang, H. Cheng, and J. Cheng, A model-based approach to attributed graph clustering, Proceedings of the 2012 ACM SIGMOD international conference on management of data, pp.505-516, 2012.

Z. Yang, J. Tang, and W. Cohen, Multi-modal bayesian embeddings for learning social knowledge graphs, 2015.

H. Yin, A. R. Benson, J. Leskovec, and D. F. Gleich, Local higher-order graph clustering, Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.555-564, 2017.

Y. Zhou, H. Cheng, and J. X. Yu, Graph Clustering Based on Structural/Attribute Similarities, Proceedings of VLDB Endow, vol.2, pp.718-729, 2009.

Y. Zhou, H. Cheng, and J. X. Yu, Clustering large attributed graphs: An efficient incremental approach, 2010 IEEE International Conference on Data Mining, pp.689-698, 2010.