Ruck Thawonmas

Prof. Dr. Ruck Thawonmas

orcid

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 January 1997 in Electronics Letters
Verified
Journal Article
Closed access
ACAndrzej Cichocki
Andrzej Cichocki
RTRuck Thawonmas
Ruck Thawonmas
SAS. Amari
S. Amari
A new neural-network adaptive algorithm is proposed for performing extraction of independent source signals from a linear mixture of them. Using a suitable nonlinear Hebbian learning rule and a new deflation technique, the developed neural network is able to extract the source signals (sub-Gaussian and/or super-Gaussian) one-by-one with specified order according to their stochastic properties, namely, in decreasing order of absolute normalised kurtosis. The validity and performance of the algorithm are confirmed through extensive computer simulations.

1 October 2013
Verified
Conference Paper
Closed access
FLFeiyu Lu
Feiyu Lu
KYKaito Yamamoto
Kaito Yamamoto
LNLuis H. Nomura
Luis H. Nomura
SMSyunsuke Mizuno
Syunsuke Mizuno
YLYoungMin Lee
YoungMin Lee
RTRuck Thawonmas
Ruck Thawonmas
Game playing has provided an interesting framework for developing and testing artificial intelligence (AI) algorithms, with well-known examples such as Go and Chess. Since the first chess programs were written, there has been steady progress in the level of play to the point where current systems can challenge top-class human players. Recently, academia groups have created competitions to evaluate and compare AI methods, such as Ms Pac-Man versus Ghost Team and Student StarCraft AI Tournament. Those tournaments define their rules and goals based on the game they selected, according to which intelligent techniques and technologies are developed. We focus on a genre called fighting game. Examples of fighting games are Street Fighter, Tekken, and Mortal Kombat. To select the winner in the fighting game is simple: the winner is the character with less damage or the last one standing. In this paper we introduce a brand new competition based on a 2D fighting game written in Java.

3 December 2008
Verified
Conference Paper
Open access
PDF file
RTRuck Thawonmas
Ruck Thawonmas
YKYoshitaka Kashifuji
Yoshitaka Kashifuji
KCKuan-Ta Chen
Kuan-Ta Chen

1 April 1997 in IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
Verified
Journal Article
Closed access
RTRuck Thawonmas
Ruck Thawonmas
SAShigeo Abe
Shigeo Abe
This paper presents a novel approach to feature selection based on analysis of class regions which are generated by a fuzzy classifier. A measure for feature evaluation is proposed and is defined as the exception ratio. The exception ratio represents the degree of overlaps in the class regions, in other words, the degree of having exceptions inside of fuzzy rules generated by the fuzzy classifier. It is shown that for a given set of features, a subset of features that has the lowest sum of the exception ratios has the tendency to contain the most relevant features, compared to the other subsets with the same number of features. An algorithm is then proposed that performs elimination of irrelevant features. Given a set of remaining features, the algorithm eliminates the next feature, the elimination of which minimizes the sum of the exception ratios. Next, a terminating criterion is given. Based on this criterion, the proposed algorithm terminates when a significant increase in the sum of the exception ratios occurs due to the next elimination. Experiments show that the proposed algorithm performs well in eliminating irrelevant features while constraining the increase in recognition error rates for unknown data of the classifiers in use.


1 January 1999 in IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
Verified
Journal Article
Closed access
RTRuck Thawonmas
Ruck Thawonmas
SAShigeo Abe
Shigeo Abe
We present an efficient method for extracting fuzzy rules directly from numerical input-output data for function approximation problems. First, we convert a given function approximation problem into a pattern classification problem. This is done by dividing the universe of discourse of the output variable into multiple intervals, each regarded as a class, and then by assigning a class to each of the training data according to the desired value of the output variable. Next, we partition the data of each class in the input space to achieve a higher accuracy in approximation of class regions. Partition terminates according to a given criterion to prevent excessive partition. For class region approximation, we discuss two different types of representations using hyperboxes and ellipsoidal regions, respectively. Based on a selected representation, we then extract fuzzy rules from the approximated class regions. For a given input datum, we convert, or in other words, defuzzify, the resulting vector of the class membership degrees into a single real value. This value represents the final result approximated by the method. We test the presented method on a synthetic nonlinear function approximation problem and a real-world problem in an application to a water purification plant. We also compare the presented method with a method based on neural networks.