• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.464-469
• /
• 2001

CRM(Customer Relationship Management : CRM) is an advanced marketing supporting system which analyze customers\` transaction data and classify or target customer groups to effectively increase market share and profit. Many engines were developed to implements the function and those for classification and clustering are considered core ones. In this study, an improved clustering method based on SOM(Self-Organizing Maps : SOM) is proposed. The proposed clustering method finds the optimal number of clusters so that the effectiveness of clustering is increased. It considers all the data types existing in CRM data warehouses. In particular, and adaptive algorithm where the concepts of degeneration and fusion are applied to find optimal number of clusters. The feasibility and efficiency of the proposed method are demonstrated through simulation with simplified data of customers.

• Journal of applied mathematics & informatics
• /
• v.9 no.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.

• The Korean Journal of Applied Statistics
• /
• v.18 no.1
• /
• pp.83-98
• /
• 2005

Exploring distributional patterns of multivariate data is very essential in understanding the characteristics of given data set, as well as in building plausible models for the data. For that purpose, low-dimensional visualization methods have been developed by many researchers along various directions. As one of methods, Kohonen's SOM (Self-Organizing Map) is prominent. SOM compresses the volume of the data, yields abstraction from the data and offers visual display on low-dimensional grids. Although it is proven quite effective, it has one undesirable property: SOM's display is discrete. In this study, we propose two techniques for enhancing quality of SOM's display, so that SOM's display becomes continuous. The proposed methods are demonstrated in two numerical examples.

• The Korean Journal of Applied Statistics
• /
• v.22 no.2
• /
• pp.415-424
• /
• 2009

As one of the unsupervised learning neural network methods, self-organizing maps(SOM) are applied to various fields. It reduces the dimension of multidimensional data by representing observations on the low dimensional manifold. On the other hand, the minimal spanning tree(MST) of a graph that achieves the most economic subset of edges connecting all components by a single open loop. In this study, we apply the MST technique to SOM with subnodes. We propose SOM's with embedded MST and a distance measure for optimum choice of the size and shape of the map. We demonstrate the method with Fisher's Iris data and a real gene expression data. Simulated data sets are also analyzed to check the validity of the proposed method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.9
• /
• pp.849-854
• /
• 2001

GTM(Generative Topographic Mapping) model is a probabilistic version of the SOM(Self Organizing Maps) which was proposed by T. Kohonen. The GTM is modelled by latent or hidden variables of probability distribution of data. It is a unique characteristic not implemented in SOM model, and, therefore, it is possible with GTM to analyze data accurately, thereby overcoming the limits of SOM. In the present investigation we proposed a BGTM(Bayesian GTM) combined with Bayesian learning and GTM model that has a small mis-classification ratio. By combining fast calculation ability and probabilistic distribution of data of GTM with correct reasoning based on Bayesian model, the BGTM model provided improved results, compared with existing models.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.1
• /
• pp.41-48
• /
• 2007

In this paper, we propose an optimal placement of sensor nodes with 2.4GHz wireless channel characteristics. The proposed method determines optimal transmission range based on log-normal path loss model, and optimal number of sensor nodes calculating the density of sensor nodes. For the lossless data transmission, we search the optimal locations with self-organizing feature maps(SOM) using transmission range, and number of sensor nodes. We demonstrate that optimal transmission range is 20m, and optimal number of sensor nodes is 8. We performed simulations on the searching for optimal locations and confirmed the link condition of sensor nodes.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.4
• /
• pp.360-367
• /
• 2002

The machine-part group formation is to group the sets of parts having similar processing requirements into part families, and the sets of machines needed to process a particular part family into machine cells. The purpose of this study is to develop a two-phase machine-part group formation algorithm based on Self-Organizing Maps (SOM). In phase I, it forms machine cells from the machine-part incidence matrix by means of SOM whose output layer is one-dimension and the number of output nodes is the twice as many as the number of input nodes in order to spread out the input vectors. In phase II, it generates part families which are assigned to machine cells by means of machine ratio related with processing part and it gives machine-part group formation. The proposed algorithm performs remarkably well in comparison with many well-known algorithms for the machine-part group formation problems.

• Journal of the Korea Institute of Building Construction
• /
• v.12 no.6
• /
• pp.664-673
• /
• 2012

Determining the layout of temporary facilities that support construction activities at a site is an important planning activity, as layout can significantly affect cost, quality of work, safety, and other aspects of the project. The construction site layout problem involves difficult combinatorial optimization. Recently, various artificial intelligence(AI)-based algorithms have been applied to solving many complex optimization problems, including neural networks(NN), genetic algorithms(GA), and swarm intelligence(SI) which relates to the collective behavior of social systems such as honey bees and birds. This study proposes a site facility layout optimization algorithm based on self-organizing maps(SOM). Computational experiments are carried out to justify the efficiency of the proposed method and compare it with particle swarm optimization(PSO). The results show that the proposed algorithm can be efficiently employed to solve the problem of site layout.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.285-290
• /
• 2006

본 논문에서는 출입국자 관리의 효율성과 체계적인 출입국 관리를 위하여 여권 코드를 자동으로 인식하고 위조 여권을 판별할 수 있는 여권 인식 및 얼굴 인증 방법을 제안한다. 본 논문의 구성은 여권 인식과 얼굴 인증 부분으로 구성되며, 여권 인식 부분에서는 소벨 연산자, 수평 최소값 필터 등을 적용한 후, 8 방향 윤곽선 추적 알고리즘을 적용하여 코드의 문자열 영역을 추출하고 기울기를 보정한다. 추출된 문자열은 반복 이진화 방법을 적용하여 코드의 문자열 영역을 이진화 한다. 이진화된 문자열 영역에 대해 8 방향 윤곽선 추적 알고리즘을 적용하여 개별 코드를 추출한 후에 SOM(Self-Organizing Maps) 알고리즘을 적용하여 여권 코드를 인식한다. 얼굴 인증 부분에서는 여권 사진 영역의 특징을 이용하여 얼굴 후보 영역을 추출한 후, RGB와 YCbCr 색공간에서 피부색 정보를 이용하여 얼굴 영역을 추출한다. 추출된 얼굴 영역은 PCA(Principal Component Analysis) 알고리즘을 적용하여 특징 벡터를 구하고 여권 코드가 인식된 결과를 바탕으로 여권 소지자의 데이터 베이스에 있는 얼굴 영상의 특징벡터와의 거리 값을 계산하여 사진 위조 여부를 판별한다. 제안된 여권 인식 및 얼굴 인증 방법의 성능 평가를 위하여 원본 여권의 얼굴 부분을 위조한 여권과 기울어진 여권 영상을 대상으로 실험한 결과, 제안된 방법이 여권의 코드 인식 및 얼굴 인증에 있어서 우수한 성능이 있음을 확인하였다.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.928-931
• /
• 2002

Network based intrusion detection system is a computer network security tool. In this paper, we present an intrusion detection system based on Self-Organizing Maps (SOM) and Resilient Propagation Neural Network (RPROP) for visualizing and classifying intrusion and normal patterns. We introduce a cluster matching equation for finding principal associated components in component planes. We apply data from The Third International Knowledge Discovery and Data Mining Tools Competition (KDD cup'99) for training and testing our prototype. From our experimental results with different network data, our scheme archives more than 90 percent detection rate, and less than 5 percent false alarm rate in one SYN flooding and two port scanning attack types.