By Topic

An application of support vector machines to chinese character classification problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Liang Zhao ; Department of Intelligent Systems Design Engineering, Toyama Prefectural University, 5180 Kurokawa Imizu, Japan ; Noboru Takagi

Recently, it becomes known that support vector machines have high classification performance in a wide variety of applications. This paper applies support vector machines to Chinese character classification problem. Since it is difficult to apply support vector machines into Chinese character classification problem, this paper divides classification process into three stages; rough classification with Euclidean distance, resembling character classification with support vector machines, and fine classification for a small number of resembling characters. The effectiveness of the method is shown through computer experiments.

Published in:

2007 IEEE International Conference on Systems, Man and Cybernetics

Date of Conference:

7-10 Oct. 2007