[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

Finding Key Structures in MMORPG Graph with Hierarchical Graph Summarization

Published: 30 July 2022 Publication History

Abstract

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.

References

[1]
Mohammed Al-Dhelaan and Hadel Alhawasi. 2015. Graph summarization for hashtag recommendation. In Proceedings of the 3rd International Conference on Future Internet of Things and Cloud, FiCloud 2015, Rome, Italy, August 24–26, 2015. IEEE Computer Society, 698–702.
[2]
Mario Luca Bernardi, Marta Cimitile, Fabio Martinelli, and Francesco Mercaldo. 2017. A time series classification approach to game bot detection. In Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics. 6:1–6:11.
[3]
Vincent D. Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. 2008. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 2008, 10 (2008), P10008.
[4]
Šejla Čebirić, François Goasdoué, Pawel Guzewicz, and Ioana Manolescu. 2018. Compact Summaries of Rich Heterogeneous Graphs. Ph.D. Dissertation. INRIA Saclay; Université Rennes 1.
[5]
Deepayan Chakrabarti, Spiros Papadimitriou, Dharmendra S. Modha, and Christos Faloutsos. 2004. Fully automatic cross-associations. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 79–88.
[6]
Diane J. Cook and Lawrence B. Holder. 1993. Substructure discovery using minimum description length and background knowledge. Journal of Artificial Intelligence Research 1, 1 (1993), 231–255.
[7]
Anders Drachen, Rafet Sifa, Christian Bauckhage, and Christian Thurau. 2012. Guns, swords and data: Clustering of player behavior in computer games in the wild. In Proceedings of the 2012 IEEE conference on Computational Intelligence and Games. 163–170.
[8]
Christos Faloutsos and Vasileios Megalooikonomou. 2007. On data mining, compression, and kolmogorov complexity. Data Mining and Knowledge Discovery 15, 1 (2007), 3–20.
[9]
Jinhong Jung, Namyong Park, Lee Sael, and U. Kang. 2017. BePI: Fast and memory-efficient method for billion-scale random walk with restart. In Proceedings of the 2017 ACM International Conference on Management of Data. 789–804.
[10]
U. Kang and Christos Faloutsos. 2011. Beyond ’Caveman communities’: Hubs and spokes for graph compression and mining. In Proceedings of the 2011 IEEE 11th International Conference on Data Mining. 300–309.
[11]
Danai Koutra, U. Kang, Jilles Vreeken, and Christos Faloutsos. 2014. VOG: Summarizing and understanding large graphs. In Proceedings of the 2014 SIAM International Conference on Data Mining. 91–99.
[12]
Danai Koutra, Tai-You Ke, U. Kang, Duen Horng Chau, Hsing-Kuo Kenneth Pao, and Christos Faloutsos. 2011. Unifying guilt-by-association approaches: Theorems and fast algorithms. In Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases. 245–260.
[13]
Jure Leskovec, Jon M. Kleinberg, and Christos Faloutsos. 2005. Graphs over time: Densification laws, shrinking diameters and possible explanations. In Proceedings of the 11th ACM SIGKDD international conference on Knowledge discovery in data mining. 177–187.
[14]
Kaichun Mo, Paul Guerrero, Li Yi, Hao Su, Peter Wonka, Niloy J. Mitra, and Leonidas J. Guibas. 2019. StructureNet: hierarchical graph networks for 3D shape generation. ACM Trans. Graph. 38, 6 (2019), 242:1–242:19.
[15]
J. Rissanen. 1978. Modeling by shortest data description. Automatica 14, 5 (1978), 465–471.
[16]
Jorma Rissanen. 1983. A universal prior for integers and estimation by minimum description length. The Annals of Statistics 11, 2 (1983), 416–431.
[17]
Neil Shah, Alex Beutel, Brian Gallagher, and Christos Faloutsos. 2014. Spotting suspicious link behavior with fbox: An adversarial perspective. In Proceedings of the 2014 IEEE International Conference on Data Mining. 959–964.
[18]
Neil Shah, Danai Koutra, Tianmin Zou, Brian Gallagher, and Christos Faloutsos. 2015. TimeCrunch: Interpretable dynamic graph summarization. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1055–1064.
[19]
Kijung Shin, Jinhong Jung, Lee Sael, and U. Kang. 2015. BEAR: Block elimination approach for random walk with restart on large graphs. In Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data. 1571–1585.
[20]
Joseph J. Thompson, Betty H. M. Leung, Mark R. Blair, and Maite Taboada. 2017. Sentiment analysis of player chat messaging in the video game StarCraft 2: Extending a lexicon-based model. Knowledge-Based Systems 137, C (2017), 149–162.
[21]
James Bradley Wendt, Michael Bendersky, Lluis Garcia Pueyo, Vanja Josifovski, Balint Miklos, Ivo Krka, Amitabh Saikia, Jie Yang, Marc-Allen Cartright, and Sujith Ravi. 2016. Hierarchical label propagation and discovery for machine generated email. In Proceedings of the 9th ACM International Conference on Web Search and Data Mining. 317–326.
[22]
Jaewon Yang and Jure Leskovec. 2013. Overlapping community detection at scale: A nonnegative matrix factorization approach. In Proceedings of the 6th ACM International Conference on Web Search and Data Mining. 587–596.
[23]
Wanshan Yang, Gemeng Yang, Ting Huang, Lijun Chen, and Youjian Eugene Liu. 2018. Whales, dolphins, or minnows? Towards the player clustering in free online games based on purchasing behavior via data mining technique. In Proceedings of the 2018 IEEE International Conference on Big Data. 4101–4108.
[24]
Zhitao Ying, Jiaxuan You, Christopher Morris, Xiang Ren, Will Hamilton, and Jure Leskovec. 2018. Hierarchical graph representation learning with differentiable pooling. In Proceedings of the Advances in Neural Information Processing Systems 31. 4800–4810.
[25]
L. Zhang, S. K. Shah, and Ioannis A. Kakadiaris. 2017. Hierarchical multi-label classification using fully associative ensemble learning. Pattern Recognition 70, C (2017), 89–103.
[26]
Zhen Zhang, Jiajun Bu, Martin Ester, Jianfeng Zhang, Zhao Li, Chengwei Yao, Dai Huifen, Zhi Yu, and Can Wang. 2021. Hierarchical multi-view graph pooling with structure learning. IEEE Transactions on Knowledge and Data Engineering (2021).

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Transactions on Knowledge Discovery from Data
ACM Transactions on Knowledge Discovery from Data  Volume 16, Issue 6
December 2022
631 pages
ISSN:1556-4681
EISSN:1556-472X
DOI:10.1145/3543989
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 July 2022
Online AM: 18 March 2022
Accepted: 01 February 2022
Received: 01 October 2021
Published in TKDD Volume 16, Issue 6

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Graph summarization
  2. minimum description length
  3. hierarchical label
  4. massively multiplayer online role-playing game

Qualifiers

  • Research-article
  • Refereed

Funding Sources

  • NCSOFT Co

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 318
    Total Downloads
  • Downloads (Last 12 months)62
  • Downloads (Last 6 weeks)6
Reflects downloads up to 06 Jan 2025

Other Metrics

Citations

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Full Text

View this article in Full Text.

Full Text

HTML Format

View this article in HTML Format.

HTML Format

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media