Explaining Winning Poker--A Data Mining Approach

U. Johansson, Cecilia Sönströd, L. Niklasson
{"title":"Explaining Winning Poker--A Data Mining Approach","authors":"U. Johansson, Cecilia Sönströd, L. Niklasson","doi":"10.1109/ICMLA.2006.23","DOIUrl":null,"url":null,"abstract":"This paper presents an application where machine learning techniques are used to mine data gathered from online poker in order to explain what signifies successful play. The study focuses on short-handed small stakes Texas Hold'em, and the data set used contains 105 human players, each having played more than 500 hands. Techniques used are decision trees and G-REX, a rule extractor based on genetic programming. The overall result is that the rules induced are rather compact and have very high accuracy, thus providing good explanations of successful play. It is of course quite hard to assess the quality of the rules; i.e. if they provide something novel and non-trivial. The main picture is, however, that obtained rules are consistent with established poker theory. With this in mind, we believe that the suggested techniques will in future studies, where substantially more data is available, produce clear and accurate descriptions of what constitutes the difference between winning and losing in poker","PeriodicalId":297071,"journal":{"name":"2006 5th International Conference on Machine Learning and Applications (ICMLA'06)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 5th International Conference on Machine Learning and Applications (ICMLA'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMLA.2006.23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

This paper presents an application where machine learning techniques are used to mine data gathered from online poker in order to explain what signifies successful play. The study focuses on short-handed small stakes Texas Hold'em, and the data set used contains 105 human players, each having played more than 500 hands. Techniques used are decision trees and G-REX, a rule extractor based on genetic programming. The overall result is that the rules induced are rather compact and have very high accuracy, thus providing good explanations of successful play. It is of course quite hard to assess the quality of the rules; i.e. if they provide something novel and non-trivial. The main picture is, however, that obtained rules are consistent with established poker theory. With this in mind, we believe that the suggested techniques will in future studies, where substantially more data is available, produce clear and accurate descriptions of what constitutes the difference between winning and losing in poker
解释赢得扑克——一种数据挖掘方法
本文介绍了一个应用程序,其中机器学习技术用于挖掘从在线扑克收集的数据,以解释什么是成功的游戏。这项研究的重点是人手不足的小赌注德州扑克,使用的数据集包含105名人类玩家,每个人都玩过500多手。使用的技术是决策树和G-REX,一种基于遗传规划的规则提取器。总的结果是,归纳出的规则相当紧凑,具有很高的准确性,从而为成功的游戏提供了很好的解释。当然,很难评估这些规则的质量;也就是说,如果他们提供了一些新颖而不平凡的东西。然而,主要的情况是,获得的规则与建立的扑克理论是一致的。考虑到这一点,我们相信,在未来的研究中,当有更多的数据可用时,建议的技术将会对扑克输赢之间的差异产生清晰而准确的描述
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信