.png){kind=icon}
返回
A Hyperbolic Embedding Method for Weighted Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TNSE.2020.3046746.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Network embedding, which is the task of learning low-dimensional representations of vertices, has attracted increasing attention recently. Evidences have been found that the hidden metric space of many realistic complex networks is hyperbolic. The topology and weight emerge naturally as reflections of the hyperbolic metric property. A common objective of hyperbolic embedding is to maximize the likelihood function of the hyperbolic network model. The difficulty is that the likelihood function is non-concave which is difficult to optimize. In this paper, we propose a hyperbolic embedding method for weighted networks. To prevent the optimization from falling into numerous local optima, initial embedding is obtained by approximation. A proposed gradient algorithm then improves the embedding according to the likelihood function. Experiments on synthetic and real networks show that the proposed method achieves good embedding performance with respect to different quality metrics and applications.
Keyword:
Measurement
Geometry
Complex networks
Approximation algorithms
Topology
Task analysis
Probability density function
Hyperbolic space
network embedding
weighted complex network
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
7.9
论文数:
2.6K
被引数:
10.0K
机构
引用论文
.png){kind=icon}
Insurance activity and economic performance: Fresh evidence from asymmetric panel causality tests
OAAI
OAAI分享收藏A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications图嵌入的综合调查: 问题，技术和应用OAAI
OAAI分享收藏
查看更多内容