{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:47:07Z","timestamp":1725472027902},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540464914"},{"type":"electronic","value":"9783540464938"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11893318_37","type":"book-chapter","created":{"date-parts":[[2006,10,9]],"date-time":"2006-10-09T10:14:10Z","timestamp":1160388850000},"page":"332-336","source":"Crossref","is-referenced-by-count":1,"title":["Automatic Construction of Static Evaluation Functions for Computer Game Players"],"prefix":"10.1007","author":[{"given":"Makoto","family":"Miwa","sequence":"first","affiliation":[]},{"given":"Daisaku","family":"Yokoyama","sequence":"additional","affiliation":[]},{"given":"Takashi","family":"Chikayama","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"37_CR1","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 Comput.\u00a06(2), 215\u2013219 (1994)","journal-title":"Neural Comput."},{"key":"37_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-48957-6_8","volume-title":"Computers and Games","author":"M. Buro","year":"1999","unstructured":"Buro, M.: From simple features to sophisticated evaluation functions. In: van den Herik, H.J., Iida, H. (eds.) CG 1998. LNCS, vol.\u00a01558, pp. 126\u2013145. Springer, Heidelberg (1999)"},{"key":"37_CR3","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/978-0-387-35706-5_18","volume-title":"Advances in Computer Games","author":"T. Kaneko","year":"2004","unstructured":"Kaneko, T., Yamaguchi, K., Kawai, S.: Automated Identification of Patterns in Evaluation Functions. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) Advances in Computer Games, vol.\u00a010, pp. 279\u2013298. Kluwer Academic Publishers, Dordrecht (2004)"},{"key":"37_CR4","first-page":"1531","volume":"5","author":"F. Fleuret","year":"2004","unstructured":"Fleuret, F.: Fast Binary Feature Selection with Conditional Mutual Information. JMLR\u00a05, 1531\u20131555 (2004)","journal-title":"JMLR"},{"issue":"3","key":"37_CR5","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1023\/A:1007634325138","volume":"40","author":"J. Baxter","year":"2000","unstructured":"Baxter, J., Tridgell, A., Weaver, L.: Learning to Play Chess Using Temporal Differences. Machine Learning\u00a040(3), 243\u2013263 (2000)","journal-title":"Machine Learning"},{"key":"37_CR6","first-page":"1","volume-title":"Advances in Computer Games","author":"D. Gomboc","year":"2003","unstructured":"Gomboc, D., Marsland, T.A., Buro, M.: Evaluation fuction tuning via ordinal correlation. In: van den Herik, Iida, Heinz (eds.) Advances in Computer Games, pp. 1\u201318. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"37_CR7","unstructured":"Fayyad, U.M., Keki, B.: Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning. In: IJCAI 1993, pp. 1022\u20131027 (1993)"},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/1133905.1133916","volume-title":"Proc. of the 1st international workshop on open source data mining","author":"T. Uno","year":"2005","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: Lcm ver. 3: Collaboration of array, bitmap and prefix tree for frequent itemset mining. In: Proc. of the 1st international workshop on open source data mining, New York, USA, pp. 77\u201386. ACM Press, New York (2005)"},{"issue":"4","key":"37_CR9","doi-asserted-by":"crossref","first-page":"218","DOI":"10.3233\/ICG-2001-24405","volume":"24","author":"M. Sakuta","year":"2001","unstructured":"Sakuta, M., Iida, H.: And\/or-tree search algorithms in shogi mating search. ICGA Journal\u00a024(4), 218\u2013229 (2001)","journal-title":"ICGA Journal"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11893318_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:36:21Z","timestamp":1619494581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11893318_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540464914","9783540464938"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11893318_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}