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 compl...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Jang, Jun-Gi, Park, Chaeheum, Jang, Changwon, Kim, Geonsoo, Kang, U
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Jang, Jun-Gi
Park, Chaeheum
Jang, Changwon
Kim, Geonsoo
Kang, U
description 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.
doi_str_mv 10.48550/arxiv.2012.12487
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2012_12487</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2012_12487</sourcerecordid><originalsourceid>FETCH-LOGICAL-a677-b520c1bca1d32648f7c2c6f6bed1666a7d91c9185dfc8592803f6a40d7186e863</originalsourceid><addsrcrecordid>eNotz81OwkAUBeDZuDDoA7hyXqB1ZtremS4JkWIswQj75nZ-6E2gkqFV8ekVZHWSszg5H2MPUqS5KQrxhPGbPlMlpEqlyo2-ZfWcekf9lr_6E18PcbTDGP2RU8-Xy9X7W8WriIeOf9HQ8QX5iNF2ZHF37dfjfo-RfnCgj_6O3QTcHf39NSdsM3_ezBZJvapeZtM6QdA6aQslrGwtSpcpyE3QVlkI0HonAQC1K6UtpSlcsKYolRFZAMyF09KAN5BN2OP_7IXTHCL9XTg1Z1ZzYWW_hmNHcw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Finding Key Structures in MMORPG Graph with Hierarchical Graph Summarization</title><source>arXiv.org</source><creator>Jang, Jun-Gi ; Park, Chaeheum ; Jang, Changwon ; Kim, Geonsoo ; Kang, U</creator><creatorcontrib>Jang, Jun-Gi ; Park, Chaeheum ; Jang, Changwon ; Kim, Geonsoo ; Kang, U</creatorcontrib><description>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.</description><identifier>DOI: 10.48550/arxiv.2012.12487</identifier><language>eng</language><subject>Computer Science - Social and Information Networks</subject><creationdate>2020-12</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,777,882</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2012.12487$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2012.12487$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Jang, Jun-Gi</creatorcontrib><creatorcontrib>Park, Chaeheum</creatorcontrib><creatorcontrib>Jang, Changwon</creatorcontrib><creatorcontrib>Kim, Geonsoo</creatorcontrib><creatorcontrib>Kang, U</creatorcontrib><title>Finding Key Structures in MMORPG Graph with Hierarchical Graph Summarization</title><description>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.</description><subject>Computer Science - Social and Information Networks</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz81OwkAUBeDZuDDoA7hyXqB1ZtremS4JkWIswQj75nZ-6E2gkqFV8ekVZHWSszg5H2MPUqS5KQrxhPGbPlMlpEqlyo2-ZfWcekf9lr_6E18PcbTDGP2RU8-Xy9X7W8WriIeOf9HQ8QX5iNF2ZHF37dfjfo-RfnCgj_6O3QTcHf39NSdsM3_ezBZJvapeZtM6QdA6aQslrGwtSpcpyE3QVlkI0HonAQC1K6UtpSlcsKYolRFZAMyF09KAN5BN2OP_7IXTHCL9XTg1Z1ZzYWW_hmNHcw</recordid><startdate>20201223</startdate><enddate>20201223</enddate><creator>Jang, Jun-Gi</creator><creator>Park, Chaeheum</creator><creator>Jang, Changwon</creator><creator>Kim, Geonsoo</creator><creator>Kang, U</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20201223</creationdate><title>Finding Key Structures in MMORPG Graph with Hierarchical Graph Summarization</title><author>Jang, Jun-Gi ; Park, Chaeheum ; Jang, Changwon ; Kim, Geonsoo ; Kang, U</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a677-b520c1bca1d32648f7c2c6f6bed1666a7d91c9185dfc8592803f6a40d7186e863</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Computer Science - Social and Information Networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Jang, Jun-Gi</creatorcontrib><creatorcontrib>Park, Chaeheum</creatorcontrib><creatorcontrib>Jang, Changwon</creatorcontrib><creatorcontrib>Kim, Geonsoo</creatorcontrib><creatorcontrib>Kang, U</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Jang, Jun-Gi</au><au>Park, Chaeheum</au><au>Jang, Changwon</au><au>Kim, Geonsoo</au><au>Kang, U</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Finding Key Structures in MMORPG Graph with Hierarchical Graph Summarization</atitle><date>2020-12-23</date><risdate>2020</risdate><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 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.</abstract><doi>10.48550/arxiv.2012.12487</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2012.12487
ispartof
issn
language eng
recordid cdi_arxiv_primary_2012_12487
source arXiv.org
subjects Computer Science - Social and Information Networks
title Finding Key Structures in MMORPG Graph with Hierarchical Graph Summarization
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T04%3A39%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Finding%20Key%20Structures%20in%20MMORPG%20Graph%20with%20Hierarchical%20Graph%20Summarization&rft.au=Jang,%20Jun-Gi&rft.date=2020-12-23&rft_id=info:doi/10.48550/arxiv.2012.12487&rft_dat=%3Carxiv_GOX%3E2012_12487%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true