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 条
[1]   Graph Summarization for Hashtag Recommendation [J].
Al-Dhelaan, Mohammed ;
Alhawasi, Hadel .
2015 3RD INTERNATIONAL CONFERENCE ON FUTURE INTERNET OF THINGS AND CLOUD (FICLOUD) AND INTERNATIONAL CONFERENCE ON OPEN AND BIG (OBD), 2015, :698-702
[2]  
[Anonymous], 2017, P 7 INT C WEB INTELL
[3]   Fast unfolding of communities in large networks [J].
Blondel, Vincent D. ;
Guillaume, Jean-Loup ;
Lambiotte, Renaud ;
Lefebvre, Etienne .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
[4]  
Cebiric Sejla, 2018, THESIS U RENNES 1
[5]  
Chakrabarti Deepayan, 2004, KDD, P79
[6]   Substructure Discovery Using Minimum Description Length and Background Knowledge [J].
Cook, Diane J. ;
Holder, Lawrence B. .
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 1993, 1 :231-255
[7]  
Drachen A., 2012, 2012 IEEE Conference on Computational Intelligence and Games (CIG 2012), P163, DOI 10.1109/CIG.2012.6374152
[8]   On data mining, compression, and Kolmogorov complexity [J].
Faloutsos, Christos ;
Megalooikonomou, Vasileios .
DATA MINING AND KNOWLEDGE DISCOVERY, 2007, 15 (01) :3-20
[9]   BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart [J].
Jung, Jinhong ;
Park, Namyong ;
Sael, Lee ;
Kang, U. .
SIGMOD'17: PROCEEDINGS OF THE 2017 ACM INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2017, :789-804
[10]  
Kang U., 2011, Proceedings of the 2011 IEEE 11th International Conference on Data Mining (ICDM 2011), P300, DOI 10.1109/ICDM.2011.26