• 정보학연구
• /
• 제8권1호
• /
• pp.119-124
• /
• 2005

Learning procedure in the neural network is updating of weights between neurons. Unadequate initial learning coefficient causes excessive iterations of learning process or incorrect learning results and degrades learning efficiency. In this paper, adaptive learning algorithm is proposed to increase the efficient in the learning algorithms of Kohonens Self-Organization Neural networks. The algorithm updates the weights adaptively when learning procedure runs. To prove the efficiency the algorithm is experimented to clustering of the random weight. The result shows improved learning rate about 42~55% ; less iteration counts with correct answer.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.368-368
• /
• 2000

In this paper, we present forecasting ozone concentration with decision support system. Since the mechanism of ozone concentration is highly complex, nonlinear, and nonstationary, modeling of ozone prediction system has many problems and results of prediction are not good performance so far. Forecasting ozone concentration with decision support system is acquired to information from human knowledge and experiment data. Fuzzy clustering method uses the acquisition and dynamic polynomial neural network gives us a good performance for ozone prediction with ability of superior data approximation and self-organization.

• The Journal of the Acoustical Society of Korea
• /
• 제22권2E호
• /
• pp.49-55
• /
• 2003

The modified neural net pattern recognition equations were attempted to apply to speech recognition. The proposed method has a dynamic process of self-organization that has been proved to be successful in recognizing a depth perception in stereoscopic vision. This study has shown that the process has also been useful in recognizing human speech. In the processing, input vocal signals are first compared with standard models to measure similarities that are then given to a process of self-organization in neural net equations. The competitive and cooperative processes are conducted among neighboring input similarities, so that only one winner neuron is finally detected. In a comparative study, it showed that the proposed neural networks outperformed the conventional HMM speech recognizer under the same conditions.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.1015-1018
• /
• 1999

This paper describes a vector quantization for speech signal coding using neural networks. We processed speech signal using LPC method that extracts speech signal feature, and speech signal feature is quantized using competitive neural network kohonen self-organization feature map.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2002년도 추계학술대회논문집
• /
• pp.832-835
• /
• 2002

This paper presents a new approach integrated Case-Based Reasoning with Self. Organization Map(SOM) in diagnosis systems. The causes of faults are obtained by case-base trained from SOM. When the vibration problem of rotating machinery occurs, this provides an exact diagnosis method that shows the fault cause of vibration problem. In order to verify the performance of algorithm, we applied it to diagnose the fault cause of the electric motor.

• 융합신호처리학회논문지
• /
• 제3권4호
• /
• pp.62-66
• /
• 2002

SOCMAC 신경망에 의하여 Mackey-Glass의 비선형 시계열 예측을 시도하였다 다차원 연속 입력 변수를 가지는 문제는 요구되는 기억용량의 규모가 너무 커서 CMAC에서는 일반적으로 취급이 곤난한 대상이었으나 SOCMAC에서는 이것이 가능함을 보였다. 또한 학습과정에서 수용영역(receptive field)을 가변으로 하는 개선된 방법을 제시하였다. 예측오차는 TDNN(time-delayed neural network)이나 BP(back-propagation) 수준이었다.

• 정보학연구
• /
• 제7권3호
• /
• pp.11-18
• /
• 2004

신경회로망의 학습은 신경사이의 연결강도 갱신과정으로 이루어진다. 이때, 학습계수를 잘못 설정하였을 경우, 과도한 학습 횟수를 요하거나, 올바른 학습을 수행하지 못하게 된다. 패턴분류에 자주 이용되는 코호넨 신경회로망의 경우 고정된 학습계수를 사용하여 연결강도를 일률적으로 갱신하는 방식을 취함으로서 학습효율을 저하시키는 문제점이 발생한다. 본 논문에서는 코호넨 신경회로망의 학습효율을 향상시키기 위하여 학습계수를 입력벡터와 연결강도 벡터의 차에 따라 가변적으로 적응하는 자율학습 알고리즘을 제안하였다. 제안된 학습 알고리즘의 검증을 위하여 온라인 필기체의 표준 획 분류에 적용하였다. 그 결과 약 1.44~3.65% 정도의 학습 효율이 향상됨을 고찰하였다.

• 한국경영과학회지
• /
• 제25권4호
• /
• pp.97-109
• /
• 2000

This work proposes a neural network approach to solve vehicle routing problems which have diverse application areas such as vehicle routing and robot programming. In solving these problems, classical mathematical approaches have many difficulties. In particular, it is almost impossible to implement a real-time vehicle routing with multiple vehicles. Recently, many researchers proposed methods to overcome the limitation by adopting heuristic algorithms, genetic algorithms, neural network techniques and others. The most basic model for path planning is the Travelling Salesman Problem(TSP) for a minimum distance path. We extend this for a problem with dynamic upcoming of new positions with multiple vehicles. In this paper, we propose an algorithm based on SOM(Self-Organization Map) to obtain a sub-optimal solution for a real-time vehicle routing problem. We develope a model of a generalized multiple TSP and suggest and efficient solving procedure.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2003년도 추계종합학술대회
• /
• pp.188-191
• /
• 2003

본 논문에서는 분산환경에서 데이터마이닝을 효율적으로 하기 위해 데이터 일반화과정으로 데이터 일반화 기법과 데이터 큐브구성 기법을 제안하였다. 그리고 일반화 과정 이후 생성된 데이터 큐브로부터 가장 유용한 데이터를 찾기 위한 방법으로 신경망의 전통적인 자기형상화기법을 응용한 동적 자기구성 지도기법을 제안하였고 이를 위한 시스템 구조를 설계하였다.

• 한국통신학회논문지
• /
• 제17권12호
• /
• pp.1362-1370
• /
• 1992