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
ASCOS: an asymmetric network structure context similarity measure, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp.442-449, 2013. ,
Unsupervised extremely randomized trees, Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp.478-489, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01667317
, A cluster algorithm for graphs, 2000.
On random graphs I, Publ. Math. Debrecen, vol.6, pp.290-297, 1959. ,
SimRank: a measure of structural-context similarity, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pp.538-543, 2002. ,
Graph evolution: Densification and shrinking diameters, ACM Transactions on Knowledge Discovery from Data (TKDD), vol.1, issue.1, 2007. ,
Visualizing data using t-SNE, Journal of machine learning research, vol.9, pp.2579-2605, 2008. ,
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
Graph clustering, Computer science review, vol.1, issue.1, pp.27-64, 2007. ,
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. ,
Local higher-order graph clustering, Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.555-564, 2017. ,