.png){kind=icon}
返回
Sampling informative context nodes for network embedding
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-019-2635-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Several modern network embedding methods learn vector representations from sampled context nodes. The sampling strategies are often carefully designed and controlled by specific parameters that enable them to adapt to different networks. However, the following fundamental question remains: what is the key factor that causes some sampling context results to yield better vectors than others on a certain network? We attempted to answer the question from the perspective of information theory. First, we defined the weighted entropy of the sampled context matrix, which denotes the amount of information it takes. We discovered that context matrices with higher weighted entropy generally produce better vectors. Second, we proposed maximum weighted entropy sampling methods for sampling more informative context nodes; thus, it can be used to produce more informative vectors. Herein, the results of the extensive experiments on the link prediction and node classification tasks confirm the effectiveness of the proposed methods.
Keyword:
network embedding
representation learning
random walk
entropy
weighted entropy
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
引用论文
.png){kind=icon}
A Feature-Reduction Fuzzy Clustering Algorithm Based on Feature-Weighted Entropy一种基于特征加权熵的特征约简模糊聚类算法
PREAI
分享收藏Insurance activity and economic performance: Fresh evidence from asymmetric panel causality tests
OAAI
OAAI分享收藏Passive signal propagation and membrane properties in median photoreceptors of the giant barnacleOAAI
OAAI分享收藏
查看更多内容