주성분분석을 활용한 한국 프로바둑기사 포석 인식
Korean Pro Go Player's Opening Recognition Using PCA
0
조회
0
다운로드
10
인용
0
참고문헌
키워드
초록
Although the history of the game of Go is more than 2,500 years, the theoretical studies of Go are still insufficient. In recent years a lot of studies using Artificial Intelligent (AI) have been conducted, but they do not provide the prominent theoretical reality. We applied traditional Principal Component Analysis (PCA) algorithm to the Go openings, which are the early stage in Go, to analyze them especially focused on the Go game records of the Korean top 10professional Go players. We firstly analyzed the number of most significant eigenvectors capturing most of variance. Experimental result shows that among the 361 eigenvectors the eight most significant eigenvectors capture most of the variance (96.2%). We secondly used PCA classifier with Euclidean distance to recognize a pro player's opening to a class obtained from the training openings. Result shows that the best average recognition rate of 22% is so much lower than the recognition rates reported in face recognition research.
Abstract
Although the history of the game of Go is more than 2,500 years, the theoretical studies of Go are still insufficient. In recent years a lot of studies using Artificial Intelligent (AI) have been conducted, but they do not provide the prominent theoretical reality. We applied traditional Principal Component Analysis (PCA) algorithm to the Go openings, which are the early stage in Go, to analyze them especially focused on the Go game records of the Korean top 10professional Go players. We firstly analyzed the number of most significant eigenvectors capturing most of variance. Experimental result shows that among the 361 eigenvectors the eight most significant eigenvectors capture most of the variance (96.2%). We secondly used PCA classifier with Euclidean distance to recognize a pro player's opening to a class obtained from the training openings. Result shows that the best average recognition rate of 22% is so much lower than the recognition rates reported in face recognition research.
참고문헌 (13)
- 이병두, "주성분분석을 통한 바둑 포석 분석", 한국게임학회 논문지, 13(2), pp.59~70 (2013), 한국게임학회[DOI]
- N. Sasaki, "A Neural Network Program of Tsume-Go", pp.167~182 (1999), Computer and Games
- M. Müller, "Decomposition search : A combinatorial games approach to game tree search, with applications to solving endgames", IJCAI-99, 1, pp.578~583 (1999)
- 이병두, "휴리스틱 세력 함수를 이용한 바둑 사활 문제의 눈 모양 분석", 한국컴퓨터게임학회논문지, 111(15), pp.111~117 (2008), (사)한국컴퓨터게임학회
- T. Cazenave, "Combining tactical search and monte-carlo in the game of go", CIG’05, pp.171~175 (2005)
- P. Pirozmand, "Age Estimation, A Gabor PCA-LDA Approach", The Journal of Mathematics and Computer Science, 2(2), pp.233~240 (2011)
- J. Mazanec, "Support Vector Machines, PCA and LDA in Face Recognition", 59(4), pp.203~209 (2008)
- 안재성, "EEG 방향 인식 패턴을 이용한 게임 인터페이스 설계", 한국컴퓨터게임학회논문지, 3(21), pp.161~166 (2010), (사)한국컴퓨터게임학회
- 유재권, "인식 기반의 멀티모달 인터페이스를 이용한 체감형 태보 게임", 한국컴퓨터게임학회논문지, 24(3), pp.109~117 (2011), (사)한국컴퓨터게임학회
- 이병두, "코호넨 신경망을 이용 바둑 사활문제를 풀기 위한 후보 첫 수들", 한국게임학회 논문지, 9(1), pp.105~114 (2009), 한국게임학회
- K. Yeung, "An Empirical Study on Principal Component Analysis for Clustering Gene Expression Data", Bioinformatics, 17(9), pp.763~774 (2001)
- Byung-Doo Lee, "Multi-strategic Learning, Reasoning and Searching in the game of Go", 박사, pp.2005
- Hak-Yong Han, "Introduction to Pattern Recognition" (2011), Hanbit Media