• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.7
• /
• pp.828-833
• /
• 2005

Kernel methods have shown to improve the performance of conventional linear classification algorithms for complex distributed data sets, as mapping the data in input space into a higher dimensional feature space(7). In this paper, we propose a fuzzy kernel K-nearest neighbor(fuzzy kernel K-NN) algorithm, which applies the distance measure in feature space based on kernel functions to the fuzzy K-nearest neighbor(fuzzy K-NN) algorithm. In doing so, the proposed algorithm can enhance the Performance of the conventional algorithm, by choosing an appropriate kernel function. Results on several data sets and segmentation results for real images are given to show the validity of our proposed algorithm.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.6
• /
• pp.430-439
• /
• 2016

Estimation and analysis of traffic jams plays a vital role in an intelligent transportation system and advances safety in the transportation system as well as mobility and optimization of environmental impact. For these reasons, many researchers currently mainly focus on the brilliant machine learning-based prediction approaches for traffic prediction systems. This paper primarily addresses the analysis and comparison of prediction accuracy between two machine learning algorithms: Naïve Bayes and K-Nearest Neighbor (K-NN). Based on the fact that optimized estimation accuracy of these methods mainly depends on a large amount of recounted data and that they require much time to compute the same function heuristically for each action, we propose an approach that applies multi-threading to these heuristic methods. It is obvious that the greater the amount of historical data, the more processing time is necessary. For a real-time system, operational response time is vital, and the proposed system also focuses on the time complexity cost as well as computational complexity. It is experimentally confirmed that K-NN does much better than Naïve Bayes, not only in prediction accuracy but also in processing time. Multi-threading-based K-NN could compute four times faster than classical K-NN, whereas multi-threading-based Naïve Bayes could process only twice as fast as classical Bayes.

• Journal of KIISE
• /
• v.42 no.11
• /
• pp.1303-1313
• /
• 2015

MapReduce provides high levels of system scalability and fault tolerance for large-size data processing. A MapReduce-based k-nearest-neighbor(k-NN) join algorithm seeks to produce the k nearest-neighbors of each point of a dataset from another dataset. The algorithm has been considered important in bigdata analysis. However, the existing k-NN join query-processing algorithm suffers from a high index-construction cost that makes it unsuitable for the processing of bigdata. To solve the corresponding problems, we propose a new grid-based, k-NN join query-processing algorithm. Our algorithm retrieves only the neighboring data from a query cell and sends them to each MapReduce task, making it possible to improve the overhead data transmission and computation. Our performance analysis shows that our algorithm outperforms the existing scheme by up to seven-fold in terms of the query-processing time, while also achieving high extent of query-result accuracy.

• Journal of KIISE:Databases
• /
• v.36 no.3
• /
• pp.215-225
• /
• 2009

Recently, various methods have been proposed to process k-NN (k-Nearest Neighbors) queries efficiently. However the previous methods have problems that they access additional cells unnecessarily and spend the high computation cost to find the nearest cells. In this paper, to overcome the problems, we propose a new method to process k-NN queries using the patterns of the distance relationship between the cells in a grid. The patterns are composed of the relative coordinates of cells sorted by the distance from certain points. Since the proposed method finds the nearest cells to process k-NN queries with traversing the patterns sequentially, it saves the computation cost. It is shown through the various experiments that out proposed method is much better than the existing method, CPM, in terms of the query processing time and the storage overhead.

• 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%.

• Computers and Concrete
• /
• v.16 no.6
• /
• pp.919-932
• /
• 2015

This paper presents a new method for assessing the three-point-bending (3PB) strength of mortar beams in a non-destructive manner, based on neural network (NN) models. The models are based on the radial basis function (RBF) architecture and the fuzzy means algorithm is employed for training, in order to boost the prediction accuracy. Data for training the models were collected based on a series of experiments, where the cement mortar beams were subjected to various bending mechanical loads and the resulting pressure stimulated currents (PSCs) were recorded. The input variables to the NN models were then calculated by describing the PSC relaxation process through a generalization of Boltzmannn-Gibbs statistical physics, known as non-extensive statistical physics (NESP). The NN predictions were evaluated using k-fold cross-validation and new data that were kept independent from training; it can be seen that the proposed method can successfully form the basis of a non-destructive tool for assessing the bending strength. A comparison with a different NN architecture confirms the superiority of the proposed approach.

• Journal of Integrative Natural Science
• /
• v.10 no.3
• /
• pp.162-170
• /
• 2017

In this paper, it is aim to implement a wheelchair monitoring system that provides users with customized medical services easily in everyday life, together with mobility guarantee, which is the most basic requirement of the elderly and disabled persons with physical disabilities. The case-based intelligent wheelchair monitoring system proposed in this study is based on a case-based k-NN algorithm, which implements a system for constructing and inferring examples of various biometric and environmental information of wheelchair users as a knowledge database and a monitoring interface for wheelchair users. In order to confirm the usefulness of the case-based k-NN algorithm, the SVM algorithm showed an average accuracy of 84.2% and the average accuracy of the proposed case-based k-NN algorithm was 86.2% And showed higher performance in terms of accuracy. The system implemented in this paper has the advantage of measuring biometric information and data communication regardless of time and place and it can provide customized service of wheelchair user through user friendly interface.

• Sleep Medicine and Psychophysiology
• /
• v.21 no.2
• /
• pp.69-73
• /
• 2014

Objectives: This study was designed to assess the change of heart rate variability (HRV) at resting, upright, and psychological stress in anxiety disorder patients. Methods: HRV was measured at resting, upright, and psychological stress states in 60 anxiety disorder patients. We used visual analogue scale (VAS) score to assess tension and stress severity. Beck depression inventory (BDI) and state trait anxiety inventories I and II (STAI-I and II) were used to assess depression and anxiety severity. Differences between HRV indices were evaluated using paired t-tests. Gender difference analysis was accomplished with ANCOVA. Results: SDNN (Standard deviation of normal RR intervals) and low frequency/high frequency (LF/HF) were significantly increased, while NN50, pNN50, and normalized HF (nHF) were significantly decreased in the upright position compared to resting state (p < 0.01). SDNN, root mean square of the differences of successive normal to normal intervals, and LF/HF were significantly increased, while nHF was significantly decreased in the psychological stress state compared to resting state (p < 0.01). SDNN, NN50, pNN50 were significantly lower in upright position compared to psychological stress and nVLF, nLF, nHF, and LF/HF showed no significant differences between them. Conclusion: The LF/HF ratio was significantly increased after both physical and psychological stress in anxiety disorder, but did not show a significant difference between these two stresses. Significant differences of SDNN, NN50, and pNN50 without any differences of nVLF, nLF, nHF, and LF/HF between two stresses might suggest that frequency domain analysis is more specific than time domain analysis.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2004.11a
• /
• pp.653-657
• /
• 2004

In this study, PD(partial discharge) signals which occurrs at stator coil of traction Motor are acquired. these data are used for classifying the PD sources. W(Neural Network) has recently applied to classify the PB pattern. The PD data are used for the learning process to classify PD sources. The PD data come from normal specimen and defective specimens such as internal void discharges, slot discharges and surface discharges. PD distribution parameters are calculated from a set of the data, which is used to realize diagnostic algorithm. NN which applies distribution parameters is useful to classify the PD patterns of defective sources generating in stator coil of traction motor.

• Journal of Korean Society of Forest Science
• /
• v.111 no.4
• /
• pp.603-612
• /
• 2022

The study aims were to evaluate a machine-learning, algorithm-based, forest biomass-estimation model to estimate subnational forest biomass and to comparatively analyze REDD+ forest reference emission levels. Time-series Landsat satellite imagery and ESA Biomass Climate Change Initiative information were used to build a machine-learning-based biomass estimation model. The k-nearest neighbors algorithm (kNN), which is a non-parametric learning model, and the tree-based random forest (RF) model were applied to the machine-learning algorithm, and the estimated biomasses were compared with the forest reference emission levels (FREL) data, which was provided by the Paraguayan government. The root mean square error (RMSE), which was the optimum parameter of the kNN model, was 35.9, and the RMSE of the RF model was lower at 34.41, showing that the RF model was superior. As a result of separately using the FREL, kNN, and RF methods to set the reference emission levels, the gradient was set to approximately -33,000 tons, -253,000 tons, and -92,000 tons, respectively. These results showed that the machine learning-based estimation model was more suitable than the existing methods for setting reference emission levels.