• Proceedings of the Korean Society of Computer Information Conference
• /
• 2015.07a
• /
• pp.250-251
• /
• 2015

본 논문에서는 자기 조직화 기능을 갖는 Kohonen의 SOM(Self organization map) 신경회로망과 주어지는 데이터에 따라 초기의 클러스터 개수를 설정하여 처리하는 수정된 K-Means 알고리즘을 결합한 Hybrid Kohonen Network 를 제안한다. 또한, 실제의 항공영상에 적용하여 고전적인 K-Means 알고리즘 및 고전적인 SOM 알고리즘보다 우수함을 보인다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.322-325
• /
• 2002

We proposed a method to improve KCN's problems. Proposed method adjusts neighborhood and teaming rate by fuzzy logic system. The input of fuzzy logic system used a distance and a change rate of distance. The output was used by site of neighborhood and learning rate. The rule base of fuzzy logic system was taken by using KCN simulation results. We used Anderson's Iris data to illustrate this method, and simulation results showed effect of performance.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10b
• /
• pp.233-237
• /
• 2006

This study proposes an innovative measure for evaluating the performance of text clustering. In using K-means algorithm and Kohonen Networks for text clustering, the number clusters is fixed initially by configuring it as their parameter, while in using single pass algorithm for text clustering, the number of clusters is not predictable. Using labeled documents, the result of text clustering using K-means algorithm or Kohonen Network is able to be evaluated by setting the number of clusters as the number of the given target categories, mapping each cluster to a target category, and using the evaluation measures of text. But in using single pass algorithm, if the number of clusters is different from the number of target categories, such measures are useless for evaluating the result of text clustering. This study proposes an evaluation measure of text clustering based on intra-cluster similarity and inter-cluster similarity, what is called CI (Clustering Index) in this article.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.591-593
• /
• 1995

Artificial neural network based pattern recognition method is one of the most probable candidate for on-line power system transient stability analysis. Especially, Kohonen layer is an adequate neural network for the purpose. Each node of Kehonen layer competes on the basis of which of them has its clustering center closest to an input vector. This paper discusses Kohonen's LVQ(Learning Victor Quantization) and points out a defection of the algorithm when applied to the transient stability analysis. Only the clustering centers located near the decision boundary of the stability region is needed for the stability criterion and the centers far from the decision boundary are redundant. This paper presents a new algorithm ratted boundary searching algorithm II which assigns only the points that are near the boundary in an input space to nodes or Kohonen layer as their clustering centers. This algorithm is demonstrated with satisfaction using 4-generator 6-bus sample power system.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.134-138
• /
• 1998

Unification of Kohone SOM(Self-Organizing Maps) neural network with the branch-and-bound algorithm is presented for clustering large set of patterns. The branch-and-bound search technique is employed for designing coarse neural network learning paradaim. Those unification can be use for clustering or calssfication of large patterns. For classfication purposes further usefulness is possible, since only two clusters exists in the SOM neural network of each nodes. The result of experiments show the fast learning time, the fast recognition time and the compactness of clustering.

• The Journal of Information Technology
• /
• v.8 no.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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.316-318
• /
• 2001

본 논문에서는 자기조직화 형상지도(Self-organizing Feature Maps)를 사용하여 움직이는 물체에 대해 움직임의 특성을 자동으로 분석하였다. Kohonen Network는 자기조직을 형성하는 unsupervised learning 알고리즘으로서, 이 논문에서는 생태계에서의 데이터를 Patternizing하고, Clustering 하는데 사용한다. 본 논문에서 Kohonen 신경망의 학습에 사용한 데이터는 CCD 카메라로 물고기의 움직임을 추적한 좌표 데이터이며, diazinon 0.1 ppm을 처리한 물고기 점 데이터와 처리하지 않은 점 데이터를 각각 낮.밤 약 10시간동안 수집하여, \circled1처리전 낮 데이터 \circled2처리전 밤 데이터 \circled3처리전 낮 데이터 \circled4처리후 밤 데이터 각각 4개의 group으로 분류한 후, Kohonen Network을 사용하여 물고기의 행동 차이를 분석하였다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.05a
• /
• pp.207-210
• /
• 2000

학습법칙은 신경회로망의 성능을 좌우하는 중요한 요소의 하나이다. Kohonen의 합습법칙등이 개발되어 사용되어 왔으나 Underutilization 문제가 있어 실제 사용사에 문제가 있어 왔다. 본 논문에서 제시하는 학습법칙은 이를 부분적으로 해결하였다. 또한 이 학습법칙을 ART(Adaptive Resonance Theory)-1과 Kohonen의 자기 구조 특징 지도의 장점을 조합한 개선된 IAFC(Integrated Adaptive Fuzzy Clustering) 신경회로망에 적용하였고, 성능을 평가하기 위해 가우시안 분포의 데이터와 IRIS 데이터를 각각 사용하여 실험하였다.

• Journal of Korea Game Society
• /
• v.9 no.1
• /
• pp.105-114
• /
• 2009

In the game of Go, the life-and-death problem is a fundamental problem to be definitely overcome when implementing a computer Go program. To solve local Go problems such as life-and-death problems, an important consideration is how to tackle the game tree's huge branching factor and its depth. The basic idea of the experiment conducted in this article is that we modelled the human behavior to get the recognized first moves to kill the surrounded group. In the game of Go, similar life-and-death problems(patterns) often have similar solutions. To categorize similar patterns, we implemented Kohonen Neural Network(KNN) based clustering and found that the experimental result is promising and thus can compete with a pattern matching method, that uses supervised learning with a neural network, for solving life-and-death problems.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.2
• /
• pp.35-54
• /
• 2009

The recent economic crisis not only reduces the profit of department stores but also incurs the significance losses caused by the increasing late-payment rate of credit cards. Under this pressure, the scope of credit prediction needs to be broadened from the simple prediction of whether this customer has a good credit or not to the accurate prediction of how much profit can be gained from this customer. This study classifies the delinquent customers of credit card in a Korean department store into homogeneous clusters. Using this information, this study analyzes the repayment patterns for each cluster and develops the credit prediction system to manage the delinquent customers. The model presented by this study uses Kohonen network, which is one of artificial neural networks of data mining technique, to cluster the credit delinquent customers into clusters. Cox proportional hazard model is also used, which is one of survival analysis used in medical statistics, to analyze the repayment patterns of the delinquent customers in each cluster. The presented model estimates the repayment period of delinquent customers for each cluster and introduces the influencing variables on the repayment pattern prediction. Although there are some differences among clusters, the variables about the purchasing frequency in a month and the average number of installment repayment are the most predictive variables for the repayment pattern. The accuracy of the presented system leaches 97.5%.