SVM and pattern-enriched common fate graphs for the game of go

ESANN 2005 Proceedings - 13th European Symposium on Artificial Neural Networks

Volumn , Issue , 2007, Pages 485-490

  Ralaivola, Liva ^a,b   Wu, Lin ^b   Baldi, Pierre ^b  

^a UNIVERSITÉ DE PROVENCE   (France)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOARD POSITION; KERNEL FUNCTION; POSITION EVALUATION; WEIGHTED GRAPH;

NEURAL NETWORKS;

SUPPORT VECTOR MACHINES;

EID: 84886997003     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. M. Buro. Experiments with Multi-ProbCut and a New High-Quality Evaluation Function for Othello. In Games in AI Research, 2000.
2. T. Graepel, M. Goutrie, M. Krüger, and R. Herbrich. Learning on graphs in the game of go. In Proc. of Int. Conf. on Artificial Neural Networks (ICANN-01), Vienna, Austria, 2001.
3. C. Cortes and V. Vapnik. Support Vector Networks. Machine Learning, 20:1-25, 1995.
4. T. Joachims. Making Large-Scale Support Vector Machine Learning Practical. In B. Schölkopf, C. Burges, and A. Smola, editors, Adv. in Kernel Methods - Support Vector Learning, pages 169-184. MIT Press, Cambridge, MA, 1998.