Finding Key Structures in MMORPG Graph with Hierarchical Graph Summarization

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 consistent 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 and interesting structures in the graph, and finding similar users.

[1]  Christos Faloutsos,et al.  Beyond 'Caveman Communities': Hubs and Spokes for Graph Compression and Mining , 2011, 2011 IEEE 11th International Conference on Data Mining.

[2]  Danai Koutra,et al.  TimeCrunch: Interpretable Dynamic Graph Summarization , 2015, KDD.

[3]  Lee Sael,et al.  BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart , 2017, SIGMOD Conference.

[4]  Lawrence B. Holder,et al.  Substructure Discovery Using Minimum Description Length and Background Knowledge , 1993, J. Artif. Intell. Res..

[5]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[6]  J. Rissanen A UNIVERSAL PRIOR FOR INTEGERS AND ESTIMATION BY MINIMUM DESCRIPTION LENGTH , 1983 .

[7]  Karl Rihaczek,et al.  1. WHAT IS DATA MINING? , 2019, Data Mining for the Social Sciences.

[8]  Ioannis A. Kakadiaris,et al.  Hierarchical Multi-label Classification using Fully Associative Ensemble Learning , 2017, Pattern Recognit..

[9]  Danai Koutra,et al.  Summarizing and understanding large graphs , 2015, Stat. Anal. Data Min..

[10]  Lee Sael,et al.  Random Walk with Restart on Large Graphs Using Block Elimination , 2016, ACM Trans. Database Syst..

[11]  Fabio Martinelli,et al.  A time series classification approach to game bot detection , 2017, WIMS.

[12]  Mohammed Al-Dhelaan,et al.  Graph Summarization for Hashtag Recommendation , 2015, 2015 3rd International Conference on Future Internet of Things and Cloud.

[13]  L. Jennings,et al.  Guns , 1976 .

[14]  Jure Leskovec,et al.  Overlapping community detection at scale: a nonnegative matrix factorization approach , 2013, WSDM.

[15]  Marc-Allen Cartright,et al.  Hierarchical Label Propagation and Discovery for Machine Generated Email , 2016, WSDM.

[16]  Christos Faloutsos,et al.  SlashBurn: Graph Compression and Mining beyond Caveman Communities , 2014, IEEE Transactions on Knowledge and Data Engineering.

[17]  Lance Hosey Whales , 2002 .

[18]  Lijun Chen,et al.  Whales, Dolphins, or Minnows? Towards the Player Clustering in Free Online Games Based on Purchasing Behavior via Data Mining Technique , 2018, 2018 IEEE International Conference on Big Data (Big Data).

[19]  Christos Faloutsos,et al.  Fully automatic cross-associations , 2004, KDD.

[20]  Danai Koutra,et al.  Summarizing and understanding large graphs , 2014, Stat. Anal. Data Min..

[21]  Maite Taboada,et al.  Sentiment analysis of player chat messaging in the video game StarCraft 2: Extending a lexicon-based model , 2017, Knowl. Based Syst..

[22]  Christos Faloutsos,et al.  On data mining, compression, and Kolmogorov complexity , 2007, Data Mining and Knowledge Discovery.

[23]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[24]  Jure Leskovec,et al.  Hierarchical Graph Representation Learning with Differentiable Pooling , 2018, NeurIPS.

[25]  Christian Bauckhage,et al.  Guns, swords and data: Clustering of player behavior in computer games in the wild , 2012, 2012 IEEE Conference on Computational Intelligence and Games (CIG).

[26]  François Goasdoué,et al.  Compact Summaries of Rich Heterogeneous Graphs , 2018 .

[27]  Christos Faloutsos,et al.  Spotting Suspicious Link Behavior with fBox: An Adversarial Perspective , 2014, 2014 IEEE International Conference on Data Mining.

[28]  Leonidas J. Guibas,et al.  StructureNet , 2019, ACM Trans. Graph..

[29]  Danai Koutra,et al.  Unifying Guilt-by-Association Approaches: Theorems and Fast Algorithms , 2011, ECML/PKDD.

[30]  Lee Sael,et al.  BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs , 2015, SIGMOD Conference.

[31]  J. Rissanen,et al.  Modeling By Shortest Data Description* , 1978, Autom..