DocumentCode
1873684
Title
A data mining approach to strategy prediction
Author
Weber, B.G. ; Mateas, Michael
Author_Institution
Expressive Intell. Studio, Univ. of California, Santa Cruz, Santa Cruz, CA, USA
fYear
2009
fDate
7-10 Sept. 2009
Firstpage
140
Lastpage
147
Abstract
We present a data mining approach to opponent modeling in strategy games. Expert gameplay is learned by applying machine learning techniques to large collections of game logs. This approach enables domain independent algorithms to acquire domain knowledge and perform opponent modeling. Machine learning algorithms are applied to the task of detecting an opponent´s strategy before it is executed and predicting when an opponent will perform strategic actions. Our approach involves encoding game logs as a feature vector representation, where each feature describes when a unit or building type is first produced. We compare our representation to a state lattice representation in perfect and imperfect information environments and the results show that our representation has higher predictive capabilities and is more tolerant of noise. We also discuss how to incorporate our data mining approach into a full game playing agent.
Keywords
computer games; data mining; encoding; learning (artificial intelligence); vectors; data mining; domain independent algorithm; domain knowledge acquisition; feature vector representation; machine learning algorithm; opponent modeling; strategy game log encoding; Artificial intelligence; Buildings; Data mining; Encoding; Lattices; Machine learning; Machine learning algorithms; Predictive models; Timing; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Games, 2009. CIG 2009. IEEE Symposium on
Conference_Location
Milano
Print_ISBN
978-1-4244-4814-2
Electronic_ISBN
978-1-4244-4815-9
Type
conf
DOI
10.1109/CIG.2009.5286483
Filename
5286483
Link To Document