• Journal of Korea Spatial Information System Society
• /
• 제11권3호
• /
• pp.9-18
• /
• 2009

Recently, due to the advanced technologies of mobile devices and wireless communication, there are many studies on telematics and LBS(location-based service) applications. because moving objects usually move on spatial networks, their locations are updated frequently, leading to the degradation of retrieval performance. To manage the frequent updates of moving objects' locations in an efficient way, a new distributed grid scheme, called DS-GRID (distributed S-GRID), and k-NN(k-nearest neighbor) query processing algorithm was proposed[1]. However, the result of k-NN query processing technique may be invalidated as the location of query and moving objects are changed. Therefore, it is necessary to study on continuous k-NN query processing algorithm. In this paper, we propose both MCE-CKNN and MBP(Monitoring in Border Point)-CKNN algorithmss are S-GRID. The MCE-CKNN algorithm splits a query route into sub-routes based on cell and seproves retrieval performance by processing query in parallel way by. In addition, the MBP-CKNN algorithm stores POIs from the border points of each grid cells and seproves retrieval performance by decreasing the number of accesses to the adjacent cells. Finally, it is shown from the performance analysis that our CKNN algorithms achieves 15-53% better retrieval performance than the Kolahdouzan's algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국정보통신학회 2021년도 추계학술대회
• /
• pp.226-228
• /
• 2021

We propose a fall recognition system using the Pose Detection of Google ML kit using video data. Using the Pose detection algorithm, 33 three-dimensional feature points extracted from the body are used to recognize the fall. The algorithm that recognizes the fall by analyzing the extracted feature points uses k-NN. While passing through the normalization process in order not to be influenced in the size of the human body within the size of image and image, analyzing the relative movement of the feature points and the fall recognizes, thirteen of the thriteen test videos recognized the fall, showing an 100% success rate.

• The KIPS Transactions:PartB
• /
• 제13B권2호
• /
• pp.127-132
• /
• 2006

K-NN (k-Nearest Neighbors), which is a well-known instance-based learning algorithm, simply stores entire training patterns in memory, and uses a distance function to classify a test pattern. K-NN is proven to show satisfactory performance, but it is notorious formemory usage and lengthy computation. Various studies have been found in the literature in order to minimize memory usage and computation time, and NGE (Nested Generalized Exemplar) theory is one of them. In this paper, we propose RPA (Recursive Partition Averaging) and IRPA (Incremental RPA) which is an incremental version of RPA. RPA partitions the entire pattern space recursively, and generates representatives from each partition. Also, due to the fact that RPA is prone to produce excessive number of partitions as the number of features in a pattern increases, we present IRPA which reduces the number of representative patterns by processing the training set in an incremental manner. Our proposed methods have been successfully shown to exhibit comparable performance to k-NN with a lot less number of patterns and better result than EACH system which implements the NGE theory.

• Journal of Institute of Control, Robotics and Systems
• /
• 제19권11호
• /
• pp.998-1003
• /
• 2013

This study proposes an adaptive control algorithm for lateral motion of a UGV (Unmanned Ground Vehicle) using an NN (Neural Networks). The lateral motion of the UGV can be corrupted with various uncertainties such as side slip. In order to compensate the performance degradation of the UGV under various uncertainties, an NN-based adaptive control is designed by utilizing a virtual control concept. Since both the drift and input gain terms are uncertain, the proposed method adapts the whole terms related to the difference between the nominal and real systems. To avoid a singularity problem with the adaptive control, the affine property of the UGV dynamic model is utilized and the overall closed-loop stability is analyzed rigorously. Finally, numerical simulations using Carsim are performed to validate the effectiveness of the proposed scheme.

• Proceedings of the Korea Contents Association Conference
• /
• 한국콘텐츠학회 2007년도 추계 종합학술대회 논문집
• /
• pp.12-16
• /
• 2007

The function of a protein is closely co-related with its subcellular location(s). Given a protein sequence, therefore, how to determine its subcellular location is a vitally important problem. We have developed a new prediction method for protein subcellular location(s), which is based on n-gram feature extraction and k-nearest neighbor (kNN) classification algorithm. It classifies a protein sequence to one or more subcellular compartments based on the locations of top k sequences which show the highest similarity weights against the input sequence. The similarity weight is a kind of similarity measure which is determined by comparing n-gram features between two sequences. Currently our method extract penta-grams as features of protein sequences, computes scores of the potential localization site(s) using kNN algorithm, and finally presents the locations and their associated scores. We constructed a large-scale data set of protein sequences with known subcellular locations from the SWISS-PROT database. This data set contains 51,885 entries with one or more known subcellular locations. Our method show very high prediction precision of about 93% for this data set, and compared with other method, it also showed comparable prediction improvement for a test collection used in a previous work.

• The KIPS Transactions:PartB
• /
• 제8B권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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제32권10C호
• /
• pp.965-974
• /
• 2007

In this paper, we proposed the feature selection algorithm for multi-class genre classification. In our proposed algorithm, we developed GMM separation score based on Gaussian mixture model for measuring separability between two genres. Additionally, we improved feature subset selection algorithm based on sequential forward selection for multi-class genre classification. Instead of setting criterion as entire genre separability measures, we set criterion as worst genre separability measure for each sequential selection step. In order to assess the performance proposed algorithm, we extracted various features which represent characteristics such as timbre, rhythm, pitch and so on. Then, we investigate classification performance by GMM classifier and k-NN classifier for selected features using conventional algorithm and proposed algorithm. Proposed algorithm showed improved performance in classification accuracy up to 10 percent for classification experiments of low dimension feature vector especially.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 1998년도 하계학술대회 논문집 B
• /
• pp.560-562
• /
• 1998

A new approach to developing battery SOC indicator for electric vehicle is discussed in this paper. One of the most difficult problems associated with the development of electric vehicle is the battery indicator which reliably informs the state of charge(SOC) of the battery to the driver. And the condition to be satisfied with SOC indicator installed on the electric vehicle is that it should be used under frequently variable load. A new method to determining SOC using neural networks(NN) is proposed to satify the condition. The training data of NN are obtained by using mathematical model of lead-acid battery, and calculating discharge currents and terminal voltages while battery discharges with constant current. The 3-layered NN with back propagation algorithm is used Simulation results show that the proposed method is appropriate as SOC indicator of the battery.

• Proceedings of the KAIS Fall Conference
• /
• 한국산학기술학회 2003년도 Proceeding
• /
• pp.178-184
• /
• 2003

Case-based reasoning (CBR) often shows significant promise for improving effectiveness of complex and unstructured decision making. Consequently, it has been applied to various problem-solving areas including manufacturing, finance and marketing. However, the design of appropriate case indexing and retrieval mechanisms to improve the performance of CBR is still challenging issue. Most of previous studies to improve the effectiveness for CBR have focused on the similarity function or optimization of case features and their weights. However, according to some of prior researches, finding the optimal k parameter for k-nearest neighbor (k-NN) is also crucial to improve the performance of CBR system. Nonetheless, there have been few attempts which have tried to optimize the number of neighbors, especially using artificial intelligence (AI) techniques. In this study, we introduce a genetic algorithm (GA) to optimize the number of neighbors to combine. This study applies the new model to the real-world case provided by an online shopping mall in Korea. Experimental results show that a GA-optimized k-NN approach outperforms other AI techniques for purchasing behavior forecasting.

• The KIPS Transactions:PartD
• /
• 제8D권4호
• /
• pp.387-392
• /
• 2001

This Many software projects collect grouped failure data (failures in some failure interval or in variable time interval) rather than individual failure times or failure count data during the testing or operational phase. This paper presents the neural network (NN) modeling for grouped failure data that is able to predict cumulative failures in the variable future time. The two variant models of cascade-correlation learning (CasCor) algorithm are presented. Suggested models are compared with other well-known NN models and statistical software reliability growth models (SRGMs). Experimental results show that the suggested models show better predictability.