• Title/Summary/Keyword: k-Nearest Neighbor Method

Search Result 313, Processing Time 0.027 seconds

Density Adaptive Grid-based k-Nearest Neighbor Regression Model for Large Dataset (대용량 자료에 대한 밀도 적응 격자 기반의 k-NN 회귀 모형)

  • Liu, Yiqi;Uk, Jung
    • Journal of Korean Society for Quality Management
    • /
    • v.49 no.2
    • /
    • pp.201-211
    • /
    • 2021
  • Purpose: This paper proposes a density adaptive grid algorithm for the k-NN regression model to reduce the computation time for large datasets without significant prediction accuracy loss. Methods: The proposed method utilizes the concept of the grid with centroid to reduce the number of reference data points so that the required computation time is much reduced. Since the grid generation process in this paper is based on quantiles of original variables, the proposed method can fully reflect the density information of the original reference data set. Results: Using five real-life datasets, the proposed k-NN regression model is compared with the original k-NN regression model. The results show that the proposed density adaptive grid-based k-NN regression model is superior to the original k-NN regression in terms of data reduction ratio and time efficiency ratio, and provides a similar prediction error if the appropriate number of grids is selected. Conclusion: The proposed density adaptive grid algorithm for the k-NN regression model is a simple and effective model which can help avoid a large loss of prediction accuracy with faster execution speed and fewer memory requirements during the testing phase.

Assembly Performance Evaluation for Prefabricated Steel Structures Using k-nearest Neighbor and Vision Sensor (k-근접 이웃 및 비전센서를 활용한 프리팹 강구조물 조립 성능 평가 기술)

  • Bang, Hyuntae;Yu, Byeongjun;Jeon, Haemin
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.35 no.5
    • /
    • pp.259-266
    • /
    • 2022
  • In this study, we developed a deep learning and vision sensor-based assembly performance evaluation method isfor prefabricated steel structures. The assembly parts were segmented using a modified version of the receptive field block convolution module inspired by the eccentric function of the human visual system. The quality of the assembly was evaluated by detecting the bolt holes in the segmented assembly part and calculating the bolt hole positions. To validate the performance of the evaluation, models of standard and defective assembly parts were produced using a 3D printer. The assembly part segmentation network was trained based on the 3D model images captured from a vision sensor. The sbolt hole positions in the segmented assembly image were calculated using image processing techniques, and the assembly performance evaluation using the k-nearest neighbor algorithm was verified. The experimental results show that the assembly parts were segmented with high precision, and the assembly performance based on the positions of the bolt holes in the detected assembly part was evaluated with a classification error of less than 5%.

The Effect of Data Size on the k-NN Predictability: Application to Samsung Electronics Stock Market Prediction (데이터 크기에 따른 k-NN의 예측력 연구: 삼성전자주가를 사례로)

  • Chun, Se-Hak
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.3
    • /
    • pp.239-251
    • /
    • 2019
  • Statistical methods such as moving averages, Kalman filtering, exponential smoothing, regression analysis, and ARIMA (autoregressive integrated moving average) have been used for stock market predictions. However, these statistical methods have not produced superior performances. In recent years, machine learning techniques have been widely used in stock market predictions, including artificial neural network, SVM, and genetic algorithm. In particular, a case-based reasoning method, known as k-nearest neighbor is also widely used for stock price prediction. Case based reasoning retrieves several similar cases from previous cases when a new problem occurs, and combines the class labels of similar cases to create a classification for the new problem. However, case based reasoning has some problems. First, case based reasoning has a tendency to search for a fixed number of neighbors in the observation space and always selects the same number of neighbors rather than the best similar neighbors for the target case. So, case based reasoning may have to take into account more cases even when there are fewer cases applicable depending on the subject. Second, case based reasoning may select neighbors that are far away from the target case. Thus, case based reasoning does not guarantee an optimal pseudo-neighborhood for various target cases, and the predictability can be degraded due to a deviation from the desired similar neighbor. This paper examines how the size of learning data affects stock price predictability through k-nearest neighbor and compares the predictability of k-nearest neighbor with the random walk model according to the size of the learning data and the number of neighbors. In this study, Samsung electronics stock prices were predicted by dividing the learning dataset into two types. For the prediction of next day's closing price, we used four variables: opening value, daily high, daily low, and daily close. In the first experiment, data from January 1, 2000 to December 31, 2017 were used for the learning process. In the second experiment, data from January 1, 2015 to December 31, 2017 were used for the learning process. The test data is from January 1, 2018 to August 31, 2018 for both experiments. We compared the performance of k-NN with the random walk model using the two learning dataset. The mean absolute percentage error (MAPE) was 1.3497 for the random walk model and 1.3570 for the k-NN for the first experiment when the learning data was small. However, the mean absolute percentage error (MAPE) for the random walk model was 1.3497 and the k-NN was 1.2928 for the second experiment when the learning data was large. These results show that the prediction power when more learning data are used is higher than when less learning data are used. Also, this paper shows that k-NN generally produces a better predictive power than random walk model for larger learning datasets and does not when the learning dataset is relatively small. Future studies need to consider macroeconomic variables related to stock price forecasting including opening price, low price, high price, and closing price. Also, to produce better results, it is recommended that the k-nearest neighbor needs to find nearest neighbors using the second step filtering method considering fundamental economic variables as well as a sufficient amount of learning data.

Place Recognition Method Using Quad Vocabulary Tree (쿼드 어휘 트리를 이용한 장소 인식 방법)

  • Park, Seoyeong;Hong, Hyunki
    • Journal of Broadcast Engineering
    • /
    • v.21 no.4
    • /
    • pp.569-577
    • /
    • 2016
  • Place recognition for LBS (Location Based Service) has been one of the important techniques for user-oriented service. FLANN (Fast Library for performing Approximate Nearest Neighbor) of place recognition with image features is fast, but it is affected much by environmental condition such as occlusions. This paper presents a place recognition method using quad vocabulary tree with SURF (Speeded Up Robust Features). In learning stage, an image is represented with spatial pyramid of three levels and vocabulary trees of their sub-regions are constructed. Query image is matched with the learned vocabulary trees in each level. The proposed method measures homography error of the matched features. By considering the number of inliers in sub-region, we can improve place recognition performance.

Hierarchical Nearest-Neighbor Method for Decision of Segment Fitness (세그먼트 적합성 판단을 위한 계층적 최근접 검색 기법)

  • Shin, Bok-Suk;Cha, Eui-Young;Lee, Im-Geun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.418-421
    • /
    • 2007
  • In this paper, we proposed a hierarchical nearest-neighbor searching method for deciding fitness of a clustered segment. It is difficult to distinguish the difference between correct spots and atypical noisy spots in footprint patterns. Therefore we could not completely remove unsuitable noisy spots from binarized image in image preprocessing stage or clustering stage. As a preprocessing stage for recognition of insect footprints, this method decides whether a segment is suitable or not, using degree of clustered segment fitness, and then unsuitable segments are eliminated from patterns. Removing unsuitable segments can improve performance of feature extraction for recognition of inset footprints.

  • PDF

An Improved Algorithm of Searching Neighbor Agents in a Large Flocking Behavior (대규모 무리 짓기에서 이웃 에이전트 탐색의 개선된 알고리즘)

  • Lee, Jae-Moon;Jung, In-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.5
    • /
    • pp.763-770
    • /
    • 2010
  • This paper proposes an algorithm to enhance the performance of the spatial partitioning method for a flocking behavior. One of the characteristics in a flocking behavior is that two agents may share many common neighbors if they are spatially close to each other. This paper improves the spatial partitioning method by applying this characteristic. While the conventional spatial partitioning method computes the k-nearest neighbors of an agent one by one, the proposed method computes simultaneously the k-nearest neighbors of agents if they are spatially close to each other. The proposed algorithm was implemented and its performance was experimentally compared with the original spatial partitioning method. The results of the comparison showed that the proposed algorithm outperformed the original method by about 33% in average.

A Modified Grey-Based k-NN Approach for Treatment of Missing Value

  • Chun, Young-M.;Lee, Joon-W.;Chung, Sung-S.
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.2
    • /
    • pp.421-436
    • /
    • 2006
  • Huang proposed a grey-based nearest neighbor approach to predict accurately missing attribute value in 2004. Our study proposes which way to decide the number of nearest neighbors using not only the deng's grey relational grade but also the wen's grey relational grade. Besides, our study uses not an arithmetic(unweighted) mean but a weighted one. Also, GRG is used by a weighted value when we impute missing values. There are four different methods - DU, DW, WU, WW. The performance of WW(Wen's GRG & weighted mean) method is the best of any other methods. It had been proven by Huang that his method was much better than mean imputation method and multiple imputation method. The performance of our study is far superior to that of Huang.

  • PDF

SOSiM: Shape-based Object Similarity Matching using Shape Feature Descriptors (SOSiM: 형태 특징 기술자를 사용한 형태 기반 객체 유사성 매칭)

  • Noh, Chung-Ho;Lee, Seok-Lyong;Chung, Chin-Wan;Kim, Sang-Hee;Kim, Deok-Hwan
    • Journal of KIISE:Databases
    • /
    • v.36 no.2
    • /
    • pp.73-83
    • /
    • 2009
  • In this paper we propose an object similarity matching method based on shape characteristics of an object in an image. The proposed method extracts edge points from edges of objects and generates a log polar histogram with respect to each edge point to represent the relative placement of extracted points. It performs the matching in such a way that it compares polar histograms of two edge points sequentially along with edges of objects, and uses a well-known k-NN(nearest neighbor) approach to retrieve similar objects from a database. To verify the proposed method, we've compared it to an existing Shape-Context method. Experimental results reveal that our method is more accurate in object matching than the existing method, showing that when k=5, the precision of our method is 0.75-0.90 while that of the existing one is 0.37, and when k=10, the precision of our method is 0.61-0.80 while that of the existing one is 0.31. In the experiment of rotational transformation, our method is also more robust compared to the existing one, showing that the precision of our method is 0.69 while that of the existing one is 0.30.

A Study on the Treatment of Missing Value using Grey Relational Grade and k-NN Approach

  • Chun, Young-Min;Chung, Sung-Suk
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2006.04a
    • /
    • pp.55-62
    • /
    • 2006
  • Huang proposed a grey-based nearest neighbor approach to predict accurately missing attribute value in 2004. Our study proposes which way to decide the number of nearest neighbors using not only the dong's grey relational grade but also the wen's grey relational grade. Besides, our study uses not an arithmetic(unweighted) mean but a weighted one. Also, GRG is used by a weighted value when we impute a missing values. There are four different methods - DU, DW, WU, WW. The performance of WW(wen's GRG & weighted mean) method is the best of my other methods. It had been proven by Huang that his method was much better than mean imputation method and multiple imputation method. The performance of our study is far superior to that of Huang.

  • PDF

Detection and Analysis of DNA Hybridization Characteristics by using Thermodynamic Method (열역학법을 이용한 DNA hybridization 특성 검출 및 해석)

  • Kim, Do-Gyun;Gwon, Yeong-Su
    • The Transactions of the Korean Institute of Electrical Engineers C
    • /
    • v.51 no.6
    • /
    • pp.265-270
    • /
    • 2002
  • The determination of DNA hybridization reaction can apply the molecular biology research, clinic diagnostics, bioengineering, environment monitoring, food science and application area. So, the improvement of DNA hybridization detection method is very important for the determination of this hybridization reaction. Several molecular biological techniques require accurate predictions of matched versus mismatched hybridization thermodynamics, such as PCR, sequencing by hybridization, gene diagnostics and antisense oligonucleotide probes. In addition, recent developments of oligonucleotide chip arrays as means for biochemical assays and DNA sequencing requires accurate knowledge of hybridization thermodynamics and population ratios at matched and mismatched target sites. In this study, we report the characteristics of the probe and matched, mismatched target oligonucleotide hybridization reaction using thermodynamic method. Thermodynamic of 5 oligonucleotides with central and terminal mismatch sequences were obtained by measured UV-absorbance as a function of temperature. The data show that the nearest-neighbor base-pair model is adequate for predicting thermodynamics of oligonucleotides with average deviations for $\Delta$H$^{0}$ , $\Delta$S$^{0}$ , $\Delta$G$_{37}$ $^{0}$ and T$_{m}$, respectively.>$^{0}$ and T$_{m}$, respectively.