193 citations · 487 across the 12 of their papers we have counts for
3 papers · 1 filter
Nonlinear Markov Clustering by Minimum Curvilinear Sparse Similarity
C. Duran, A. Acevedo, S. Ciucci +2
The development of algorithms for unsupervised pattern recognition by nonlinear clustering is a notable problem in data science. Markov clustering (MCL) is a renowned algorithm tha…
Angular separability of data clusters or network communities in geometrical space and its relevance to hyperbolic embedding
Alessandro Muscoloni, Carlo Vittorio Cannistraci
Analysis of 'big data' characterized by high-dimensionality such as word vectors and complex networks requires often their representation in a geometrical space by embedding. Recen…
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…