• Communications for Statistical Applications and Methods
• /
• v.10 no.2
• /
• pp.507-517
• /
• 2003

Self-organizing map (SOM) has been developed mainly by T. Kohonen and his colleagues as a unsupervised learning neural network. Because of its topological ordering property, SOM is known to be very useful in pattern recognition and text information retrieval areas. Recently, data miners use Kohonen´s mapping method frequently in exploratory analyses of large data sets. One problem facing SOM builder is that there exists no sensible criterion for evaluating goodness-of-fit of the map at hand. In this short communication, we propose valid evaluation procedures for the Kohonen SOM of any size. The methods can be used in selecting the best map among several candidates.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.6
• /
• pp.83-90
• /
• 1994

In this paper, we propose a new learning algorithm, ASOFM(Adaptive Self Organizing Feature Map), to solve the defects of Kohonen's Self Organiaing Feature Map. Kohonen's algorithm is sometimes stranded on local minima for the initial weights. The proposed algorithm uses an object function which can evaluate the state of network in learning and adjusts the learning rate adaptively according to the evaluation of the object function. As a result, it is always guaranteed that the state of network is converged to the global minimum value and it has a capacity of generalized learning by adaptively. It is reduce that the learning time of our algorithm is about $30\%$ of Kohonen's.

• The Korean Journal of Applied Statistics
• /
• v.16 no.2
• /
• pp.321-333
• /
• 2003

Self-organizing map (SOM), a unsupervised learning neural network, has been developed by T. Kohonen since 1980's. Main application areas were pattern recognition and text retrieval. Because of that, it has not been spread to statisticians until late. Recently, SOM's are frequently drawn in data mining fields. Kohonen's SOM, however, needs improvements to become a statistician's standard tool. First, there should be a good guideline as for the size of map. Second, an enhanced visualization mode is wanted. In this study, principal components self-organizing map (PC-SOM), a modification of Kohonen's SOM, is proposed to meet such needs. PC-SOM performs one-dimensional SOM during the first stage to decompose input units into node weights and residuals. At the second stage, another one-dimensional SOM is applied to the residuals of the first stage. Finally, by putting together two stages, one obtains two-dimensional SOM. Such procedure can be easily expanded to construct three or more dimensional maps. The number of grid lines along the second axis is determined automatically, once that of the first axis is given by the data analyst. Furthermore, PC-SOM provides easily interpretable map axes. Such merits of PC-SOM are demonstrated with well-known Fisher's iris data and a simulated data set.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.2
• /
• pp.105-127
• /
• 2003

In this paper, four different data mining techniques, two neural networks and two statistical modeling techniques, are compared in terms of prediction accuracy in the context of bankruptcy prediction. In business setting, how to accurately detect the condition of a firm has been an important event in the literature. In neural networks, Backpropagation (BP) network and the Kohonen self-organizing feature map, are selected and compared each other while in statistical modeling techniques, discriminant analysis and logistic regression are also performed to provide performance benchmarks for the neural network experiment. The findings suggest that the BP network is a better choice among the data mining tools compared. This paper also identified some distinctive characteristics of Kohonen self-organizing feature map.

• Journal of Korea Multimedia Society
• /
• v.3 no.4
• /
• pp.416-423
• /
• 2000

The existing self-organizing feature map of Kohonen has weakpoint that need too much input patterns in order to converse into the learning rate and equilibrium state when it trains. Making up for the current weak point, B.Bavarian suggested the method of that distributed the learning rate such as Gaussian function. However, this method has also a disadvantage which can not achieve the right self-organizing. In this paper, we proposed the method of improving the convergence speed and the convergence rate of self-organizing feature map converting the Gaussian function into dynamic approximate curve used in when trains the self-organizing feature map.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.204-210
• /
• 2002

The self-organizing feature map of Kohonen has disadvantage that needs too much input patterns in order to converge into the equilibrium state when it trains. In this paper we proposed the method of improving the convergence speed and rate of self-organizing feature map converting the interaction set into Dynamic Gaussian function. The proposed method Provides us with dynamic Properties that the deviation and width of Gaussian function used as an interaction function are narrowed in proportion to learning times and learning rates that varies according to topological position from the winner neuron. In this Paper. we proposed the method of improving the convergence rate and the degree of self-organizing feature map.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.42.6-42
• /
• 2002

Kohonen's self organizing feature map (SOFM) converts arbitrary dimensional patterns into one or two dimensional arrays of nodes. Among the many competitive learning algorithms, SOFM proposed by Kohonen is considered to be powerful in the sense that it not only clusters the input pattern adaptively but also organize the output node topologically. SOFM is usually used for a preprocessor or cluster. It can perform dimensional reduction of input patterns and obtain a topology-preserving map that preserves neighborhood relations of the input patterns. The traditional SOFM algorithm[1] is a competitive learning neural network that maps inputs to discrete points that are called nodes on a lattice...

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.3D
• /
• pp.347-356
• /
• 2009

This paper is described clustering analysis of traffic characteristics-based highway classification in order to deviate from methodologies of existing highway functional classification. This research focuses on comparing the clustering techniques performance based on the total within-group errors and deriving the optimal number of cluster. This research analyzed statistical clustering method (Hierarchical Ward's minimum-variance method, Nonhierarchical K-means method) and Kohonen self-organizing maps clustering method for highway characteristic classification. The outcomes of cluster techniques compared for the number of samples and traffic characteristics from subsets derived by the optimal number of cluster. As a comprehensive result, the k-means method is superior result to other methods less than 12. For a cluster of more than 20, Kohonen self-organizing maps is the best result in the cluster method. The main contribution of this research is expected to use important the basic road attribution information that produced the highway characteristic classification.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.180-188
• /
• 1995

A modified Kohonen's self-organizing feature map (SOFM) algorithm which has binary reinforcement function and a constant learning rate is proposed. In contrast to the time-varing adaptaion gain of the original Kohonen's SOFM algorithm, the proposed algorithm uses a constant adaptation gain, and adds a binary reinforcement function in order to compensate for the lowered learning ability of SOFM due to the constant learning rate. Since the proposed algorithm does not have the complicated multiplication, it's digital hardware implementation is much easier than that of the original SOFM.

• The Korean Journal of Applied Statistics
• /
• v.15 no.2
• /
• pp.251-267
• /
• 2002

Self Organizing Maps(SOM) by Kohonen is very fast algorithm in neural networks. But it doesn't show sure rules of training results. In this paper, we introduce to Bayesian Learning for Self Organizing Maps(BLSOM) which combines self organizing maps with Bayesian learning. So it supports explanatory power of models and improves prediction. BLSOM has global optima anywhere but SOM has not. This is proved by experiment in this paper.