• Title/Summary/Keyword: k-NN Method

Search Result 309, Processing Time 0.027 seconds

A Memory-based Reasoning Algorithm using Adaptive Recursive Partition Averaging Method (적응형 재귀 분할 평균법을 이용한 메모리기반 추론 알고리즘)

  • 이형일;최학윤
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.4
    • /
    • pp.478-487
    • /
    • 2004
  • We had proposed the RPA(Recursive Partition Averaging) method in order to improve the storage requirement and classification rate of the Memory Based Reasoning. That algorithm worked not bad in many area, however, the major drawbacks of RPA are it's partitioning condition and the way of extracting major patterns. We propose an adaptive RPA algorithm which uses the FPD(feature-based population densimeter) to stop the ARPA partitioning process and produce, instead of RPA's averaged major pattern, optimizing resulting hyperrectangles. The proposed algorithm required only approximately 40% of memory space that is needed in k-NN classifier, and showed a superior classification performance to the RPA. Also, by reducing the number of stored patterns, it showed an excellent results in terms of classification when we compare it to the k-NN.

HD-Tree: High performance Lock-Free Nearest Neighbor Search KD-Tree (HD-Tree: 고성능 Lock-Free NNS KD-Tree)

  • Lee, Sang-gi;Jung, NaiHoon
    • Journal of Korea Game Society
    • /
    • v.20 no.5
    • /
    • pp.53-64
    • /
    • 2020
  • Supporting NNS method in KD-Tree algorithm is essential in multidimensional data applications. In this paper, we propose HD-Tree, a high-performance Lock-Free KD-Tree that supports NNS in situations where reads and writes occurs concurrently. HD-Tree reduced the number of synchronization nodes used in NNS and requires less atomic operations during Lock-Free method execution. Comparing with existing algorithms, in a multi-core system with 8 core 16 thread, HD-Tree's performance has improved up to 95% on NNS and 15% on modifying in oversubscription situation.

Classification Protein Subcellular Locations Using n-Gram Features (단백질 서열의 n-Gram 자질을 이용한 세포내 위치 예측)

  • Kim, Jinsuk
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2007.11a
    • /
    • 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.

  • PDF

Comparison of the Tracking Methods for Multiple Maneuvering Targets (다중 기동 표적에 대한 추적 방식의 비교)

  • Lim, Sang Seok
    • Journal of Advanced Navigation Technology
    • /
    • v.1 no.1
    • /
    • pp.35-46
    • /
    • 1997
  • Over last decade Multiple Target Tracking (MTT) has been the subject of numerous presentations and conferences [1979-1900]. Various approaches have been proposed to solve the problem. Representative works in the problem are Nearest Neighbor (NN) method based on non-probabilistic data association (DA), Multiple Hypothesis Test (MHT) and Joint Probabilistic Data Association (JPDA) as the probabilistic approaches. These techniques have their own advantages and limitations in computational requirements and in the tracking performances. In this paper, the three promising algorithms based on the NN standard filter, MHT and JPDA methods are presented and their performances against simulated multiple maneuvering targets are compared through numerical simulations.

  • PDF

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.

Neurointerface Using an Online Feedback-Error Learning Based Neural Network for Nonholonomic Mobile Robots

  • Lee, Hyun-Dong;Watanabe, Keigo;Jin, Sang-Ho;Syam, Rafiuddin;Izumi, Kiyotaka
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.330-333
    • /
    • 2005
  • In this study, a method of designing a neurointerface using neural network (NN) is proposed for controlling nonholonomic mobile robots. According to the concept of virtual master-slave robots, in particular, a partially stable inverse dynamic model of the master robot is acquired online through the NN by applying a feedback-error learning method, in which the feedback controller is assumed to be based on a PD compensator for such a nonholonomic robot. A tracking control problem is demonstrated by some simulations for a nonholonomic mobile robot with two-independent driving wheels.

  • PDF

Face Recognition using Fisherface Method with Fuzzy Membership Degree (퍼지 소속도를 갖는 Fisherface 방법을 이용한 얼굴인식)

  • 곽근창;고현주;전명근
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.6
    • /
    • pp.784-791
    • /
    • 2004
  • In this study, we deal with face recognition using fuzzy-based Fisherface method. The well-known Fisherface method is more insensitive to large variation in light direction, face pose, and facial expression than Principal Component Analysis method. Usually, the various methods of face recognition including Fisherface method give equal importance in determining the face to be recognized, regardless of typicalness. The main point here is that the proposed method assigns a feature vector transformed by PCA to fuzzy membership rather than assigning the vector to particular class. In this method, fuzzy membership degrees are obtained from FKNN(Fuzzy K-Nearest Neighbor) initialization. Experimental results show better recognition performance than other methods for ORL and Yale face databases.

Rapid Stitching Method of Digital X-ray Images Using Template-based Registration (템플릿 기반 정합 기법을 이용한 디지털 X-ray 영상의 고속 스티칭 기법)

  • Cho, Hyunji;Kye, Heewon;Lee, Jeongjin
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.6
    • /
    • pp.701-709
    • /
    • 2015
  • Image stitching method is a technique for obtaining an high-resolution image by combining two or more images. In X-ray image for clinical diagnosis, the size of the imaging region taken by one shot is limited due to the field-of-view of the equipment. Therefore, in order to obtain a high-resolution image including large regions such as a whole body, the synthesis of multiple X-ray images is required. In this paper, we propose a rapid stitching method of digital X-ray images using template-based registration. The proposed algorithm use principal component analysis(PCA) and k-nearest neighborhood(k-NN) to determine the location of input images before performing a template-based matching. After detecting the overlapping position using template-based matching, we synthesize input images by alpha blending. To improve the computational efficiency, reduced images are used for PCA and k-NN analysis. Experimental results showed that our method was more accurate comparing with the previous method with the improvement of the registration speed. Our stitching method could be usefully applied into the stitching of 2D or 3D multiple images.

Detection of the Ryanodine Receptor Gene Mutation Associated with Porcine Stress Syndrome from Pig Hair Roots by PCR-RFLP (PCR-RFLP 기법을 이용한 Porcine Stress Syndrome의 진단)

  • Hwang, Eui-Kyung;Kim, Yeon-Soo
    • Korean Journal of Veterinary Research
    • /
    • v.42 no.1
    • /
    • pp.65-71
    • /
    • 2002
  • We have utilized the PCR-RFLP method to detect the ryanodine receptor(RYR1) gene mutation and to estimate the genotype frequencies of the RYR1 gene in commercial crossbred pig population. The exon region(659bp) including point mutation(C ${\rightarrow}$T; Arg ${\rightarrow}$Cys) in the porcine ryanodine receptor gene, which is a causal mutation for PSS, was amplified by PCR and digested with Cfo I restriction enzyme. The RYR1 gene was classified into three genotypes by agarose gel electrophoresis. The normal homozygous(NN) individuals showed two DNA fragments consisted of 493 and 166bp. The mutant homozygous(nn) individuals showed only one DNA fragment of 659bp. Also, all three fragments(659, 493 and 166bp) were showed in heterozygous(Nn) carrier animals. The proportions of normal, carrier and PSS pigs within crossbred population of pigs were 81%, 15% and 4%, respectively. According to the results of analysis of variance for the association of genotypes of RYR1 of pigs at 30kg, day age at 90kg and average daily gains, the RYR1 nn genotype was very higher than RYR1 NN genotype for day age at 30kg with 5% level of significant difference, but no significant difference for association of any other genotypes with day age at 90kg and average daily gain in crossbred pigs. Therefore, DNA diagnosis by using PCR-RFLP analysis for the PSS gene was useful for large-scale screening of commercial pigs in the swine industry.

CNN-based Adaptive K for Improving Positioning Accuracy in W-kNN-based LTE Fingerprint Positioning

  • Kwon, Jae Uk;Chae, Myeong Seok;Cho, Seong Yun
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.11 no.3
    • /
    • pp.217-227
    • /
    • 2022
  • In order to provide a location-based services regardless of indoor or outdoor space, it is important to provide position information of the terminal regardless of location. Among the wireless/mobile communication resources used for this purpose, Long Term Evolution (LTE) signal is a representative infrastructure that can overcome spatial limitations, but the positioning method based on the location of the base station has a disadvantage in that the accuracy is low. Therefore, a fingerprinting technique, which is a pattern recognition technology, has been widely used. The simplest yet widely applied algorithm among Fingerprint positioning technologies is k-Nearest Neighbors (kNN). However, in the kNN algorithm, it is difficult to find the optimal K value with the lowest positioning error for each location to be estimated, so it is generally fixed to an appropriate K value and used. Since the optimal K value cannot be applied to each estimated location, therefore, there is a problem in that the accuracy of the overall estimated location information is lowered. Considering this problem, this paper proposes a technique for adaptively varying the K value by using a Convolutional Neural Network (CNN) model among Artificial Neural Network (ANN) techniques. First, by using the signal information of the measured values obtained in the service area, an image is created according to the Physical Cell Identity (PCI) and Band combination, and an answer label for supervised learning is created. Then, the structure of the CNN is modeled to classify K values through the image information of the measurements. The performance of the proposed technique is verified based on actual data measured in the testbed. As a result, it can be seen that the proposed technique improves the positioning performance compared to using a fixed K value.