• Title/Summary/Keyword: k-Nearest neighbor

Search Result 641, Processing Time 0.029 seconds

A Study on Valid Time for Nearest Neighbor Query of Moving Objects (이동 객체의 최근접 질의를 위한 유효 시간에 관한 연구)

  • Kang, Ku-An;Lee, Sang-Wook;Kim, Jin-Doeg
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.163-166
    • /
    • 2005
  • The latest wireless communications technology bring about the rapid developments of Global Position System and Location-Based Service. It is very important for the moving object database to deal with database queries related to the trajectories of a moving objects and the valid time of the query results as well. In this paper, we propose how to get not only the current result of query but also the valid time and the result after the time when a query point and objects are moving at the same time. We would like to predict the valid time by formula because the current results will be incorrect due to the characteristic of the continuous movements of the moving objects and the future results can not be calculated by iterative computations.

  • PDF

Discriminating Eggs from Two Local Breeds Based on Fatty Acid Profile and Flavor Characteristics Combined with Classification Algorithms

  • Dong, Xiao-Guang;Gao, Li-Bing;Zhang, Hai-Jun;Wang, Jing;Qiu, Kai;Qi, Guang-Hai;Wu, Shu-Geng
    • Food Science of Animal Resources
    • /
    • v.41 no.6
    • /
    • pp.936-949
    • /
    • 2021
  • This study discriminated fatty acid profile and flavor characteristics of Beijing You Chicken (BYC) as a precious local breed and Dwarf Beijing You Chicken (DBYC) eggs. Fatty acid profile and flavor characteristics were analyzed to identify differences between BYC and DBYC eggs. Four classification algorithms were used to build classification models. Arachidic acid, oleic acid (OA), eicosatrienoic acid, docosapentaenoic acid (DPA), hexadecenoic acid, monounsaturated fatty acids (MUFA), polyunsaturated fatty acids (PUFA), unsaturated fatty acids (UFA) and 35 volatile compounds had significant differences in fatty acids and volatile compounds by gas chromatography-mass spectrometry (GC-MS) (p<0.05). For fatty acid data, k-nearest neighbor (KNN) and support vector machine (SVM) got 91.7% classification accuracy. SPME-GC-MS data failed in classification models. For electronic nose data, classification accuracy of KNN, linear discriminant analysis (LDA), SVM and decision tree was all 100%. The overall results indicated that BYC and DBYC eggs could be discriminated based on electronic nose with suitable classification algorithms. This research compared the differentiation of the fatty acid profile and volatile compounds of various egg yolks. The results could be applied to evaluate egg nutrition and distinguish avian eggs.

Diabetes prediction mechanism using machine learning model based on patient IQR outlier and correlation coefficient (환자 IQR 이상치와 상관계수 기반의 머신러닝 모델을 이용한 당뇨병 예측 메커니즘)

  • Jung, Juho;Lee, Naeun;Kim, Sumin;Seo, Gaeun;Oh, Hayoung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.10
    • /
    • pp.1296-1301
    • /
    • 2021
  • With the recent increase in diabetes incidence worldwide, research has been conducted to predict diabetes through various machine learning and deep learning technologies. In this work, we present a model for predicting diabetes using machine learning techniques with German Frankfurt Hospital data. We apply outlier handling using Interquartile Range (IQR) techniques and Pearson correlation and compare model-specific diabetes prediction performance with Decision Tree, Random Forest, Knn (k-nearest neighbor), SVM (support vector machine), Bayesian Network, ensemble techniques XGBoost, Voting, and Stacking. As a result of the study, the XGBoost technique showed the best performance with 97% accuracy on top of the various scenarios. Therefore, this study is meaningful in that the model can be used to accurately predict and prevent diabetes prevalent in modern society.

Classifying Severity of Senior Driver Accidents In Capital Regions Based on Machine Learning Algorithms (머신러닝 기반의 수도권 지역 고령운전자 차대사람 사고심각도 분류 연구)

  • Kim, Seunghoon;Lym, Youngbin;Kim, Ki-Jung
    • Journal of Digital Convergence
    • /
    • v.19 no.4
    • /
    • pp.25-31
    • /
    • 2021
  • Moving toward an aged society, traffic accidents involving elderly drivers have also attracted broader public attention. A rapid increase of senior involvement in crashes calls for developing appropriate crash-severity prediction models specific to senior drivers. In that regard, this study leverages machine learning (ML) algorithms so as to predict the severity of vehicle-pedestrian collisions induced by elderly drivers. Specifically, four ML algorithms (i.e., Logistic model, K-nearest Neighbor (KNN), Random Forest (RF), and Support Vector Machine (SVM)) have been developed and compared. Our results show that Logistic model and SVM have outperformed their rivals in terms of the overall prediction accuracy, while precision measure exhibits in favor of RF. We also clarify that driver education and technology development would be effective countermeasures against severity risks of senior driver-induced collisions. These allow us to support informed decision making for policymakers to enhance public safety.

Improved LTE Fingerprint Positioning Through Clustering-based Repeater Detection and Outlier Removal

  • Kwon, Jae Uk;Chae, Myeong Seok;Cho, Seong Yun
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.11 no.4
    • /
    • pp.369-379
    • /
    • 2022
  • In weighted k-nearest neighbor (WkNN)-based Fingerprinting positioning step, a process of comparing the requested positioning signal with signal information for each reference point stored in the fingerprint DB is performed. At this time, the higher the number of matched base station identifiers, the higher the possibility that the terminal exists in the corresponding location, and in fact, an additional weight is added to the location in proportion to the number of matching base stations. On the other hand, if the matching number of base stations is small, the selected candidate reference point has high dependence on the similarity value of the signal. But one problem arises here. The positioning signal can be compared with the repeater signal in the signal information stored on the DB, and the corresponding reference point can be selected as a candidate location. The selected reference point is likely to be an outlier, and if a certain weight is applied to the corresponding location, the error of the estimated location information increases. In order to solve this problem, this paper proposes a WkNN technique including an outlier removal function. To this end, it is first determined whether the repeater signal is included in the DB information of the matched base station. If the reference point for the repeater signal is selected as the candidate position, the reference position corresponding to the outlier is removed based on the clustering technique. The performance of the proposed technique is verified through data acquired in Seocho 1 and 2 dongs in Seoul.

CNN based Raman Spectroscopy Algorithm That is Robust to Noise and Spectral Shift (잡음과 스펙트럼 이동에 강인한 CNN 기반 라만 분광 알고리즘)

  • Park, Jae-Hyeon;Yu, Hyeong-Geun;Lee, Chang Sik;Chang, Dong Eui;Park, Dong-Jo;Nam, Hyunwoo;Park, Byeong Hwang
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.24 no.3
    • /
    • pp.264-271
    • /
    • 2021
  • Raman spectroscopy is an equipment that is widely used for classifying chemicals in chemical defense operations. However, the classification performance of Raman spectrum may deteriorate due to dark current noise, background noise, spectral shift by vibration of equipment, spectral shift by pressure change, etc. In this paper, we compare the classification accuracy of various machine learning algorithms including k-nearest neighbor, decision tree, linear discriminant analysis, linear support vector machine, nonlinear support vector machine, and convolutional neural network under noisy and spectral shifted conditions. Experimental results show that convolutional neural network maintains a high classification accuracy of over 95 % despite noise and spectral shift. This implies that convolutional neural network can be an ideal classification algorithm in a real combat situation where there is a lot of noise and spectral shift.

Indoor 3D Dynamic Reconstruction Fingerprint Matching Algorithm in 5G Ultra-Dense Network

  • Zhang, Yuexia;Jin, Jiacheng;Liu, Chong;Jia, Pengfei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.1
    • /
    • pp.343-364
    • /
    • 2021
  • In the 5G era, the communication networks tend to be ultra-densified, which will improve the accuracy of indoor positioning and further improve the quality of positioning service. In this study, we propose an indoor three-dimensional (3D) dynamic reconstruction fingerprint matching algorithm (DSR-FP) in a 5G ultra-dense network. The first step of the algorithm is to construct a local fingerprint matrix having low-rank characteristics using partial fingerprint data, and then reconstruct the local matrix as a complete fingerprint library using the FPCA reconstruction algorithm. In the second step of the algorithm, a dynamic base station matching strategy is used to screen out the best quality service base stations and multiple sub-optimal service base stations. Then, the fingerprints of the other base station numbers are eliminated from the fingerprint database to simplify the fingerprint database. Finally, the 3D estimated coordinates of the point to be located are obtained through the K-nearest neighbor matching algorithm. The analysis of the simulation results demonstrates that the average relative error between the reconstructed fingerprint database by the DSR-FP algorithm and the original fingerprint database is 1.21%, indicating that the accuracy of the reconstruction fingerprint database is high, and the influence of the location error can be ignored. The positioning error of the DSR-FP algorithm is less than 0.31 m. Furthermore, at the same signal-to-noise ratio, the positioning error of the DSR-FP algorithm is lesser than that of the traditional fingerprint matching algorithm, while its positioning accuracy is higher.

Cable anomaly detection driven by spatiotemporal correlation dissimilarity measurements of bridge grouped cable forces

  • Dong-Hui, Yang;Hai-Lun, Gu;Ting-Hua, Yi;Zhan-Jun, Wu
    • Smart Structures and Systems
    • /
    • v.30 no.6
    • /
    • pp.661-671
    • /
    • 2022
  • Stayed cables are the key components for transmitting loads in cable-stayed bridges. Therefore, it is very important to evaluate the cable force condition to ensure bridge safety. An online condition assessment and anomaly localization method is proposed for cables based on the spatiotemporal correlation of grouped cable forces. First, an anomaly sensitive feature index is obtained based on the distribution characteristics of grouped cable forces. Second, an adaptive anomaly detection method based on the k-nearest neighbor rule is used to perform dissimilarity measurements on the extracted feature index, and such a method can effectively remove the interference of environment factors and vehicle loads on online condition assessment of the grouped cable forces. Furthermore, an online anomaly isolation and localization method for stay cables is established, and the complete decomposition contributions method is used to decompose the feature matrix of the grouped cable forces and build an anomaly isolation index. Finally, case studies were carried out to validate the proposed method using an in-service cable-stayed bridge equipped with a structural health monitoring system. The results show that the proposed approach is sensitive to the abnormal distribution of grouped cable forces and is robust to the influence of interference factors. In addition, the proposed approach can also localize the cables with abnormal cable forces online, which can be successfully applied to the field monitoring of cables for cable-stayed bridges.

Machine learning in survival analysis (생존분석에서의 기계학습)

  • Baik, Jaiwook
    • Industry Promotion Research
    • /
    • v.7 no.1
    • /
    • pp.1-8
    • /
    • 2022
  • We investigated various types of machine learning methods that can be applied to censored data. Exploratory data analysis reveals the distribution of each feature, relationships among features. Next, classification problem has been set up where the dependent variable is death_event while the rest of the features are independent variables. After applying various machine learning methods to the data, it has been found that just like many other reports from the artificial intelligence arena random forest performs better than logistic regression. But recently well performed artificial neural network and gradient boost do not perform as expected due to the lack of data. Finally Kaplan-Meier and Cox proportional hazard model have been employed to explore the relationship of the dependent variable (ti, δi) with the independent variables. Also random forest which is used in machine learning has been applied to the survival analysis with censored data.

An effective automated ontology construction based on the agriculture domain

  • Deepa, Rajendran;Vigneshwari, Srinivasan
    • ETRI Journal
    • /
    • v.44 no.4
    • /
    • pp.573-587
    • /
    • 2022
  • The agricultural sector is completely different from other sectors since it completely relies on various natural and climatic factors. Climate changes have many effects, including lack of annual rainfall and pests, heat waves, changes in sea level, and global ozone/atmospheric CO2 fluctuation, on land and agriculture in similar ways. Climate change also affects the environment. Based on these factors, farmers chose their crops to increase productivity in their fields. Many existing agricultural ontologies are either domain-specific or have been created with minimal vocabulary and no proper evaluation framework has been implemented. A new agricultural ontology focused on subdomains is designed to assist farmers using Jaccard relative extractor (JRE) and Naïve Bayes algorithm. The JRE is used to find the similarity between two sentences and words in the agricultural documents and the relationship between two terms is identified via the Naïve Bayes algorithm. In the proposed method, the preprocessing of data is carried out through natural language processing techniques and the tags whose dimensions are reduced are subjected to rule-based formal concept analysis and mapping. The subdomain ontologies of weather, pest, and soil are built separately, and the overall agricultural ontology are built around them. The gold standard for the lexical layer is used to evaluate the proposed technique, and its performance is analyzed by comparing it with different state-of-the-art systems. Precision, recall, F-measure, Matthews correlation coefficient, receiver operating characteristic curve area, and precision-recall curve area are the performance metrics used to analyze the performance. The proposed methodology gives a precision score of 94.40% when compared with the decision tree(83.94%) and K-nearest neighbor algorithm(86.89%) for agricultural ontology construction.