{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:24:13Z","timestamp":1725809053049},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319135595"},{"type":"electronic","value":"9783319135601"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13560-1_39","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T05:24:07Z","timestamp":1415942647000},"page":"484-495","source":"Crossref","is-referenced-by-count":1,"title":["K-means Pattern Learning for Move Evaluation in the Game of Go"],"prefix":"10.1007","author":[{"given":"Yunzhao","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuoying","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-45579-5_12","volume-title":"Computers and Games","author":"W. Slany","year":"2002","unstructured":"Slany, W.: The complexity of graph Ramsey games. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol.\u00a02063, pp. 186\u2013203. Springer, Heidelberg (2002)"},{"issue":"1","key":"39_CR2","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.tcs.2007.05.031","volume":"385","author":"M.Y. Hsieh","year":"2007","unstructured":"Hsieh, M.Y., Tsai, S.-C.: On the fairness and complexity of generalized k-in-a-row games. Theoretical Computer Science\u00a0385(1), 88\u2013100 (2007)","journal-title":"Theoretical Computer Science"},{"key":"39_CR3","unstructured":"Allis, V.L.: Searching for solutions in games and artificial intelligence (1994)"},{"issue":"314","key":"39_CR4","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1080\/14786445008521796","volume":"41","author":"C.E. Shannon","year":"1950","unstructured":"Shannon, C.E.: Programming a computer for playing chess. Philosophical Magazine\u00a041(314), 256\u2013275 (1950)","journal-title":"Philosophical Magazine"},{"issue":"1","key":"39_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF00288536","volume":"13","author":"S. Reisch","year":"1980","unstructured":"Reisch, S.: Gobang ist PSPACE-vollst\u00e4ndig. Acta Informatica\u00a013(1), 59\u201366 (1980)","journal-title":"Acta Informatica"},{"key":"39_CR6","unstructured":"Robson, J.M.: The Complexity of Go. In: IFIP Congress, pp. 413\u2013417 (1983)"},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0004-3702(01)00129-1","volume":"134","author":"M. Campbell","year":"2002","unstructured":"Campbell, M., Hoane Jr., A.J., Hsu, F.-H.: Deep blue. Artificial Intelligence\u00a0134, 157\u2013183 (2002)","journal-title":"Artificial Intelligence"},{"issue":"2","key":"39_CR8","doi-asserted-by":"crossref","first-page":"92","DOI":"10.3233\/ICG-2003-26205","volume":"26","author":"E.C.D. Werf van der","year":"2003","unstructured":"van der Werf, E.C.D., Van Den Herik, H.J., Uiterwijk, J.W.H.M.: Solving Go on Small Boards. ICGA Journal\u00a026(2), 92\u2013107 (2003)","journal-title":"ICGA Journal"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0004-3702(01)00127-8","volume":"132","author":"B. Bouzy","year":"2001","unstructured":"Bouzy, B., Cazenave, T.: Computer Go: An AI oriented survey. Artificial Intelligence\u00a0132, 39\u2013103 (2001)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"39_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"C.B. Browne","year":"2012","unstructured":"Browne, C.B., Powley, E., Whitehouse, D., Lucas, S.M., Cowling, P.I., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., Colton, S.: A survey of monte carlo tree search methods. Computational Intelligence and AI in Games\u00a04(1), 1\u201343 (2012)","journal-title":"Computational Intelligence and AI in Games"},{"key":"39_CR11","unstructured":"Press, W.H.: Numerical recipes, 3rd edn. The art of scientific computing (2007)"},{"issue":"2","key":"39_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1162\/neco.1994.6.2.215","volume":"6","author":"G. Tesauro","year":"1994","unstructured":"Tesauro, G.: TD-Gammon, a self-teaching backgammon program, achieves master-level play. Neural Computation\u00a06(2), 215\u2013219 (1994)","journal-title":"Neural Computation"},{"key":"39_CR13","unstructured":"Schraudolph, N.N., Dayan, P., Sejnowski, T.J.: Temporal difference learning of position evaluation in the game of Go. In: Advances in Neural Information Processing Systems, p. 817 (1994)"},{"key":"39_CR14","unstructured":"Ekker, R., van der Werf, E.C.D., Schomaker, L.R.B.: Dedicated TD-learning for Stronger Gameplay: Applications to Go (2004)"},{"key":"39_CR15","unstructured":"Ghory, I.: Reinforcement learning in board games. Department of Computer Science, University of Bristol, Tech. Rep. (2004)"},{"key":"39_CR16","unstructured":"Gelly, S., Wang, Y., Munos, R., Teytaud, O., et al.: Modification of UCT with patterns in Monte-Carlo Go (2006)"},{"key":"39_CR17","unstructured":"Gelly, S., Silver, D.: Achieving Master Level Play in 9 x 9 Computer Go. In: AAAI, vol. 8, pp. 1537\u20131540 (2008)"},{"key":"39_CR18","doi-asserted-by":"crossref","unstructured":"Coulom, R.: Computing elo ratings of move patterns in the game of go. In: Computer Games Workshop (2007)","DOI":"10.3233\/ICG-2007-30403"},{"key":"39_CR19","doi-asserted-by":"crossref","unstructured":"Stern, D., Herbrich, R., Graepel, T.: Bayesian pattern ranking for move prediction in the game of Go. In: Proceedings of the 23rd International Conference on Machine Learning, pp. 873\u2013880 (2006)","DOI":"10.1145\/1143844.1143954"},{"key":"39_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/3-540-44668-0_49","volume-title":"Artificial Neural Networks - ICANN 2001","author":"T. Graepel","year":"2001","unstructured":"Graepel, T., Goutri\u00e9, M., Kr\u00fcger, M., Herbrich, R.: Learning on graphs in the game of go. In: Dorffner, G., Bischof, H., Hornik, K. (eds.) ICANN 2001. LNCS, vol.\u00a02130, p. 347. Springer, Heidelberg (2001)"},{"key":"39_CR21","unstructured":"Ralaivola, L., Wu, L., Baldi, P.: SVM and pattern-enriched common fate graphs for the game of Go (2005)"},{"key":"39_CR22","doi-asserted-by":"crossref","unstructured":"Coates, A., Ng, A.Y.: Learning feature representations with K-means. In: Montavon, G., Orr, G.B., M\u00fcller, K.-R. (eds.) NN: Tricks of the Trade, 2nd edn. LNCS, vol.\u00a07700, pp. 561\u2013580. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-35289-8_30"},{"key":"39_CR23","unstructured":"Coates, A., Ng, A.Y., Lee, H.: An analysis of single-layer networks in unsupervised feature learning. In: International Conference on Artificial Intelligence and Statistics, pp. 215\u2013223 (2011)"},{"issue":"3","key":"39_CR24","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TNN.2005.845141","volume":"16","author":"R. Xu","year":"2005","unstructured":"Xu, R., Wunsch, D., et al.: Survey of clustering algorithms. Neural Networks\u00a016(3), 645\u2013678 (2005)","journal-title":"Neural Networks"},{"key":"39_CR25","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L. Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based monte-carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol.\u00a04212, pp. 282\u2013293. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2014: Trends in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13560-1_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T13:57:18Z","timestamp":1559051838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13560-1_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319135595","9783319135601"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13560-1_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}