• 전기전자학회논문지
• /
• 제12권4호
• /
• pp.217-224
• /
• 2008

This paper provides a framework for semantic correspondence of heterogeneous databases using self- organizing map. It solves the problem of overlapping between different databases due to their different schemas. Clustering technique using self-organizing maps (SOM) is tested and evaluated to assess its performance when using different kinds of data. Preprocessing of database is performed prior to clustering using edit distance algorithm, principal component analysis (PCA), and normalization function to identify the features necessary for clustering.

• Journal of applied mathematics & informatics
• /
• 제9권2호
• /
• pp.793-806
• /
• 2002

Feature-based similarity retrieval become an important research issue in image database systems. The features of image data are useful to discrimination of images. In this paper, we propose the highspeed k-Nearest Neighbor search algorithm based on Self-Organizing Maps. Self-Organizing Maps (SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space. The mapping preserves the topology of the feature vectors. The map is called topological feature map. A topological feature map preserves the mutual relations (similarity) in feature spaces of input data. and clusters mutually similar feature vectors in a neighboring nodes. Each node of the topological feature map holds a node vector and similar images that is closest to each node vector. In topological feature map, there are empty nodes in which no image is classified. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.

• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 2022년도 학술발표회
• /
• pp.482-482
• /
• 2022

하천의 합류부에서는 수질이 다른 유체가 혼합하여 합류 전과 다른 특성을 보인다. 하천의 합류부에서 수질을 효율적으로 관리하기 위해서는 수질의 공간적인 혼합 특성을 규명하는 것이 중요하다. 합류부에서 수질의 공간적인 혼합 특성을 분석하기 위해 본 연구에서는 토폴로지 데이터 분석(topological data analysis, TDA), 자기 조직화 지도(Self-Organizing Map, SOM), k-평균 알고리즘(K-means clustering algorithm) 세 가지 기법을 이용하였다. 세 가지 기법을 비교하여 어떤 알고리즘이 합류부의 수질 변화 특성을 더 뚜렷하게 나타내는지 분석하였다. 수질 변화 비교 인자들은 pH, chlorophyll, DO, Turbidity 등이 있고, 수질 인자들은 YSI를 활용해 측정하였다. 자료의 측정 지역은 낙동강과 황강이 합류하는 지역이며, 보트에 YSI 장비를 부착하고 횡단하여 측정하였다. 측정한 데이터를 R 프로그램을 통해 세 가지 기법을 적용시켜 수질 변화 비교를 분석한다. 토폴로지 데이터 분석(topological data analysis, TDA)은 거대하고 복잡한 데이터로부터 유의미한 정보를 추출하는 데 사용하고, 자기조직화지도(Self-Organizing Map, SOM) 기법은 차원 축소와 군집화를 동시에 수행한다. k-평균 알고리즘(K-means clustering algorithm) 기법은 주어진 데이터를 k개의 클러스터로 묶는 머신러닝 비지도학습에 속하는 알고리즘이다. 세 가지 방법들의 주목적은 클러스터링이다. 클러스터 분석(Cluster analysis)이란 주어진 데이터들의 특성을 고려해 동일한 성격을 가진 여러 개의 그룹으로 대상을 분류하는 데이터 마이닝의 한 방법이다. 군집화 방법들인 TDA, SOM, K-means를 이용해 합류 지역의 수질 특성들을 클러스터링하여 수질 패턴들을 분석해 하천 수질 오염을 방지할 수 있을 것이다. 본 연구에서는 토폴로지 데이터 분석(topological data analysis, TDA), 자기조직화지도(Self-Organizing Map, SOM), k-평균 알고리즘(K-means clustering algorithm) 세 가지 기법을 이용하여 합류부에서의 수질 특성을 비교하며 어떤 기법이 합류의 특성을 더욱 뚜렷하게 나타내는지 규명했다. 합류의 특성을 군집화 방법을 이용해 알게 된다면, 합류부의 수질 변화 패턴을 다른 합류 지역에서도 적용할 수 있을 것으로 기대된다.

• 산업경영시스템학회지
• /
• 제39권3호
• /
• pp.83-89
• /
• 2016

The group formation problem of the machine and part is a critical issue in the planning stage of cellular manufacturing systems. The machine-part grouping with alternative process plans means to form machine-part groupings in which a part may be processed not only by a specific process but by many alternative processes. For this problem, this study presents an algorithm based on self organizing neural networks, so called SOM (Self Organizing feature Map). The SOM, a special type of neural networks is an intelligent tool for grouping machines and parts in group formation problem of the machine and part. SOM can learn from complex, multi-dimensional data and transform them into visually decipherable clusters. In the proposed algorithm, output layer in SOM network had been set as one-dimensional structure and the number of output node has been set sufficiently large in order to spread out the input vectors in the order of similarity. In the first stage of the proposed algorithm, SOM has been applied twice to form an initial machine-process group. In the second stage, grouping efficacy is considered to transform the initial machine-process group into a final machine-process group and a final machine-part group. The proposed algorithm was tested on well-known machine-part grouping problems with alternative process plans. The results of this computational study demonstrate the superiority of the proposed algorithm. The proposed algorithm can be easily applied to the group formation problem compared to other meta-heuristic based algorithms. In addition, it can be used to solve large-scale group formation problems.

• 한국방재학회:학술대회논문집
• /
• 한국방재학회 2008년도 정기총회 및 학술발표대회
• /
• pp.669-673
• /
• 2008

In this study, the new methodology which combines Kohonen self-organizing map(KSOM) neural networks model and the conventional neural networks models such as feedforward neural networks model and generalized neural networks model is introduced to forecast flood stage in Nakdong river, Republic of Korea. It is possible to train without output data in KSOM neural networks model. KSOM neural networks model is used to classify the input data before it combines with the conventional neural networks model. Four types of models such as SOM-FFNNM-BP, SOM-GRNNM-GA, FFNNM-BP, and GRNNM-GA are used to train and test performances respectively. From the statistical analysis for training and testing performances, SOM-GRNNM-GA shows the best results compared with the other models such as SOM-FFNNM-BP, FFNNM-BP, and GRNNM-GA and FFNNM-BP shows vice-versa. From this study, we can suggest the new methodology to forecast flood stage and construct flood warning system in river basin.

• 대한토목학회논문집
• /
• 제26권4B호
• /
• pp.389-398
• /
• 2006

본 연구에서는 강우의 시 공간적 분포의 불규칙한 변동성을 고려한 강우-유출예측모형을 위해 인공신경망(Artificial Neural Networks: ANNs)의 기법의 일종인 자기조직화(Self Organizing Map: SOM) 이론과 역전파 학습 알고리즘(Back Propagation Algorithm: BPA을 복합적으로 이용하였다. 기존의 인공신경망 연구에서 야기된 저 갈수기의 유출량에 대한 과대평가, 홍수기의 유출량에 대한 과소평가, 예측값이 연속적으로 선행 유출량을 나타내는 Persistence 현상을 해결하기 위하여 패턴분류 성능을 지닌 SOM 이론을 예측모형의 전처리 과정으로 이용하였다. 먼저, 본 연구에서 제안한 방법은 SOM에 의해 강우-유출 관계를 분류하고, SOM에 의한 분류에 따라 각각의 모형을 구성한다. 개별적으로 구축된 모형은 유출량의 예측을 위해 각각의 양상에 따라 분류된 자료를 이용한다. 결과적으로 본 연구에서 제안한 방법은 과거의 인공신경망의 일반적인 적용에 의한 결과보다 더 나은 예측능력을 보여주었으며, 더불어 유출량의 과소 및 과대추정과 Persistence 현상과 같은 문제점이 나타나지 않았다.

• 대한전기학회논문지:전기물성ㆍ응용부문C
• /
• 제53권10호
• /
• pp.515-522
• /
• 2004

In this study, we tried to investigate that the advantages of SOM(Self Organizing Map) algorithm such as data accumulation ability and the degradation trend trace ability would be adaptable to the analysis of partial discharge pattern recognition. For the purpose, we analyzed partial discharge data obtained from the typical artificial defects in GIS and XLPE power cable system through SOM algorithm. As a result, partial discharge pattern recognition could be well carried out with an acceptable error by use of Kohonen map in SOM algorithm. Also, it was clarified that the additional data could be accumulated during the operation of the algorithm. Especially, we found out that the data accumulation ability of Kohonen map could make it possible to suggest new patterns, which is impossible through the conventional BP(Back Propagation) algorithm. In addition, it is confirmed that the degradation trend could be easily traced in accordance with the degradation process. Therefore, it is expected to improve on-site applicability and to trace real-time degradation trends using SOM algorithm in the partial discharge pattern recognition

• 산업경영시스템학회지
• /
• 제23권61호
• /
• pp.137-146
• /
• 2000

One of the problems faced in implementing cellular manufacturing systems is machine-part group formation. This paper proposes machine-part grouping algorithms based on Self-Organizing Map(SOM) neural networks and K-Means algorithm in cellular manufacturing systems. Although the SOM spreads out input vectors to output vectors in the order of similarity, it does not always find the optimal solution. We rearrange the input vectors using SOM and determine the number of groups. In order to find the number of groups and grouping efficacy, we iterate K-Means algorithm changing k until we cannot obtain better solution. The results of using the proposed approach are compared to the best solutions reported in literature. The computational results show that the proposed approach provides a powerful means of solving the machine-part grouping problem. The proposed algorithm Is applied by simple calculation, so it can be for designer to change production constraints.

• 산업경영시스템학회지
• /
• 제21권48호
• /
• pp.123-132
• /
• 1998

The group formation problem of the machine and part is a very important issue in the planning stage of cellular manufacturing systems. This paper investigates Self-Organizing Map(SOM) neural networks approach to machine-part grouping problem. We present a two-phase algorithm based on SOM for grouping parts and machines. SOM can learn from complex, multi-dimensional data and transform them into visually decipherable clusters. Output layer in SOM network is one-dimensional structure and the number of output node has been increased sufficiently to spread out the input vectors in the order of similarity. The proposed algorithm performs remarkably well in comparison with many other algorithms for the well-known problems shown in previous papers.

• Journal of information and communication convergence engineering
• /
• 제8권6호
• /
• pp.609-617
• /
• 2010

This paper is concerned with the use of a selforganizing map (SOM) to estimate the desired channel states of an unknown digital communication channel for blind equalization. The modification of SOM is accomplished by using the Bayesian likelihood fitness function and the relation between the desired channel states and channel output states. At the end of each clustering epoch, a set of estimated clusters for an unknown channel is chosen as a set of pre-defined desired channel states, and used to extract the channel output states. Next, all of the possible desired channel states are constructed by considering the combinations of extracted channel output states, and a set of the desired states characterized by the maximal value of the Bayesian fitness is subsequently selected for the next SOM clustering epoch. This modification of SOM makes it possible to search the optimal desired channel states of an unknown channel. In simulations, binary signals are generated at random with Gaussian noise, and both linear and nonlinear channels are evaluated. The performance of the proposed method is compared with those of the "conventional" SOM and an existing hybrid genetic algorithm. Relatively high accuracy and fast search speed have been achieved by using the proposed method.