Umeå University's logo

umu.sePublikasjoner
Endre søk
Link to record
Permanent link

Direct link
Publikasjoner (6 av 6) Visa alla publikasjoner
Blöcker, C., Smiljanic, J., Scholtes, I. & Rosvall, M. (2022). Similarity-based link prediction from modular compression of network flows. In: Proceedings of the First Learning on Graphs Conference: . Paper presented at LOG 2022, 1st Learning on Graphs Conference, Virtual, December9-12, 2022 (pp. 52:1-52:18). ML Research Press
Åpne denne publikasjonen i ny fane eller vindu >>Similarity-based link prediction from modular compression of network flows
2022 (engelsk)Inngår i: Proceedings of the First Learning on Graphs Conference, ML Research Press , 2022, s. 52:1-52:18Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Node similarity scores are a foundation for machine learning in graphs for clustering, node classification, anomaly detection, and link prediction with applications in biological systems, information networks, and recommender systems. Recent works on link prediction use vector space embeddings to calculate node similarities in undirected networks with good performance. Still, they have several disadvantages: limited interpretability, need for hyperparameter tuning, manual model fitting through dimensionality reduction, and poor performance from symmetric similarities in directed link prediction. We propose MapSim, an information-theoretic measure to assess node similarities based on modular compression of network flows. Unlike vector space embeddings, MapSim represents nodes in a discrete, non-metric space of communities and yields asymmetric similarities in an unsupervised fashion. We compare MapSim on a link prediction task to popular embedding-based algorithms across 47 networks and find that MapSim's average performance across all networks is more than 7% higher than its closest competitor, outperforming all embedding methods in 11 of the 47 networks. Our method demonstrates the potential of compression-based approaches in graph representation learning, with promising applications in other graph learning tasks.

sted, utgiver, år, opplag, sider
ML Research Press, 2022
Serie
Proceedings of Machine Learning Research, E-ISSN 2640-3498 ; 198
HSV kategori
Identifikatorer
urn:nbn:se:umu:diva-212276 (URN)2-s2.0-85164537856 (Scopus ID)
Konferanse
LOG 2022, 1st Learning on Graphs Conference, Virtual, December9-12, 2022
Forskningsfinansiär
Wallenberg AI, Autonomous Systems and Software Program (WASP)Knut and Alice Wallenberg FoundationSwedish Research Council, 2016-00796
Tilgjengelig fra: 2023-07-20 Laget: 2023-07-20 Sist oppdatert: 2023-07-20bibliografisk kontrollert
Vranić, A., Smiljanic, J. & Dankulov, M. M. (2022). Universal growth of social groups: empirical analysis and modeling. Journal of Statistical Mechanics: Theory and Experiment, 2022(12), Article ID 123402.
Åpne denne publikasjonen i ny fane eller vindu >>Universal growth of social groups: empirical analysis and modeling
2022 (engelsk)Inngår i: Journal of Statistical Mechanics: Theory and Experiment, ISSN 1742-5468, E-ISSN 1742-5468, Vol. 2022, nr 12, artikkel-id 123402Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

Social groups are fundamental elements of any social system. Their emergence and evolution are closely related to the structure and dynamics of a social system. Research on social groups was primarily focused on the growth and the structure of the interaction networks of social system members and how members’ group affiliation influences the evolution of these networks. The distribution of groups’ size and how members join groups has not been investigated in detail. Here we combine statistical physics and complex network theory tools to analyze the distribution of group sizes in three data sets, Meetup groups based in London and New York and Reddit. We show that all three distributions exhibit log-normal behavior that indicates universal growth patterns in these systems. We propose a theoretical model that combines social and random diffusion of members between groups to simulate the roles of social interactions and members’ interest in the growth of social groups. The simulation results show that our model reproduces growth patterns observed in empirical data. Moreover, our analysis shows that social interactions are more critical for the diffusion of members in online groups, such as Reddit, than in offline groups, such as Meetup. This work shows that social groups follow universal growth mechanisms that need to be considered in modeling the evolution of social systems.

sted, utgiver, år, opplag, sider
Institute of Physics (IOP), 2022
Emneord
network dynamics, random graphs, networks, scaling in socio-economic systems, stochastic processes
HSV kategori
Identifikatorer
urn:nbn:se:umu:diva-201954 (URN)10.1088/1742-5468/aca0e9 (DOI)000894090400001 ()2-s2.0-85143908186 (Scopus ID)
Tilgjengelig fra: 2022-12-28 Laget: 2022-12-28 Sist oppdatert: 2022-12-28bibliografisk kontrollert
Smiljanic, J., Blöcker, C., Edler, D. & Rosvall, M. (2021). Mapping flows on weighted and directed networks with incomplete observations. Journal of Complex Networks, 9(6), Article ID cnab044.
Åpne denne publikasjonen i ny fane eller vindu >>Mapping flows on weighted and directed networks with incomplete observations
2021 (engelsk)Inngår i: Journal of Complex Networks, ISSN 2051-1310, E-ISSN 2051-1329, Vol. 9, nr 6, artikkel-id cnab044Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

Detecting significant community structure in networks with incomplete observations is challenging because the evidence for specific solutions fades away with missing data. For example, recent research shows that flow-based community detection methods can highlight spurious communities in sparse undirected and unweighted networks with missing links. Current Bayesian approaches developed to overcome this problem do not work for incomplete observations in weighted and directed networks that describe network flows. To overcome this gap, we extend the idea behind the Bayesian estimate of the map equation for unweighted and undirected networks to enable more robust community detection in weighted and directed networks. We derive an empirical Bayes estimate of the transitions rates that can incorporate metadata information and show how an efficient implementation in the community-detection method Infomap provides more reliable communities even with a significant fraction of data missing.

sted, utgiver, år, opplag, sider
Oxford University Press, 2021
Emneord
community detection, directed and weighted networks, incomplete data, the map equation
HSV kategori
Identifikatorer
urn:nbn:se:umu:diva-194470 (URN)10.1093/comnet/cnab044 (DOI)000797304300006 ()2-s2.0-85128774619 (Scopus ID)
Forskningsfinansiär
Wallenberg AI, Autonomous Systems and Software Program (WASP)Knut and Alice Wallenberg FoundationSwedish Research Council, 2016-00796
Merknad

Errata: "Correction to “Mapping flows on weighted and directed networks with incomplete observations”, Journal of Complex Networks, Volume 10, Issue 2, April 2022, cnac010, https://doi.org/10.1093/comnet/cnac010"

Tilgjengelig fra: 2022-05-06 Laget: 2022-05-06 Sist oppdatert: 2022-12-08bibliografisk kontrollert
Smiljanic, J., Edler, D. & Rosvall, M. (2020). Mapping flows on sparse networks with missing links. Physical review. E, 102(1), Article ID 012302.
Åpne denne publikasjonen i ny fane eller vindu >>Mapping flows on sparse networks with missing links
2020 (engelsk)Inngår i: Physical review. E, ISSN 2470-0045, E-ISSN 2470-0053, Vol. 102, nr 1, artikkel-id 012302Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

Unreliable network data can cause community-detection methods to overfit and highlight spurious structures with misleading information about the organization and function of complex systems. Here we show how to detect significant flow-based communities in sparse networks with missing links using the map equation. Since the map equation builds on Shannon entropy estimation, it assumes complete data such that analyzing undersampled networks can lead to overfitting. To overcome this problem, we incorporate a Bayesian approach with assumptions about network uncertainties into the map equation framework. Results in both synthetic and real-world networks show that the Bayesian estimate of the map equation provides a principled approach to revealing significant structures in undersampled networks.

sted, utgiver, år, opplag, sider
American Physical Society, 2020
HSV kategori
Identifikatorer
urn:nbn:se:umu:diva-173895 (URN)10.1103/PhysRevE.102.012302 (DOI)000550381200011 ()2-s2.0-85089465455 (Scopus ID)
Forskningsfinansiär
Swedish Research Council, 2016-00796
Tilgjengelig fra: 2020-08-06 Laget: 2020-08-06 Sist oppdatert: 2023-03-24bibliografisk kontrollert
Blöcker, C., Smiljanic, J., Scholtes, I. & Rosvall, M.Similarity-based Link Prediction from Modular Compression of Network Flows.
Åpne denne publikasjonen i ny fane eller vindu >>Similarity-based Link Prediction from Modular Compression of Network Flows
(engelsk)Manuskript (preprint) (Annet vitenskapelig)
Abstract [en]

Node similarity scores constitute a foundation for machine learning in graphs. Besides clustering, node classification, and anomaly detection, they are a basis for link prediction with critical applications in biological systems, information networks, and recommender systems. Recent works on link prediction use vector space embeddings to calculate node similarities. While these methods can provide good performance in undirected networks, they have several disadvantages: limited interpretability, problem-specific hyperparameter tuning, manual model fitting through dimensionality reduction, and poor performance of symmetric similarities in directed link prediction. To address these issues, we propose MapSim, a novel information-theoretic approach to assess node similarities based on modular compression of network flows. Different from vector space embeddings, MapSim represents nodes in a discrete, non-metric space of communities and yields asymmetric similarities suitable to predict directed and undirected links in an unsupervised fashion. The resulting similarities can be explained based on a network's hierarchical modular organisation, facilitating interpretability. MapSim naturally accounts for Occam's razor, leading to parsimonious representations of clusters at multiple scales. Addressing unsupervised link prediction, we compare MapSim to popular embedding-based algorithms across 47 data sets of networks from a few hundred to hundreds of thousands of nodes and millions of links. Our analysis shows that MapSim's average performance across all networks is more than 7% higher than its closest competitor, outperforming all embedding methods in 14 of the 47 networks, and a more than 33% better worst-case performance. Our method demonstrates the potential of compression-based approaches in graph representation learning, with promising applications in other graph learning tasks.

Emneord
machine learning, network analysis, graph learning, representation learning, link prediction, minimum description length
HSV kategori
Identifikatorer
urn:nbn:se:umu:diva-199604 (URN)
Tilgjengelig fra: 2022-09-22 Laget: 2022-09-22 Sist oppdatert: 2022-09-27
Edler, D., Smiljanić, J., Holmgren, A., Antonelli, A. & Rosvall, M.Variable Markov dynamics as a multifocal lens to map multiscale complex networks.
Åpne denne publikasjonen i ny fane eller vindu >>Variable Markov dynamics as a multifocal lens to map multiscale complex networks
Vise andre…
(engelsk)Manuskript (preprint) (Annet vitenskapelig)
Emneord
network science, community detection, Infomap
HSV kategori
Identifikatorer
urn:nbn:se:umu:diva-201174 (URN)
Tilgjengelig fra: 2022-11-22 Laget: 2022-11-22 Sist oppdatert: 2022-11-23
Organisasjoner
Identifikatorer
ORCID-id: ORCID iD iconorcid.org/0000-0003-0124-1909