GEMvis: a visual analysis method for the comparison and refinement of graph embedding models

被引:11
作者
Chen, Yi [1 ]
Zhang, Qinghui [1 ]
Guan, Zeli [1 ]
Zhao, Ying [2 ]
Chen, Wei [3 ]
机构
[1] Beijing Technol & Business Univ, Beijing Key Lab Big Data Technol Food Safety, Beijing, Peoples R China
[2] Cent South Univ, Sch Comp Sci & Engn, Changsha, Hunan, Peoples R China
[3] Zhejiang Univ, State Key Lab CAD & CG, Hangzhou, Zhejiang, Peoples R China
基金
中国国家自然科学基金;
关键词
Visual analytics; Graph embedding model; Node metric; Evaluation; Comparison; Refinement;
D O I
10.1007/s00371-022-02548-5
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Graph embedding, which constructs vector representation of nodes in a network, has shown effectiveness in many graph analysis tasks, such as node classification, node clustering, and link prediction. However, due to the complexity of graph embedding models (GEMs) and their nontransparency of hyperparameters, evaluation and comparison of embedding results in retaining the original graph features, and consequently, the selection of suitable GEMs according to graph analysis tasks are challenging for people. In this paper, we present a visual analysis method, GEMvis, to support the evaluation and comparison of GEMs from the original graph, node metric, and embedding result spaces. The method also supports the online refining of GEM by tuning the parameters in its three components (graph sampling method, neural network structure, and loss function). A series of metrics, R_node metrics, for measuring GEMs' ability to preserve specific node metrics, such as R_degree and R_closeness, is also proposed to support quantitative evaluation and comparison of GEMs' ability to preserve original graph features. Finally, three case studies and expert feedback illustrate the effectiveness of GEMvis.
引用
收藏
页码:3449 / 3462
页数:14
相关论文
共 34 条
[1]   AYNEC: All You Need for Evaluating Completion Techniques in Knowledge Graphs [J].
Ayala, Daniel ;
Borrego, Agustin ;
Hernandez, Inma ;
Rivero, Carlos R. ;
Ruiz, David .
SEMANTIC WEB, ESWC 2019, 2019, 11503 :397-411
[2]   A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications [J].
Cai, HongYun ;
Zheng, Vincent W. ;
Chang, Kevin Chen-Chuan .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2018, 30 (09) :1616-1637
[3]  
Cao SS, 2016, AAAI CONF ARTIF INTE, P1145
[4]   Structure-Based Suggestive Exploration: A New Approach for Effective Exploration of Large Networks [J].
Chen, Wei ;
Guo, Fangzhou ;
Han, Dongming ;
Pan, Jacheng ;
Nie, Xiaotao ;
Xia, Jiazhi ;
Zhang, Xiaolong .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2019, 25 (01) :555-565
[5]   Ordered matrix representation supporting the visual analysis of associated data [J].
Chen, Yi ;
Lv, Cheng ;
Li, Yue ;
Chen, Wei ;
Ma, Kwan-Liu .
SCIENCE CHINA-INFORMATION SCIENCES, 2020, 63 (08)
[6]   A survey on visualization approaches for exploring association relationships in graph data [J].
Chen, Yi ;
Guan, Zeli ;
Zhang, Rong ;
Du, Xiaomin ;
Wang, Yunhai .
JOURNAL OF VISUALIZATION, 2019, 22 (03) :625-639
[7]   SET OF MEASURES OF CENTRALITY BASED ON BETWEENNESS [J].
FREEMAN, LC .
SOCIOMETRY, 1977, 40 (01) :35-41
[8]   Graph embedding techniques, applications, and performance: A survey [J].
Goyal, Palash ;
Ferrara, Emilio .
KNOWLEDGE-BASED SYSTEMS, 2018, 151 :78-94
[9]   node2vec: Scalable Feature Learning for Networks [J].
Grover, Aditya ;
Leskovec, Jure .
KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, :855-864
[10]  
Hamilton W. L., 2020, Graph representation learning