Table of Contents Author Guidelines Submit a Manuscript
International Journal of Computer Games Technology
Volume 2015 (2015), Article ID 576201, 20 pages
http://dx.doi.org/10.1155/2015/576201
Research Article

Mining Experiential Patterns from Game-Logs of Board Game

1School of Computer Science and Technology, Hebei University, Baoding 071000, China
2School of Mathematics and Information Science, Hebei University, Baoding 071002, China

Received 21 September 2014; Revised 20 December 2014; Accepted 22 December 2014

Academic Editor: Hanqiu Sun

Copyright © 2015 Liang Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. El Rhalibi, K. W. Wong, and M. Price, “Artificial intelligence for computer games,” International Journal of Computer Games Technology, vol. 2009, Article ID 251652, 3 pages, 2009. View at Publisher · View at Google Scholar · View at Scopus
  2. C. E. Shannon, “Programming a computer for playing chess,” Philosophical Magazine, vol. 41, no. 7, pp. 256–275, 1950. View at Google Scholar · View at MathSciNet
  3. A. M. Turing, “Computing machinery and intelligence,” Mind, vol. 59, no. 49, pp. 433–460, 1950. View at Google Scholar · View at MathSciNet
  4. A. L. Samuel, “Some studies in machine learning using the game of checkers,” International Business Machines Corporation, vol. 3, pp. 211–229, 1959. View at Google Scholar · View at MathSciNet
  5. A. L. Samuel, “Some studies in machine learning using the game of checkers II—recent progress,” IBM Journal of Research and Development, no. 11, pp. 601–617, 1967. View at Google Scholar
  6. T. H. Kjeldsen, “John von Neumann's conception of the minimax theorem: a journey through different mathematical contexts,” Archive for History of Exact Sciences, vol. 56, no. 1, pp. 39–68, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. D. E. Knuth and R. W. Moore, “An analysis of alpha-beta pruning,” vol. 6, no. 4, pp. 293–326, 1975. View at Google Scholar · View at MathSciNet
  8. J. R. Slagle and R. C. T. Lee, “Application of game tree searching techniques to sequential pattern recognition,” Communications of the ACM, vol. 14, no. 2, pp. 103–110, 1971. View at Publisher · View at Google Scholar · View at Scopus
  9. J. Pearl, “Asymptotic properties of minimax trees and game-searching procedures,” Artificial Intelligence, vol. 14, no. 2, pp. 113–138, 1980. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. R. L. Rivest, “Game tree searching by min/max approximation,” Artificial Intelligence, vol. 34, no. 1, pp. 77–96, 1987. View at Publisher · View at Google Scholar · View at MathSciNet
  11. L. W. Li and T. A. Marsland, “Probability-based game tree pruning,” Journal of Algorithms, vol. 11, no. 1, pp. 27–43, 1990. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. M. Levene and T. I. Fenner, “The effect of mobility on minimaxing of game trees with random leaf values,” Artificial Intelligence, vol. 130, no. 1, pp. 1–26, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. Y. Björnsson and T. A. Marsland, “Learning extension parameters in game-tree search,” Information Sciences, vol. 154, no. 3-4, pp. 95–118, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. Wikipedia, English Draughts, 2014, http://en.wikipedia.org/wiki/English_draughts.
  15. W. Saletan, “Chess Bump: The Triumphant Teamwork of Humans and Computers,” May 2007, http://www.slate.com/articles/health_and_science/human_nature/2007/05/ches-s_bump.html.
  16. Wikipedia, Logistello, 2014, http://en.wikipedia.org/wiki/Logistello.
  17. B. N. Chen, P. Liu, S. C. Hsu, and T. S. Hsu, “Abstracting knowledge from annotated Chinese-chess game records,” in Computers and Games, vol. 4630 of Lecture Notes in Computer Science, pp. 100–111, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar
  18. E. C. D. van der Werf, M. H. M. Winands, H. J. van den Herik, and J. W. H. M. Uiterwijk, “Learning to predict life and death from Go game records,” Information Sciences, vol. 175, no. 4, pp. 258–272, 2005. View at Publisher · View at Google Scholar · View at Scopus
  19. Z.-Q. Liu and Q. Dou, “Automatic pattern acquisition from game records in GO,” The Journal of China Universities of Posts and Telecommunications, vol. 14, no. 1, pp. 100–105, 2007. View at Publisher · View at Google Scholar · View at Scopus
  20. S. J. Yen, T. N. Yang, J. C. Chen, and S. C. Hsu, “Pattern matching in GO game records,” in Proceedings of the 2nd International Conference on Innovative Computing, Information and Control (ICICIC '07), p. 297, Kumamoto, Japan, September 2007. View at Publisher · View at Google Scholar · View at Scopus
  21. T. Esaki and T. Hashiyama, “Extracting human players' shogi game strategies from game records using growing SOM,” in Proceedings of the International Joint Conference on Neural Networks (IJCNN '08), pp. 2176–2181, IEEE, Hong Kong, June 2008. View at Publisher · View at Google Scholar · View at Scopus
  22. B. G. Weber and M. Mateas, “A data mining approach to strategy prediction,” in Proceedings of the IEEE Symposium on Computational Intelligence and Games (CIG '09), pp. 140–147, IEEE, Milano, Italy, September 2009. View at Publisher · View at Google Scholar · View at Scopus
  23. S. Takeuchi, T. Kaneko, and K. Yamaguchi, “Evaluation of game tree search methods by game records,” IEEE Transactions on Computational Intelligence and AI in Games, vol. 2, no. 4, pp. 288–302, 2010. View at Publisher · View at Google Scholar · View at Scopus
  24. S. Wender, Data Mining and Machine Learning with Computer Game Logs, Project Report, University of Auckland, Auckland, New Zealand, 2007.
  25. Wikipedia, “Chinese checkers,” August 2014, http://en.wikipedia.org/wiki/Chinese_checkers.
  26. N. R. Mabroukeh and C. I. Ezeife, “A taxonomy of sequential pattern mining algorithms,” ACM Computing Surveys, vol. 43, no. 1, article 3, 2010. View at Publisher · View at Google Scholar · View at Scopus
  27. R. Srikant and R. Agrawal, “Mining sequential patterns: generalizations and performance improvements,” in Advances in Database Technology—EDBT '96, vol. 1057 of Lecture Notes in Computer Science, pp. 1–17, Springer, Berlin, Germany, 1996. View at Publisher · View at Google Scholar
  28. M. J. Zaki, “SPADE: an efficient algorithm for mining frequent sequences,” Machine Learning, vol. 42, no. 1-2, pp. 31–60, 2001. View at Publisher · View at Google Scholar · View at Scopus
  29. X. Yan, J. Han, and R. Afshar, “CloSpan: mining closed sequential patterns in large databases,” in Proceedings of the 3rd SIAM International Conference on Data Mining, pp. 166–173, SIAM, San Francisco, Calif, USA, 2003. View at Google Scholar
  30. J. Pei, J. Han, B. Mortazavi-Asl et al., “Mining sequential patterns by pattern-growth: the prefixspan approach,” IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 11, pp. 1424–1440, 2004. View at Publisher · View at Google Scholar · View at Scopus
  31. M. Y. Lin and S. Y. Lee, “Fast discovery of sequential patterns by memory indexing,” in Data Warehousing and Knowledge Discovery, vol. 2454 of Lecture Notes in Computer Science, pp. 150–160, Springer, Berlin, Germany, 2002. View at Publisher · View at Google Scholar
  32. R.-F. Hu, L. Wang, X.-Q. Mei, and Y. Luo, “Fault diagnosis based on sequential pattern mining,” Computer Integrated Manufacturing Systems, vol. 16, no. 7, pp. 1412–1418, 2010. View at Google Scholar · View at Scopus
  33. G. Yilmaz, B. Y. Badur, and S. Mardikyan, “Development of a constraint based sequential pattern mining tool,” The International Review on Computers and Software, vol. 6, no. 2, pp. 191–198, 2011. View at Google Scholar · View at Scopus
  34. S. Dharani, J. Rabi, N. Kumar, and Darly, “Fast algorithms for discovering sequential patterns in massive datasets,” Journal of Computer Science, vol. 7, no. 9, pp. 1325–1329, 2011. View at Publisher · View at Google Scholar · View at Scopus
  35. H.-J. Shyur, C. Jou, and K. Chang, “A data mining approach to discovering reliable sequential patterns,” Journal of Systems and Software, vol. 86, no. 8, pp. 2196–2203, 2013. View at Publisher · View at Google Scholar · View at Scopus
  36. G.-C. Lan, T.-P. Hong, V. S. Tseng, and S.-L. Wang, “Applying the maximum utility measure in high utility sequential pattern mining,” Expert Systems with Applications, vol. 41, no. 11, pp. 5071–5081, 2014. View at Publisher · View at Google Scholar · View at Scopus
  37. J. Han, J. Pei, and Y. Yin, “Mining frequent patterns without candidate generation,” ACM SIGMOD Record, vol. 29, no. 2, pp. 1–12, 2000. View at Publisher · View at Google Scholar · View at Scopus
  38. J. Edmonds, “Paths, trees, and flowers,” Canadian Journal of Mathematics, vol. 17, pp. 449–467, 1965. View at Google Scholar · View at MathSciNet