• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.515-522
• /
• 2001

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 Map(SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space. 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. We implemented about k-NN search for similar image classification as to (1) access to topological feature map, and (2) apply to pruning strategy of high speed search. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.1
• /
• pp.143-159
• /
• 1998

This paper proposes a new type of fuzzy approximate reasoning method that combines a self organizing feature map and a fuzzy logic. Previous methods considered only input part to determine the number of fuzzy rules, while this paper considers both input and output parts simultaneously. Our approach proved to improve the inference performance. We also developed a new index for avoiding overlearning which guarantees more accurate results. Experimental results showed that our approach surpasses the performance of Takagi & Hayashi (1991) approach.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.180-188
• /
• 1995

A modified Kohonen's self-organizing feature map (SOFM) algorithm which has binary reinforcement function and a constant learning rate is proposed. In contrast to the time-varing adaptaion gain of the original Kohonen's SOFM algorithm, the proposed algorithm uses a constant adaptation gain, and adds a binary reinforcement function in order to compensate for the lowered learning ability of SOFM due to the constant learning rate. Since the proposed algorithm does not have the complicated multiplication, it's digital hardware implementation is much easier than that of the original SOFM.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2003.10a
• /
• pp.170-177
• /
• 2003

Gene expression data are the quantitative measurements of expression levels and ratios of numberous genes in different situations based on microarray image analysis results. The process to draw meaningful information related to genomic diseases and various biological activities from gene expression data is known as gene expression data analysis. In this paper, we present a hierarchical clustering method of gene expression data based on self organizing map which can analyze the clustering result of gene expression data more efficiently. Using our proposed method, we could eliminate the uncertainty of cluster boundary which is the inherited disadvantage of self organizing map and use the visualization function of hierarchical clustering. And, we could process massive data using fast processing speed of self organizing map and interpret the clustering result of self organizing map more efficiently and user-friendly. To verify the efficiency of our proposed algorithm, we performed tests with following 3 data sets, animal feature data set, yeast gene expression data and leukemia gene expression data set. The result demonstrated the feasibility and utility of the proposed clustering algorithm.

• 유체기계공업학회:학술대회논문집
• /
• 1999.12a
• /
• pp.317-323
• /
• 1999

The necessity of diagnosis of the rotating machinery which is widely used in the industry is increasing. Many research has been conducted to manipulate field vibration signal data for diagnosing the fault of designated machinery. As the pattern recognition tool of that signal, neural network which use usually back-propagation algorithm was used in the diagnosis of rotating machinery. In this paper, self-organizing feature map(SOFM) which is unsupervised learning algorithm is used in the abnormal vibration diagnosis of rotating machinery and then learning vector quantization(LVQ) which is supervised teaming algorithm is used to improve the quality of the classifier decision regions.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.768-772
• /
• 1991

The Self Creating and organizing (SCO) is a new architecture and one of the unsupervized learning algorithm for the artificial neural network. SCO begins with only one output node which has a sufficiently wide response range, and the response ranges of all the nodes decrease with time. Self Creating and Organizing Neural Network (SCONN) decides automatically whether adapting the weights of existing node or creating a new node. It is compared to the Kohonen's Self Organizing Feature Map (SOFM). The results show that SCONN has lots of advantages over other competitive learning architecture.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.358-366
• /
• 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 high speed 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 and generates a topological feature map. A topological feature map preserves the mutual relations (similarities) in feature spaces of input data, and clusters mutually similar feature vectors in a neighboring nodes. Therefore each node of the topological feature map holds a node vector and similar images that is closest to each node vector. We implemented a k-NN search for similar image classification as to (1) access to topological feature map, and (2) apply to pruning strategy of high speed search. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.2
• /
• pp.65-76
• /
• 1994

The most effective computer algorithms for facility layout that have been found are mainly based on the improvement heuristic such as CRAFT. In this paper, we present a new algorithm which is based on the Kohonen neual network. The algorithm firstly forms a self-organizing feature map where the most important similarity relationships among the facilities are converted into their spatial relationships. A layout is then obtained by a minor adjustment to the map. Some simulation results are given to show the performance of the algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.42.6-42
• /
• 2002

Kohonen's self organizing feature map (SOFM) converts arbitrary dimensional patterns into one or two dimensional arrays of nodes. Among the many competitive learning algorithms, SOFM proposed by Kohonen is considered to be powerful in the sense that it not only clusters the input pattern adaptively but also organize the output node topologically. SOFM is usually used for a preprocessor or cluster. It can perform dimensional reduction of input patterns and obtain a topology-preserving map that preserves neighborhood relations of the input patterns. The traditional SOFM algorithm[1] is a competitive learning neural network that maps inputs to discrete points that are called nodes on a lattice...

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.2
• /
• pp.276-283
• /
• 1994

Using a neural network for vector quantization, we can expect to have better codebook design algorithm for its adaptive process. Also, the designed codebook puts the codewords in order by its self-organizing characteristics, which makes it possible to partially search the codebook for real time process. To exploit these features of the neural network, in this paper, we propose a new codebook design algorithm that modified the KSFM(Kohonen`s Self-organizing Feature Map) and then combines the K-means algorithm. Experimental results show the performance improvment and the ability of the partical seach of the codebook for the real time process.