Finding Key Structures in MMORPG Graph with Hierarchical Graph Summarization

被引:1
作者
Jang, Jun-Gi [1 ]
Park, Chaeheum [2 ]
Jang, Changwon [3 ]
Kim, Geonsoo [3 ]
Kang, U. [1 ]
机构
[1] Seoul Natl Univ, Comp Sci & Engn, 1 Gwanak Ro, Seoul 08826, South Korea
[2] Deeping Source, 508 Eonju Ro, Seoul 06152, South Korea
[3] NCSOFT Co, 12,Daewangpangyo Ro 644 Beon Gil, Seongnam Si 13494, Gyeonggi Do, South Korea
关键词
Graph summarization; minimum description length; hierarchical label; massively multiplayer online role-playing game;
D O I
10.1145/3522691
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
What are the key structures existing in a large real-world MMORPG (Massively Multiplayer Online Role-Playing Game) graph? How can we compactly summarize an MMORPG graph with hierarchical node labels, considering substructures at different levels of hierarchy? Recent MMORPGs generate complex interactions between entities inducing a heterogeneous graph where each entity has hierarchical labels. Succinctly summarizing a heterogeneous MMORPG graph is crucial to better understand its structure; however it is a challenging task since it needs to handle complex interactions and hierarchical labels efficiently. Although there exist few methods to summarize a large-scale graph, they do not deal with heterogeneous graphs with hierarchical node labels. We propose GSHL, a novel method that summarizes a heterogeneous graph with hierarchical labels. We formulate the encoding cost of hierarchical labels using MDL (Minimum Description Length). GSHL exploits the formulation to identify and segment subgraphs, and discovers compact and consistent structures in the graph. Experiments on a large real-world MMORPG graph with multi-million edges show that GSHL is a useful and scalable tool for summarizing the graph, finding important structures in the graph, and finding similar users.
引用
收藏
页数:21
相关论文
共 26 条
[11]  
Koutra D., 2014, P 2014 SIAM INT C DA, P91, DOI DOI 10.1137/1.9781611973440.11
[12]  
Koutra D, 2011, LECT NOTES ARTIF INT, V6912, P245, DOI 10.1007/978-3-642-23783-6_16
[13]  
Leskovec Jure, 2005, P 11 ACM SIGKDD INT, P177, DOI DOI 10.1145/1081870.1081893
[14]   STRUCTURENET: Hierarchical Graph Networks for 3D Shape Generation [J].
Mo, Kaichun ;
Guerrero, Paul ;
Yi, Li ;
Su, Hao ;
Wonka, Peter ;
Mitra, Niloy ;
Guibas, Leonidas J. .
ACM TRANSACTIONS ON GRAPHICS, 2019, 38 (06)
[15]   MODELING BY SHORTEST DATA DESCRIPTION [J].
RISSANEN, J .
AUTOMATICA, 1978, 14 (05) :465-471
[16]   A UNIVERSAL PRIOR FOR INTEGERS AND ESTIMATION BY MINIMUM DESCRIPTION LENGTH [J].
RISSANEN, J .
ANNALS OF STATISTICS, 1983, 11 (02) :416-431
[17]   TimeCrunch: Interpretable Dynamic Graph Summarization [J].
Shah, Neil ;
Koutra, Danai ;
Zou, Tianmin ;
Gallagher, Brian ;
Faloutsos, Christos .
KDD'15: PROCEEDINGS OF THE 21ST ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2015, :1055-1064
[18]   Spotting Suspicious Link Behavior with fBox: An Adversarial Perspective [J].
Shah, Neil ;
Beutel, Alex ;
Gallagher, Brian ;
Faloutsos, Christos .
2014 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2014, :959-964
[19]   BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs [J].
Shin, Kijung ;
Jung, Jinhong ;
Sael, Lee ;
Kang, U. .
SIGMOD'15: PROCEEDINGS OF THE 2015 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2015, :1571-1585
[20]   Sentiment analysis of player chat messaging in the video game StarCraft 2: Extending a lexicon-based model [J].
Thompson, Joseph J. ;
Leung, Betty H. M. ;
Blair, Mark R. ;
Taboada, Maite .
KNOWLEDGE-BASED SYSTEMS, 2017, 137 :149-162