Logo PTI
Polish Information Processing Society
Logo FedCSIS

Annals of Computer Science and Information Systems, Volume 11

Proceedings of the 2017 Federated Conference on Computer Science and Information Systems

Predicting Unpredictable Building Models Handling Non-IID Data Hearthstone Case Study

DOI: http://dx.doi.org/10.15439/2017F563

Citation: Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, M. Ganzha, L. Maciaszek, M. Paprzycki (eds). ACSIS, Vol. 11, pages 127–130 ()

Full text

Abstract. The following article is created as a result of AAIA'17 Data Mining Challenge: Helping AI to Play Hearthstone. The Challenge goal was to correctly predict which bot will win a bot-vs-bot Hearthstone match based on what was known at a given time moment. Hearthstone is an online two-players card game with imperfect information (unlike chess and go, and alike poker), where the goal of one player is to defeat his/hers opponent by decreasing his/hers ''life points'' to zero (while not allowing opponent to do the same to oneself). Two main challenges were present: transformation of hierarchically structured data into a two-dimensional matrix, and dealing with Non-IID data (certain cards were present only in test data). A way how to successfully cope with those complications while using state-of-the-art machine learning algorithms (e.g. Microsoft's LightGBM) is presented.

References

  1. J. Friedman, T. Hastie, and R. Tibshirani, The elements of statistical learning. Springer series in statistics Springer, Berlin, 2001, vol. 1.
  2. J. Snoek, H. Larochelle, and R. P. Adams, “Practical bayesian optimization of machine learning algorithms,” in Advances in neural information processing systems, 2012, pp. 2951–2959.
  3. L. Breiman, “Random forests,” Machine learning, vol. 45, no. 1, pp. 5–32, 2001.
  4. T. Chen and C. Guestrin, “Xgboost: A scalable tree boosting system,” in Proceedings of the 22Nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2016, pp. 785–794.
  5. P. Geurts, D. Ernst, and L. Wehenkel, “Extremely randomized trees,” Machine learning, vol. 63, no. 1, pp. 3–42, 2006.
  6. D. Silver, A. Huang, C. J. Maddison, A. Guez, L. Sifre, G. Van Den Driessche, J. Schrittwieser, I. Antonoglou, V. Panneershelvam, M. Lanctot et al., “Mastering the game of go with deep neural networks and tree search,” Nature, vol. 529, no. 7587, pp. 484–489, 2016.
  7. G. Lample and D. S. Chaplot, “Playing fps games with deep reinforcement learning,” arXiv preprint https://arxiv.org/abs/1609.05521, 2016.