The Community for Technology Leaders
Machine Learning and Applications, Fourth International Conference on (2006)
Orlando, Florida
Dec. 14, 2006 to Dec. 16, 2006
ISBN: 0-7695-2735-3
pp: 129-134
Ulf Johansson , University of Boras, Sweden
Cecilia Sonstrod , University of Boras, Sweden
Lars Niklasson , University of Skovde, Sweden
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
computer games, data mining, decision trees, genetic algorithms, learning (artificial intelligence)

U. Johansson, C. Sonstrod and L. Niklasson, "Explaining Winning Poker--A Data Mining Approach," 2006 International Conference on Machine Learning and Applications(ICMLA), Orlando, FL, 2007, pp. 129-134.
91 ms
(Ver 3.3 (11022016))