Sampling informative context nodes for network embedding  

作　　者：Danhao ZHU Xin-Yu DAI Jiajun CHEN Jie YIN 

机构地区：[1]Department of Computer Science and Technology,Nanjing University,Nanjing 210031,China [2]厶ibrary,Jiangsu Police Institute,Nanjing 210093,China

出　　处：《Science China(Information Sciences)》2021年第11期116-126,共11页中国科学（信息科学）（英文版）

基　　金：supported in part by Social Science Foundation of the Jiangsu Higher Education Institutions of China(Grant No.2018SJA0455);National Nature Science Foundation of China(Grant No.61472183);Social Science Foundation of Jiangsu Province(Grant No.19TQD002)。

摘　　要：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.

关 键 词：network embedding representation learning random walk ENTROPY weighted entropy 

分 类 号：O157.5[理学—数学]