Knowledge enhanced graph contrastive learning for match outcome prediction

IF 7.4 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Processing & Management Pub Date : 2024-12-12 DOI:10.1016/j.ipm.2024.104010
Junji Jiang , Likang Wu , Zhipeng Hu , Runze Wu , Xudong Shen , Hongke Zhao
{"title":"Knowledge enhanced graph contrastive learning for match outcome prediction","authors":"Junji Jiang ,&nbsp;Likang Wu ,&nbsp;Zhipeng Hu ,&nbsp;Runze Wu ,&nbsp;Xudong Shen ,&nbsp;Hongke Zhao","doi":"10.1016/j.ipm.2024.104010","DOIUrl":null,"url":null,"abstract":"<div><div>With the booming popularity, Multiplayer Online Battle Arena (MOBA) Game has become one of the mainstream games, in which players are divided into two teams, and the goal is to destroy the base of the opponent. Accurate prediction of the match outcome enables the operators to improve the players’ game experience through balance matching. However, existing methods usually model the players’ combat effectiveness based on the profile data, neglecting the evolution of proficiency of different heroes and their performance against different opponents. To model the evolution of players’ abilities, we propose the Knowledge Enhanced Graph Contrastive Learning (KEGC) framework that reinforces the predictor with the information of the knowledge graph and match sequence graphs. Specifically, we construct a knowledge graph that reflects the static system information on the cooperation and confrontation of heroes by game developers. Meanwhile, the match sequence of each player is converted into a sequence graph for representing dynamic ability, which builds edges in similar matches to capture player skills evolution. Further, we propose a coupled contrastive training framework to adaptively fuse the information from the static and dynamic views. Considering the uncertainty of players’ performance in different games, the conditional variational mechanism is introduced to KEGC. Besides, we also adopt the auxiliary task, i.e., the match balance, and design the joint loss function to suppress the noise in the training data. Extensive experiments on two real-world datasets from well-known MOBA games demonstrate the superiority of KEGC compared to the state-of-the-art methods.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"62 3","pages":"Article 104010"},"PeriodicalIF":7.4000,"publicationDate":"2024-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing & Management","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306457324003698","RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

With the booming popularity, Multiplayer Online Battle Arena (MOBA) Game has become one of the mainstream games, in which players are divided into two teams, and the goal is to destroy the base of the opponent. Accurate prediction of the match outcome enables the operators to improve the players’ game experience through balance matching. However, existing methods usually model the players’ combat effectiveness based on the profile data, neglecting the evolution of proficiency of different heroes and their performance against different opponents. To model the evolution of players’ abilities, we propose the Knowledge Enhanced Graph Contrastive Learning (KEGC) framework that reinforces the predictor with the information of the knowledge graph and match sequence graphs. Specifically, we construct a knowledge graph that reflects the static system information on the cooperation and confrontation of heroes by game developers. Meanwhile, the match sequence of each player is converted into a sequence graph for representing dynamic ability, which builds edges in similar matches to capture player skills evolution. Further, we propose a coupled contrastive training framework to adaptively fuse the information from the static and dynamic views. Considering the uncertainty of players’ performance in different games, the conditional variational mechanism is introduced to KEGC. Besides, we also adopt the auxiliary task, i.e., the match balance, and design the joint loss function to suppress the noise in the training data. Extensive experiments on two real-world datasets from well-known MOBA games demonstrate the superiority of KEGC compared to the state-of-the-art methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
Information Processing & Management
Information Processing & Management 工程技术-计算机:信息系统
CiteScore
17.00
自引率
11.60%
发文量
276
审稿时长
39 days
期刊介绍: Information Processing and Management is dedicated to publishing cutting-edge original research at the convergence of computing and information science. Our scope encompasses theory, methods, and applications across various domains, including advertising, business, health, information science, information technology marketing, and social computing. We aim to cater to the interests of both primary researchers and practitioners by offering an effective platform for the timely dissemination of advanced and topical issues in this interdisciplinary field. The journal places particular emphasis on original research articles, research survey articles, research method articles, and articles addressing critical applications of research. Join us in advancing knowledge and innovation at the intersection of computing and information science.
期刊最新文献
Injecting new insights: How do review sentiment and rating inconsistency shape the helpfulness of airline reviews? Exploring hate speech dynamics: The emotional, linguistic, and thematic impact on social media users Leveraging LLMs for action item identification in Urdu meetings: Dataset creation and comparative analysis Deep multi-view subspace clustering via hierarchical diversity optimization of consensus learning TK-RNSP: Efficient Top-K Repetitive Negative Sequential Pattern mining
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1