• 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 the Korean Wood Science and Technology
• /
• v.47 no.2
• /
• pp.229-238
• /
• 2019

Various wood defects occur during tree growing or wood processing. Thus, to use wood practically, it is necessary to objectively assess their quality based on the usage requirement by accurately classifying their defects. However, manual visual grading and species classification may result in differences due to subjective decisions; therefore, computer-vision-based image analysis is required for the objective evaluation of wood quality and the speeding up of wood production. In this study, the SIFT+k-NN and CNN models were used to implement a model that automatically classifies knots and analyze its accuracy. Toward this end, a total of 1,172 knot images in various shapes from five domestic conifers were used for learning and validation. For the SIFT+k-NN model, SIFT technology was used to extract properties from the knot images and k-NN was used for the classification, resulting in the classification with an accuracy of up to 60.53% when k-index was 17. The CNN model comprised 8 convolution layers and 3 hidden layers, and its maximum accuracy was 88.09% after 1205 epoch, which was higher than that of the SIFT+k-NN model. Moreover, if there is a large difference in the number of images by knot types, the SIFT+k-NN tended to show a learning biased toward the knot type with a higher number of images, whereas the CNN model did not show a drastic bias regardless of the difference in the number of images. Therefore, the CNN model showed better performance in knot classification. It is determined that the wood knot classification by the CNN model will show a sufficient accuracy in its practical applicability.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.927-930
• /
• 2010

Recently, continuous k-nearest neighbor query(CkNN) which is defined as a query to find the nearest points of interest to all the points on a given path is widely used in the LBS(Location Based Service) and ITS(Intelligent Transportation System) applications. It is necessary to acquire results quickly in the above applications and be applicable to spatial network databases. This paper proposes a new method to search nearest POIs(Point Of Interest) for moving query objects on the spatial networks. The method produces a set of split points and their corresponding k-POIs as results. There is no order between the POIs. The analysis show that the proposed method outperforms the existing methods.

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

• 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 Digital Contents Society
• /
• v.15 no.1
• /
• pp.129-136
• /
• 2014

Wi-Fi fingerprinting system is a very popular positioning method used in indoor spaces. The system depends on Wi-Fi Received Signal Strength (RSS) from Access Points (APs). However, the Wi-Fi RSS is changeable by multipath fading effect and interference due to walls, obstacles and people. Therefore, the Wi-Fi fingerprinting system produces low position accuracy. Also, Wi-Fi signals pass through walls. For this reason, the existing system cannot distinguish users' floor. To solve these problems, this paper proposes a LED fingerprinting system for accurate indoor positioning. The proposed system uses a received optical power from LEDs and LED-Identification (LED-ID) instead of the Wi-Fi RSS. In training phase, we record LED fingerprints in database at each place. In serving phase, we adopt a K-Nearest Neighbor (K-NN) algorithm for comparing existing data and new received data of users. We show that our technique performs in terms of CDF by computer simulation results. From simulation results, the proposed system shows that a positioning accuracy is improved by 8.6 % on average.

• Journal of Korea Multimedia Society
• /
• v.20 no.9
• /
• pp.1567-1573
• /
• 2017

The k-nearest neighbor (k-NN) algorithm is one of the most widely used benchmark algorithm in classification. Nowadays it has been further applied to predict time series. However, one of the main concerns of the algorithm applied on short-term electricity load forecasting is high computational burden. In the paper, we propose an approach of dimension reduction that follows the principles of highlighting the temperature effect on electricity load data series. The results show the proposed approach is able to reduce the dimension of the data around 30%. Moreover, with temperature effect highlighting, the approach will contribute to finding similar days accurately, and then raise forecasting accuracy slightly.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2003.11a
• /
• pp.169-174
• /
• 2003

이동 객체에 대한 기존 최근접(nearest neighbor, NN) 질의 처리 기법들은 질의 궤적에 대해 연속적으로 정확하게, 질의와 가장 가까운 위치를 유지하면서 움직이는 최근접 객체를 선택할 수 있는 충분한 기준을 가지고 있지 못하다. 이 논문은 질의 객체와 데이터 객체가 모두 이동 객체인 경우에 가장 적합하게 사용되는 객체 궤적에 대한 연속적인 질의 처리를 통해 정확한 결과를 얻을 수 있는 새로운 최근접 질의 처리 기법, 연속 궤적 최근접 질의(CTNN, continuous trajectory nearest neighbor query)를 제안한다. 우리는 두 가지 Approximate, Exact CTNN 기법을 제안하며 이들은 모두 항해 시스템, 교통 통제 시스템, 물류정보 시스템 등 각종 위치 기반 서비스(L8S: location based services) 상에서 다양하게 사용될 수 있다. 이들은 이동 객체 궤적이 미리 알려져 있는 경우 그리고 질의와 데이터 객체가 모두 이동 객체인 경우에 가장 적합하다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.22 no.4
• /
• pp.611-620
• /
• 2021

The maintenance industry is mainly progressing based on condition-based maintenance after corrective maintenance and preventive maintenance. In condition-based maintenance, maintenance is performed at the optimum time based on the condition of equipment. In order to find the optimal maintenance point, it is important to accurately understand the condition of the equipment, especially the remaining useful life. Thus, using simulation data (C-MAPSS), a prediction model is proposed to predict the remaining useful life of a turbofan engine. For the modeling process, a C-MAPSS dataset was preprocessed, transformed, and predicted. Data pre-processing was performed through piecewise RUL, moving average filters, and standardization. The remaining useful life was predicted using principal component analysis and the k-NN method. In order to derive the optimal performance, the number of principal components and the number of neighbor data for the k-NN method were determined through 5-fold cross validation. The validity of the prediction results was analyzed through a scoring function while considering the usefulness of prior prediction and the incompatibility of post prediction. In addition, the usefulness of the RUL prediction model was proven through comparison with the prediction performance of other neural network-based algorithms.

• Journal of Korean Society of Transportation
• /
• v.34 no.2
• /
• pp.158-167
• /
• 2016

This study evaluates potential sources of errors in k-NN(k-nearest neighbor) algorithm such as procedures, variables, and input data. Previous research has been thoroughly reviewed for understanding fundamentals of k-NN algorithm that has been widely used for short-term traffic states prediction. The framework of this algorithm commonly includes historical data smoothing, pattern database, similarity measure, k-value, and prediction horizon. The outcomes of this study suggests that: i) historical data smoothing is recommended to reduce random noise of measured traffic data; ii) the historical database should contain traffic state information on both normal and event conditions; and iii) trial and error method can improve the prediction accuracy by better searching for the optimum input time series and k-value. The study results also demonstrates that predicted error increases with the duration of prediction horizon and rapidly changing traffic states.