• Title/Summary/Keyword: Kohonen Clustering Network

Search Result 23, Processing Time 0.025 seconds

The Efficient Feature Extraction of Handwritten Numerals in GLVQ Clustering Network (GLVQ클러스터링을 위한 필기체 숫자의 효율적인 특징 추출 방법)

  • Jeon, Jong-Won;Min, Jun-Yeong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.6
    • /
    • pp.995-1001
    • /
    • 1995
  • The structure of a typical pattern recognition consists a pre-processing, a feature extraction(algorithm) and classification or recognition. In classification, when widely varying patterns exist in same category, we need the clustering which organize the similar patterns. Clustering algorithm is two approaches. Firs, statistical approaches which are k-means, ISODATA algorithm. Second, neural network approach which is T. Kohonen's LVQ(Learning Vector Quantization). Nikhil R. Palet al proposed the GLVQ(Generalized LVQ, 1993). This paper suggest the efficient feature extraction methods of handwritten numerals in GLVQ clustering network. We use the handwritten numeral data from 21's authors(ie, 200 patterns) and compare the proportion of misclassified patterns for each feature extraction methods. As results, when we use the projection combination method, the classification ratio is 98.5%.

  • PDF

동적 비선형 신호의 온라인 모델링

  • 한정희;왕지남
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1994.10a
    • /
    • pp.371-376
    • /
    • 1994
  • This paper presents an on-line modeling method approach for the machine condition. the machine condition is continuously monitored with a sensor such as, a vibration, a current, an acoustic emission (AE) sensor. In this study, neural network modeling by radial basis function is designed for analysis a prediction error. An on-line learning algorithm is designed using the RLS(recursive least square) estimation and the existing clustering method of Kohonen neural network. Experimental results show that the proposed RBNN modeling is suitable for predicting simulated data.

  • PDF

Areal Image Clustering using SOM with 2 Phase Learning (SOM의 2단계학습을 이용한 항공영상 클러스터링)

  • Lee, Kyunghee
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.995-998
    • /
    • 2013
  • Aerial imaging is one of the most common and versatile ways of obtaining information from the Earth surface. In this paper, we present an approach by SOM(Self Organization Map) algorithm with 2 phase learning to be applied successfully to aerial images clustering due to its signal-to-noise independency. A comparison with other classical method, such as K-means and traditional SOM, of real-world areal image clustering demonstrates the efficacy of our approach.

  • PDF

A Document Ranking Method by Document Clustering Using Bayesian SoM and Botstrap (베이지안 SOM과 붓스트랩을 이용한 문서 군집화에 의한 문서 순위조정)

  • Choe, Jun-Hyeok;Jeon, Seong-Hae;Lee, Jeong-Hyeon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.7
    • /
    • pp.2108-2115
    • /
    • 2000
  • The conventional Boolean retrieval systems based on vector spae model can provide the results of retrieval fast, they can't reflect exactly user's retrieval purpose including semantic information. Consequently, the results of retrieval process are very different from those users expected. This fact forces users to waste much time for finding expected documents among retrieved documents. In his paper, we designed a bayesian SOM(Self-Organizing feature Maps) in combination with bayesian statistical method and Kohonen network as a kind of unsupervised learning, then perform classifying documents depending on the semantic similarity to user query in real time. If it is difficult to observe statistical characteristics as there are less than 30 documents for clustering, the number of documents must be increased to at least 50. Also, to give high rank to the documents which is most similar to user query semantically among generalized classifications for generalized clusters, we find the similarity by means of Kohonen centroid of each document classification and adjust the secondary rank depending on the similarity.

  • PDF

Bayesian Learning for Self Organizing Maps (자기조직화 지도를 위한 베이지안 학습)

  • 전성해;전홍석;황진수
    • 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.

Learning Algorithm using a LVQ and ADALINE (LVQ와 ADALINE을 이용한 학습 알고리듬)

  • 윤석환;민준영;신용백
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.19 no.39
    • /
    • pp.47-61
    • /
    • 1996
  • We propose a parallel neural network model in which patterns are clustered and patterns in a cluster are studied in a parallel neural network. The learning algorithm used in this paper is based on LVQ algorithm of Kohonen(1990) for clustering and ADALINE(Adaptive Linear Neuron) network of Widrow and Hoff(1990) for parallel learning. The proposed algorithm consists of two parts. First, N patterns to be learned are categorized into C clusters by LVQ clustering algorithm. Second, C patterns that was selected from each cluster of C are learned as input pattern of ADALINE(Adaptive Linear Neuron). Data used in this paper consists of 250 patterns of ASCII characters normalized into $8\times16$ and 1124. The proposed algorithm consists of two parts. First, N patterns to be learned are categorized into C clusters by LVQ clustering algorithm. Second, C patterns that was selected from each cluster of C are learned as input pattern of ADALINE(Adaptive Linear Neuron). Data used in this paper consists 250 patterns of ASCII characters normalized into $8\times16$ and 1124 samples acquired from signals generated from 9 car models that passed Inductive Loop Detector(ILD) at 10 points. In ASCII character experiment, 191(179) out of 250 patterns are recognized with 3%(5%) noise and with 1124 car model data. 807 car models were recognized showing 71.8% recognition ratio. This result is 10.2% improvement over backpropagation algorithm.

  • PDF

The Development of Dynamic Forecasting Model for Short Term Power Demand using Radial Basis Function Network (Radial Basis 함수를 이용한 동적 - 단기 전력수요예측 모형의 개발)

  • Min, Joon-Young;Cho, Hyung-Ki
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.7
    • /
    • pp.1749-1758
    • /
    • 1997
  • This paper suggests the development of dynamic forecasting model for short-term power demand based on Radial Basis Function Network and Pal's GLVQ algorithm. Radial Basis Function methods are often compared with the backpropagation training, feed-forward network, which is the most widely used neural network paradigm. The Radial Basis Function Network is a single hidden layer feed-forward neural network. Each node of the hidden layer has a parameter vector called center. This center is determined by clustering algorithm. Theatments of classical approached to clustering methods include theories by Hartigan(K-means algorithm), Kohonen(Self Organized Feature Maps %3A SOFM and Learning Vector Quantization %3A LVQ model), Carpenter and Grossberg(ART-2 model). In this model, the first approach organizes the load pattern into two clusters by Pal's GLVQ clustering algorithm. The reason of using GLVQ algorithm in this model is that GLVQ algorithm can classify the patterns better than other algorithms. And the second approach forecasts hourly load patterns by radial basis function network which has been constructed two hidden nodes. These nodes are determined from the cluster centers of the GLVQ in first step. This model was applied to forecast the hourly loads on Mar. $4^{th},\;Jun.\;4^{th},\;Jul.\;4^{th},\;Sep.\;4^{th},\;Nov.\;4^{th},$ 1995, after having trained the data for the days from Mar. $1^{th}\;to\;3^{th},\;from\;Jun.\;1^{th}\;to\;3^{th},\;from\;Jul.\;1^{th}\;to\;3^{th},\;from\;Sep.\;1^{th}\;to\;3^{th},\;and\;from\;Nov.\;1^{th}\;to\;3^{th},$ 1995, respectively. In the experiments, the average absolute errors of one-hour ahead forecasts on utility actual data are shown to be 1.3795%.

  • PDF

Development of Sasang Type Diagnostic Test with Neural Network (신경망을 사용한 사상체질 진단검사 개발 연구)

  • Chae, Han;Hwang, Sang-Moon;Eom, Il-Kyu;Kim, Byoung-Chul;Kim, Young-In;Kim, Byung-Joo;Kwon, Young-Kyu
    • Journal of Physiology & Pathology in Korean Medicine
    • /
    • v.23 no.4
    • /
    • pp.765-771
    • /
    • 2009
  • The medical informatics for clustering Sasang types with collected clinical data is important for the personalized medicine, but it has not been thoroughly studied yet. The purpose of this study was to examine the usefulness of neural network data mining algorithm for traditional Korean medicine. We used Kohonen neural network, the Self-Organizing Map (SOM), for the analysis of biomedical information following data pre-processing and calculated the validity index as percentage correctly predicted and type-specific sensitivity. We can extract 12 data fields from 30 after data pre-processing with correlation analysis and latent functional relationship analysis. The profile of Myers-Briggs Type Inidcator and Bio-Impedance Analysis data which are clustered with SOM was similar to that of original measurements. The percentage correctly predicted was 56%, and sensitivity for So-Yang, Tae-Eum and So-Eum type were 56%, 48%, and 61%, respectively. This study showed that the neural network algorithm for clustering Sasang types based on clinical data is useful for the sasang type diagnostic test itself. We discussed the importance of data pre-processing and clustering algorithm for the validity of medical devices in traditional Korean medicine.

Korean Phoneme Recognition by Combining Self-Organizing Feature Map with K-means clustering algorithm

  • Jeon, Yong-Ku;Lee, Seong-Kwon;Yang, Jin-Woo;Lee, Hyung-Jun;Kim, Soon-Hyob
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1994.06a
    • /
    • pp.1046-1051
    • /
    • 1994
  • It is known that SOFM has the property of effectively creating topographically the organized map of various features on input signals, SOFM can effectively be applied to the recognition of Korean phonemes. However, is isn't guaranteed that the network is sufficiently learned in SOFM algorithm. In order to solve this problem, we propose the learning algorithm combined with the conventional K-means clustering algorithm in fine-tuning stage. To evaluate the proposed algorithm, we performed speaker dependent recognition experiment using six phoneme classes. Comparing the performances of the Kohonen's algorithm with a proposed algorithm, we prove that the proposed algorithm is better than the conventional SOFM algorithm.

  • PDF

A Local Weight Learning Neural Network Architecture for Fast and Accurate Mapping (빠르고 정확한 변환을 위한 국부 가중치 학습 신경회로)

  • 이인숙;오세영
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.28B no.9
    • /
    • pp.739-746
    • /
    • 1991
  • This paper develops a modified multilayer perceptron architecture which speeds up learning as well as the net's mapping accuracy. In Phase I, a cluster partitioning algorithm like the Kohonen's self-organizing feature map or the leader clustering algorithm is used as the front end that determines the cluster to which the input data belongs. In Phase II, this cluster selects a subset of the hidden layer nodes that combines the input and outputs nodes into a subnet of the full scale backpropagation network. The proposed net has been applied to two mapping problems, one rather smooth and the other highly nonlinear. Namely, the inverse kinematic problem for a 3-link robot manipulator and the 5-bit parity mapping have been chosen as examples. The results demonstrate the proposed net's superior accuracy and convergence properties over the original backpropagation network or its existing improvement techniques.

  • PDF