Author:
Kovács Bianka,Kojaku Sadamori,Palla Gergely,Fortunato Santo
Abstract
AbstractGraph embeddings learn the structure of networks and represent it in low-dimensional vector spaces. Community structure is one of the features that are recognized and reproduced by embeddings. We show that an iterative procedure, in which a graph is repeatedly embedded and its links are reweighted based on the geometric proximity between the nodes, reinforces intra-community links and weakens inter-community links, making the clusters of the initial network more visible and more easily detectable. The geometric separation between the communities can become so strong that even a very simple parsing of the links may recover the communities as isolated components with surprisingly high precision. Furthermore, when used as a pre-processing step, our embedding and reweighting procedure can improve the performance of traditional community detection algorithms.
Publisher
Springer Science and Business Media LLC
Reference79 articles.
1. Lü, L. & Zhou, T. Link prediction in complex networks: A survey. Phys. A Stat. Mech. Appl. 390, 1150–1170. https://doi.org/10.1016/j.physa.2010.11.027 (2011).
2. Chen, H. et al. PME: Projected metric embedding on heterogeneous networks for link prediction. In Proceedings of the 24th ACM SIGKDD International Conference on KDD, KDD ’18, 1177–1186 (Association for Computing Machinery, New York, NY, USA, 2018).
3. Kunegis, J. & Lommatzsch, A. Learning spectral graph transformations for link prediction. In Proceedings of the 26th Annual International Conference on Machine Learning, ICML ’09, 561–568 (Association for Computing Machinery, New York, NY, USA, 2009).
4. Masrour, F., Wilson, T., Yan, H., Tan, P.-N. & Esfahanian, A. Bursting the filter bubble: Fairness-aware network link prediction. Proc. AAAI Conf. Artif. Intell. 34, 841–848 (2020).
5. Bhagat, S., Cormode, G. & Muthukrishnan, S. Node classification in social networks. In Soc. Netw. Data Anal. (ed. Aggarwal, C. C.) 115–148 (Springer, 2011). https://doi.org/10.1007/978-1-4419-8462-3_5.