Node proximity preserved dynamic network embedding via matrix perturbation

2020 ◽  
Vol 196 ◽  
pp. 105822
Author(s):  
Bin Yu ◽  
Bing Lu ◽  
Chen Zhang ◽  
Chunyi Li ◽  
Ke Pan
Author(s):  
Maoguo Gong ◽  
Shunfei Ji ◽  
Yu Xie ◽  
Yuan Gao ◽  
A. K. Qin

Author(s):  
Chao Kong ◽  
Baoxiang Chen ◽  
Shaoying Li ◽  
Qi Zhou ◽  
Dongfang Wang ◽  
...  

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 29219-29230 ◽  
Author(s):  
Taisong Li ◽  
Jiawei Zhang ◽  
Philip S. Yu ◽  
Yan Zhang ◽  
Yonghong Yan

2021 ◽  
pp. 426-437
Author(s):  
Yifan Song ◽  
Darong Lai ◽  
Zhihong Chong ◽  
Zeyuan Pan

Author(s):  
Yu Han ◽  
Jie Tang ◽  
Qian Chen

Network embedding has been extensively studied in recent years. In addition to the works on static networks, some researchers try to propose new models for evolving networks. However, sometimes most of these dynamic network embedding models are still not in line with the actual situation, since these models have a strong assumption that we can achieve all the changes in the whole network, while in fact we cannot do this in some real world networks, such as the web networks and some large social networks. So in this paper, we study a novel and challenging problem, i.e., network embedding under partial monitoring for evolving networks. We propose a model on dynamic networks in which we cannot perceive all the changes of the structure. We analyze our model theoretically, and give a bound to the error between the results of our model and the potential optimal cases. We evaluate the performance of our model from two aspects. The experimental results on real world datasets show that our model outperforms the baseline models by a large margin.


2021 ◽  
Author(s):  
Guotong Xue ◽  
Ming Zhong ◽  
Jianxin Li ◽  
Jia Chen ◽  
Chengshuai Zhai ◽  
...  

Author(s):  
Chengbin Hou ◽  
Ke Tang

Dynamic Network Embedding (DNE) has recently drawn much attention due to the dynamic nature of many real-world networks. Comparing to a static network, a dynamic network has a unique character called the degree of changes, which can be defined as the average number of the changed edges between consecutive snapshots spanning a dynamic network. The degree of changes could be quite different even for the dynamic networks generated from the same dataset. It is natural to ask whether existing DNE methods are effective and robust w.r.t. the degree of changes. Towards robust DNE, we suggest two important scenarios. One is to investigate the robustness w.r.t. different slicing settings that are used to generate different dynamic networks with different degree of changes, while another focuses more on the robustness w.r.t. different number of changed edges over timesteps.


Sign in / Sign up

Export Citation Format

Share Document