Machine learning meets network science: dimensionality reduction for fast and efficient embedding of networks in the hyperbolic space
Complex network topologies and hyperbolic geometry seem specularly connected, and one of the most fascinating and challenging problems of recent complex network theory is to map a given network to its hyperbolic space. The Popularity Similarity Optimization (PSO) model represents - at the moment - the climax of this theory. It suggests that the trade-off between node popularity and similarity is a mechanism to explain how complex network topologies emerge - as discrete samples - from the continuous world of hyperbolic geometry. The hyperbolic space seems appropriate to represent real complex networks. In fact, it preserves many of their fundamental topological properties, and can be exploited for real applications such as, among others, link prediction and community detection. Here, we observe for the first time that a topological-based machine learning class of algorithms - for nonlinear unsupervised dimensionality reduction - can directly approximate the network's node angular coordinates of the hyperbolic model into a two-dimensional space, according to a similar topological organization that we named angular coalescence. On the basis of this phenomenon, we propose a new class of algorithms that offers fast and accurate coalescent embedding of networks in the hyperbolic space even for graphs with thousands of nodes.
Code (0)
등록된 구현이 없습니다.
Tasks
Community DetectionDimensionality ReductionLink PredictionSimilar Papers 제목 키워드 기반
Non-Volatile Memory Accelerated Geometric Multi-Scale Resolution Analysis
Dimensionality reduction algorithms are standard tools in a researcher's toolbox. Dimensionality reduction algorithms are frequently used to augment downstream tasks such as machine learning, data science, and also are e…
Dimensionality ReductionSemi-Supervised Graph Learning Meets Dimensionality Reduction
Semi-supervised learning (SSL) has recently received increased attention from machine learning researchers. By enabling effective propagation of known labels in graph-based deep learning (GDL) algorithms, SSL is poised t…
ClusteringDimensionality ReductionGraph LearningNode ClusteringScalable semi-supervised dimensionality reduction with GPU-accelerated EmbedSOM
Dimensionality reduction methods have found vast application as visualization tools in diverse areas of science. Although many different methods exist, their performance is often insufficient for providing quick insight …
Data VisualizationDimensionality ReductionGPUSupervised dimensionality reductionEnsembles of Classifiers based on Dimensionality Reduction
We present a novel approach for the construction of ensemble classifiers based on dimensionality reduction. Dimensionality reduction methods represent datasets using a small number of attributes while preserving the info…
Dimensionality ReductionDimensionality Reduction on Riemannian Manifolds in Data Analysis
In this work, we investigate Riemannian geometry based dimensionality reduction methods that respect the underlying manifold structure of the data. In particular, we focus on Principal Geodesic Analysis (PGA) as a nonlin…
Dimensionality Reduction