• Proceedings of the KIPE Conference
• /
• 2005.07a
• /
• pp.624-627
• /
• 2005

This paper presents a new data classification method using the Robbins Monro stochastic approximation algorithm k-nearest neighbor and distribution analysis. To cluster the data set, we decide the centroid of the test data set using k-nearest neighbor algorithm and the local area of data set. To decide each class of the data, the Robbins Monro stochastic approximation algorithm is applied to the decided local area of the data set. To evaluate the performance, the proposed classification method is compared to the conventional fuzzy c-mean method and k-nn algorithm. The simulation results show that the proposed method is more accurate than fuzzy c-mean method, k-nn algorithm and discriminant analysis algorithm.

• KIISE Transactions on Computing Practices
• /
• v.21 no.4
• /
• pp.327-332
• /
• 2015

Constructing a k-nearest neighbor (k-NN) graph is a primitive operation in the field of recommender systems, information retrieval, data mining and machine learning. Although there have been many algorithms proposed for constructing a k-NN graph, either the existing approaches cannot be used for various types of similarity measures, or the performance of the approaches is decreased as the number of nodes or dimensions increases. In this paper, we present a novel algorithm for k-NN graph construction based on "balanced" canopy clustering. The experimental results show that irrespective of the number of nodes or dimensions, our algorithm is at least five times faster than the brute-force approach while retaining an accuracy of approximately 92%.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.581-586
• /
• 2003

This paper presents control designs using neural networks (NN) for a XY positioning table. The proposed neurocontroller is composed of an outer PD tracking loop for stabilization of the fast flexible-mode dynamics and an NN inner loop used to compensate for the system nonlinearities. A tuning algorithm is given for the NN weights, so that the NN compensation scheme becomes adaptive, guaranteeing small tracking errors and bounded weight estimates. Formal nonlinear stability proofs are given to show that the tracking error is small. The proposed neuro-controller is implemented and tested on an IBM PC-based XY positioning table, and is applicable to many precision XY tables. The algorithm, simulation, and experimental results are described. The experimental results are shown to be superior to those of conventional control.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.512-514
• /
• 2011

본 논문에서는 스펙트럼 회복의 수단으로써 신경회로망을 사용하여 푸리에변환(FFT) 진폭성분 및 위상성분을 복원하는 알고리즘을 제안한다. 본 논문에서는 먼저 각 프레임의 FFT 진폭성분들을 유성음 구간과 무성음 구간으로 검출한 후, 유성음 및 무성음 구간에 대해서 각 프레임의 FFT 진폭성분들을 저역, 중역 및 고역으로 각각 분리한 후에 각 대역의 FFT 진폭성분들을 저역용 신경회로망(NN), 중역용 NN, 그리고 고역용 NN의 입력으로 하여 각 NN에 학습시킴으로써 최종 FFT 진폭성분들을 구한다. 본 실험에서는 Aurora2 데이터베이스를 사용하여 FFT의 진폭성분을 복원하는 잡음제거의 알고리즘을 사용하여 여러 잡음에 대해서 본 알고리즘의 유효성을 실험적으로 확인한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.187-190
• /
• 1995

A method is proposed which searches for optimal structures of Neural Networks (NN) using Genetic Algorithm (GA). The purpose of the method lies in not only finding an optimal NN structure but also leading us to the goal of self-organized control system that acquires its structure and its functionality by itself depending on its environment.

• Journal of Integrative Natural Science
• /
• v.7 no.1
• /
• pp.57-61
• /
• 2014

This study measured the stream data from the several sensors, and stores the database in MapReduce framework environment, and it aims to design system with the small performance and cluster analysis error rate through the KMSVM algorithm. Through the KM-SVM algorithm, the cluster analysis effective data was used for U-health system. In the results of experiment by using 2003 data sets obtained from 52 test subjects, the k-NN algorithm showed 79.29% cluster analysis accuracy, K-means algorithm showed 87.15 cluster analysis accuracy, and SVM algorithm showed 83.72%, KM-SVM showed 90.72%. As a result, the process speed and cluster analysis effective ratio of KM-SVM algorithm was better.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2003.07b
• /
• pp.1163-1167
• /
• 2003

As a PD classification method, statistical distribution parameters have been used during several ten years. And this parameters are recently finger print method, NN(Neural Network) and etc. So in this paper we studied finger print method and NN with BP(Back propagation) learning algorithm using the statistical distribution parameter, and compared with two method as classification method. As a result of comparison, classification of NN is more good result than Finger print method in respect to calculation speed, visible effect and simplicity. So, NN has more advantage as a tool for PD classification.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2000.11b
• /
• pp.124-131
• /
• 2000

In this study, the NEURAL NETWORK (hereinafter referred to as NN) was applied to control of the nonlinear factors for turning movement of the crawler vehicle and experiment was carried out using a small model of crawler vehicle in order to inspect an application of NN. Furthermore, CHAOS NEURAL NETWORK (hereinafter referred to as CNN) was also applied to this control so as to compare with conventional NN. CNN is especially effective for plane in many variables with local minimum which conventional NN is apt to fall into, and it is relatively useful to nonlinear factors. Experiment of turning on the slope of crawler vehicle was performed in order to estimate an adaptability of nonlinear problems by NN and CNN. The inclination angles of the road surface which the vehicles travel on, were respectively 4deg, 8deg, 12deg. These field conditions were selected by the object for changing nonlinear magnitude in turning phenomenon of vehicle. Learning of NN and CNN was carried out by referring to positioning data obtained from measurement at every 15deg in turning. After learning, the sampling data at every 15deg were interpolated based on the constructed learning system of NN and CNN. Learning and simulation programs of NN and CNN were made by C language ("Association of research for algorithm of calculating machine (1992)"). As a result, conventional NN and CNN were available for interpolation of sampling data. Moreover, when nonlinear intensity is not so large under the field condition of small slope, interpolation performance of CNN was a little not so better than NN. However, when nonlinear intensity is large under the field condition of large slope, interpolation performance of CNN was relatively better than NN.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.215-221
• /
• 2005

TRecently, there has been enormous growth in the amount of commercial and scientific data, such as protein sequences, retail transactions, and web-logs. Such datasets consist of sequence data that have an inherent sequential nature. In this Paper, we study how to classify these sequence datasets. There are several kinds techniques for data classification such as decision tree induction, Bayesian classification and K-NN etc. In our approach, we use a K-NN algorithm for classifying sequences. In addition, we propose a new similarity measure to compute the similarity between two sequences and an efficient method for measuring similarity.

• Journal of Korea Game Society
• /
• v.8 no.3
• /
• pp.87-95
• /
• 2008

This paper proposes an algorithm for efficient behaviors of boids which freely move and have no predefined position. By finding the kNN and computing the value of behavioral characteristic of a boid approximately, the proposed algorithm improves the conventional spatial partitioning one. To do this, this paper defines and uses the representative boid which has the average direction and position for a group of boids. The proposed algorithm was implemented and compared with the conventional one experimentally. The results of the experimental comparisons show that the proposed algorithm outperforms the conventional one about $-5{\sim}130%$ in terms of the ratio of the number of rendering frames per the second.