193 citations · 487 across the 12 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.LG2018★ 2 cited
Latent Geometry Inspired Graph Dissimilarities Enhance Affinity Propagation Community Detection in Complex Networks
Carlo Vittorio Cannistraci, Alessandro Muscoloni
Affinity propagation is one of the most effective unsupervised pattern recognition algorithms for data clustering in high-dimensional feature space. However, the numerous attempts…
physics.soc-ph2018★ 14 cited
Minimum curvilinear automata with similarity attachment for network embedding and link prediction in the hyperbolic space
Alessandro Muscoloni, Carlo Vittorio Cannistraci
The idea of minimum curvilinearity (MC) is that the hidden geometry of complex networks, in particular when they are sufficiently sparse, clustered, small-world and heterogeneous,…