• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.346-348
• /
• 2004

급증하고 있는 인터넷 환경에서 정보보호는 가장 중요한 고려사항 중 하나이다. 특히, 인터넷의 발달로 빠르게 확산되고 있는 웜 바이러스는 현재 바이러스의 대부분을 차지하며, 다양한 종류의 바이러스들과 악성코드들을 네트워크에 전파시키고 있다 지금 이 순간도 웜 바이러스가 네트워크를 통해 확산되고 있지만, 웜 바이러스의 탐지가 응용레벨에서의 룰-매칭 방식에 근거하고 있기 때문에 신종이나 변종 웜 바이러스에 대해서 탐지가 난해하고, 감염된 이후에 탐지를 할 수밖에 없다는 한계를 가지고 있다. 본 연구에서는 신종이나 변종 웜 바이러스의 탐지가 가능하고, 네트워크 레벨에서 탐지할 수 있는 신경망의 인공지능 모델 중 SOFM을 이용한 웜 바이러스 탐지 방안을 제시한다.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2012.05a
• /
• pp.336-339
• /
• 2012

Accurate forecasting of pan evaporation (PE) is very important for monitoring, survey, and management of water resources. The purpose of this study is to develop and apply Kohonen self-organizing feature maps neural networks model (KSOFM-NNM) to forecast the daily PE for the dry climate region in south western Iran. KSOFM-NNM for Ahwaz station was used to forecast daily PE on the basis of temperature-based, radiation-based, and sunshine duration-based input combinations. The measurements at Ahwaz station in south western Iran, for the period of January 2002 - December 2008, were used for training, cross-validation and testing data of KSOFM-NNM. The results obtained by TEM 1 produced the best results among other combinations for Ahwaz station. Based on the comparisons, it was found that KSOFM-NNM can be employed successfully for forecasting the daily PE from the limited climatic data in south western Iran.

• The KIPS Transactions:PartB
• /
• v.11B no.4
• /
• pp.471-476
• /
• 2004

Recently, provides information which is most necessary to the user the research against the web information recommendation system for the Internet shopping mall is actively being advanced. the back which it will drive in the object. In that Dynamic Web Recommendation Method Using SOM (Self-Organizing Feature Maps) has the advantages of speedy execution and simplicity but has the weak points such as the lack of explanation on models and fired weight values for each node of the output layer on the established model. The method proposed in this study solves the lack of explanation using the Bayesian reasoning method. It does not give fixed weight values for each node of the output layer. Instead, the distribution includes weight using Hybrid SOM. This study designs and implements Dynamic Web Recommendation Method Using Hybrid SOM. The result of the existing Web Information recommendation methods has proved that this study's method is an excellent solution.

• 제어로봇시스템학회:학술대회논문집
• /
• 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...

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.4
• /
• pp.451-455
• /
• 2009

This paper provides a comparison of global path planning method in single string by using pulled and pushed SOFM (Self-Organizing Feature Map) which is a method among a number of neural network. The self-organizing feature map uses a randomized small valued initial-weight-vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. On the other hand, the modified SOFM method in this research uses a predetermined initial weight vectors of the one dimensional string, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are move toward or reverse the input vector, by rising a pulled- or a pushed-SOFM. According to simulation results one can conclude that the modified neural networks in single string are useful tool for the global path planning problem of a mobile robot. In comparison of the number of iteration for converging to the solution the pushed-SOFM is more useful than the pulled-SOFM in global path planning for mobile robot.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.2
• /
• pp.101-112
• /
• 1995

In order to construct a feature map-based phoneme classification system for speech recognition, two procedures are usually required. One is clustering and the other is labeling. In this paper, we present a phoneme classification system based on the Kohonen's Self-Organizing Feature Map (SOFM) for clusterer and labeler. It is known that the SOFM performs self-organizing process by which optimal local topographical mapping of the signal space and yields a reasonably high accuracy in recognition tasks. Consequently, SOFM can effectively be applied to the recognition of phonemes. Besides to improve the performance of the phoneme classification system, we propose the learning algorithm combined with the classical K-mans clustering algorithm in fine-tuning stage. In order to evaluate the performance of the proposed phoneme classification algorithm, we first use totaly 43 phonemes which construct six intra-class feature maps for six different phoneme classes. From the speaker-dependent phoneme classification tests using these six feature maps, we obtain recognition rate of $87.2\%$ and confirm that the proposed algorithm is an efficient method for improvement of recognition performance and convergence speed.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.8
• /
• pp.64-70
• /
• 1993

This paper presents an efficient SOFM(self-organizing feature map) algorithm for the solution of the large scale TSPs(traveling salesman problems). Because no additional winner neuron for each city is created in the next competition, the proposed algorithm requires just only the N output neurons and 2N connections, which are fixed during the whole process, for N-city TSP, and it does not requires any extra algorithm of creation of deletion of the neurons. And due to direct exploitation of the output potential in adaptively controlling the neighborhood, the proposed algorithm can obtain higher convergence rate to the suboptimal solutions. Simulation results show about 30% faster convergence and better solution than the conventional algorithm for solving the 30-city TSP and even for the large scale of 1000-city TSPs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.600-611
• /
• 1996

Recently, neural network-based speech recognition has been studied to utilize the adaptivity and learnability of neural network models. However, conventional neural network models have difficulty in the co-articulation processing and the boundary detection of similar phonmes of the Korean speech. Also, in case of using one phonotopic map, learning speed may dramatically increase and inaccuracies may be caused because homogeneous learning and recognition method should be applied for heterogenous data. Hence, in this paper, a neural net typewriter has been designed using a hierarchical self-organizing classifier(HSOC), and related algorithms are presented. This HSOC, during its learing stage, distributed phoneme data on hierarchically structured multiple phonotopic maps, using Kohonen's self-organizing feature maps(SOFM). Presented and experimented in this paper were the algorithms for deciding the number of maps, map sizes, the selection of phonemes and their placement per map, an approapriate learning and preprocessing method per map. If maps are divided according to a priorlinguistic knowledge, we would have difficulty in acquiring linguistic knowledge and how to alpply it(e.g., processing extended phonemes). Contrarily, our HSOC has an advantage that multiple phonotopic maps suitable for given input data are self-organizable. The resulting three korean phonotopic maps are optimally labelled and have their own optimal preprocessing schemes, and also confirm to the conventional linguistic knowledge.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.223-230
• /
• 2003

Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R＊-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R＊-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R＊-tree combines SOM and R＊-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R＊-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R＊-tree with that of an SOM and an R＊-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R＊-tree outperforms both the SOM and R＊-tree due to the reduction of the number of nodes required to build R＊-tree and retrieval time cost.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.3
• /
• pp.382-392
• /
• 1999

Industrial robots have increased in both the number and applications in today's material handling systems. However, traditional approaches to robot controling have had limited success in complicated environment, especially for real time applications. One of the main reasons for this is that most traditional methods use a set of kinematic equations to figure out the physical environment of the robot. In this paper, a neural network model to solve robot manipulator's inverse kinematics problem is suggested. It is composed of two Self-Organizing Feature Maps by which the workspace of robot environment and the joint space of robot manipulator is inter-linked to enable the learning of the inverse kinematic relationship between workspace and joint space. The proposed model has been simulated with two robot manipulators, one, consisting of 2 links in 2-dimensional workspace and the other, consisting of 3 links in 2-dimensional workspace, and the performance has been tested by accuracy of the manipulator's positioning and the response time.