Game and Player Feature Selection for Entertainment Capture

Georgios N. Yannakakis, J. Hallam
{"title":"Game and Player Feature Selection for Entertainment Capture","authors":"Georgios N. Yannakakis, J. Hallam","doi":"10.1109/CIG.2007.368105","DOIUrl":null,"url":null,"abstract":"The notion of constructing a metric of the degree to which a player enjoys a given game has been presented previously. In this paper, we attempt to construct such metric models of children's 'fun' when playing the Bug Smasher game on the Playware platform. First, a set of numerical features derived from a child's interaction with the Playware hardware is presented. Then the sequential forward selection and the n-best feature selection algorithms are employed together with a function approximator based on an artificial neural network to construct feature sets and function that model the child's notion of 'fun' for this game. Performance of the model is evaluated by the degree to which the preferences predicted by the model match those expressed by the children in a survey experiment. The results show that an effective model can be constructed using these techniques and that the sequential forward selection method performs better in this task than n-best. The model reveals differing preferences for game parameters between children who react fast to game events and those who react slowly. The limitations and the use of the methodology as an effective adaptive mechanism to entertainment augmentation are discussed","PeriodicalId":365269,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence and Games","volume":"93 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Symposium on Computational Intelligence and Games","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIG.2007.368105","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26

Abstract

The notion of constructing a metric of the degree to which a player enjoys a given game has been presented previously. In this paper, we attempt to construct such metric models of children's 'fun' when playing the Bug Smasher game on the Playware platform. First, a set of numerical features derived from a child's interaction with the Playware hardware is presented. Then the sequential forward selection and the n-best feature selection algorithms are employed together with a function approximator based on an artificial neural network to construct feature sets and function that model the child's notion of 'fun' for this game. Performance of the model is evaluated by the degree to which the preferences predicted by the model match those expressed by the children in a survey experiment. The results show that an effective model can be constructed using these techniques and that the sequential forward selection method performs better in this task than n-best. The model reveals differing preferences for game parameters between children who react fast to game events and those who react slowly. The limitations and the use of the methodology as an effective adaptive mechanism to entertainment augmentation are discussed
娱乐捕获的游戏和玩家功能选择
关于构建玩家对特定游戏的喜爱程度的度量标准的概念已经在前面提到过了。在本文中,我们试图构建儿童在Playware平台上玩《Bug Smasher》游戏时的“乐趣”度量模型。首先,提出了一组来自儿童与Playware硬件交互的数字特征。然后,顺序前向选择和n-best特征选择算法与基于人工神经网络的函数逼近器一起使用,以构建特征集和函数,以模拟儿童对该游戏的“乐趣”概念。通过模型预测的偏好与儿童在调查实验中表达的偏好的匹配程度来评估模型的性能。结果表明,使用这些技术可以构建一个有效的模型,并且顺序前向选择方法在此任务中的表现优于n-best。该模型揭示了对游戏事件反应快的儿童和反应慢的儿童对游戏参数的不同偏好。讨论了该方法作为娱乐增强的有效适应机制的局限性和用途
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信