• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.1-3
• /
• 2006

대사증후군은 당뇨병, 고혈압, 복부 비만, 고지혈증 등의 질병이 한 개인에게 동시에 발현하는 것을 말하며, 최근 경제여건의 향상 및 식생활 습관의 변화와 함께 우리나라에서도 심각한 문제가 되고 있다. 한편 불확실성의 처리를 위해 많이 사용되는 베이지안 네트워크는 사람이 분석 가능한 확률 기반의 모델로 최근 의학분야에서 질병의 진단이나 예측모델을 구성하기 위한 방법으로 유용하게 사용되고 있다. 베이지안 네트워크의 구조를 학습하는 대표적인 알고리즘인 K2 알고리즘은 속성이 입력되는 순서의 영향을 받으며, 따라서 이 또한 하나의 주제로써 연구되어 왔다. 본 논문에서는 유전자 알고리즘을 이용하여 베이지안 네트워크에 입력되는 속성 순서를 최적화하며 이 과정에서 의학지식을 적용해 효율적인 최적화가 가능하도록 하였다. 제안하는 모델을 통해 1993년의 데이터를 가지고 1995년의 상태를 예측하는 분류 실험을 수행한 결과 속성 순서 최적화 후에 이전보다 향상된 예측율을 보였으며 또한 다층 신경망, k-최근접 이웃 등을 이용한 다른 모델보다 더 높은 예측율을 보였다.

• Journal of Korea Multimedia Society
• /
• v.19 no.5
• /
• pp.874-880
• /
• 2016

The gesture classification has been applied to many fields. But it is not efficient in the environment for game interface with low specification devices such as mobile and tablet, In this paper, we propose a effective way for realistic game interface using k-nearest neighbors algorithm for gesture classification. It is time consuming by realtime rendering process in game interface. To reduce the process time while preserving the accuracy, a reconstruction method to minimize error between training and test data sets is also proposed. The experimental results show that the proposed method is better than the conventional methods in both accuracy and time.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.11a
• /
• pp.470-473
• /
• 2021

본 논문에서는 코로나-19로 인해 홈 트레이닝 시장이 성장하고 있는 상황 속에서 효율적인 운동을 위해 사용자의 식습관, 신체조건, 선호도 등을 바탕으로 적합한 운동을 추천해주는 시스템을 제안한다. 먼저 K-최근접 이웃 알고리즘을 활용해 비만의 정도에 따라 사용자를 분류하고, 운동 데이터를 소모 칼로리에 따라 클러스터링 한다. 다음으로 비만의 정도와 운동 레벨에 따라 정해진 추천 점수를 통해 사전 선호도 확률을 계산하고, 베이지안 네트워크를 통해 사후 확률을 구한다. 이를 바탕으로 특이값 분해 알고리즘(SVD)를 활용하여 사용자 맞춤형 운동을 추천한다. 제안 시스템의 성능을 검증하기 위해 비교 실험을 진행하여 회귀 문제 평가 척도인 RMSE 값 측면에서 성능을 분석하였다.

• The Korean Journal of Applied Statistics
• /
• v.23 no.6
• /
• pp.1093-1102
• /
• 2010

Even though the k-Nearest Neighbors Classification(KNNC) is one of the popular non-parametric classification methods, it does not consider the local features and class information for each observation. In order to overcome such limitations, several methods have been developed such as Adaptive Nearest Neighbors Classification(ANNC) and Modified k-Nearest Neighbors Classification(MKNNC). In this paper, we propose the Modified Adaptive Nearest Neighbors Classification(MANNC) that employs the advantages of both the ANNC and MKNNC. Through a real data analysis and a simulation study, we show that the proposed MANNC outperforms other methods in terms of classification accuracy.

• Journal of KIISE:Software and Applications
• /
• v.29 no.3
• /
• pp.192-201
• /
• 2002

Automated text classification is considered as an important method to manage and process a huge amount of documents in digital forms that are widespread and continuously increasing. Recently, text classification has been addressed with machine learning technologies such as k-nearest neighbor, decision tree, support vector machine and neural networks. However, only few investigations in text classification are studied on real problems but on well-organized text corpus, and do not show their usefulness. This paper proposes and analyzes text classification methods for a real application, email document classification task. First, we propose a combining method of multiple neural networks that improves the performance through the combinations with maximum and neural networks. Second, we present another strategy of combining multiple machine learning classifiers. Voting, Borda count and neural networks improve the overall classification performance. Experimental results show the usefulness of the proposed methods for a real application domain, yielding more than 90% precision rates.

• Journal of KIISE:Software and Applications
• /
• v.31 no.9
• /
• pp.1204-1217
• /
• 2004

Numerous statistical and machine learning techniques have been studied for automatic text classification. However, because they train the classifiers using only feature vectors of documents, ambiguity between two possible categories significantly degrades precision of classification. To remedy the drawback, we propose a new method which incorporates relationship information of categories into extant classifiers. In this paper, we first perform the document classification using the k-NN classifier which is generally known for relatively good performance in spite of its simplicity. We employ the relationship information from an object-based thesaurus to reduce the ambiguity. By referencing various relationships in the thesaurus corresponding to the structured categories, the precision of k-NN classification is drastically improved, removing the ambiguity. Experiment result shows that this method achieves the precision up to 13.86% over the k-NN classification, preserving its recall.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.4
• /
• pp.42-53
• /
• 2012

In pattern recognition and machine learning society, classification has been a classical problem and the most widely researched area. Adaptive boosting also known as Adaboost has been successfully applied to binary classification problems. It is a kind of boosting algorithm capable of constructing a strong classifier through a weighted combination of weak classifiers. On the other hand, the PCA and LDA algorithms are the most popular linear feature extraction methods used mainly for dimensionality reduction. In this paper, the combination of Adaboost and feature extraction methods is proposed for efficient classification of two class data. Conventionally, in classification problems, the roles of feature extraction and classification have been distinct, i.e., a feature extraction method and a classifier are applied sequentially to classify input variable into several categories. In this paper, these two steps are combined into one resulting in a good classification performance. More specifically, each projection vector is treated as a weak classifier in Adaboost algorithm to constitute a strong classifier for binary classification problems. The proposed algorithm is applied to UCI dataset and FRGC dataset and showed better recognition rates than sequential application of feature extraction and classification methods.

• Journal of IKEEE
• /
• v.24 no.2
• /
• pp.403-408
• /
• 2020

Photovoltaic (PV) has both intermittent and uncertainty in nature, so it is difficult to accurately predict. Thus anomaly detection technology is important to diagnose real time PV generation. This paper identifies a correlation between various parameters and classifies the PV data applying k-nearest neighbor and dynamic time warpping. Results for the two classifications showed that an outlier detection by a fault of some facilities, and a temporary power loss by partial shading and overall shading occurring during the short period. Based on 100kW plant data, machine learning analysis and test results verified actual outliers and candidates of outlier.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.6
• /
• pp.19-28
• /
• 2021

Nowadays, interest in health care is increasing due to Coronavirus (COVID-19), and a lot of people are doing home training as there are more difficulties in using fitness centers and public facilities that are used together. In this paper, we propose a personalized exercise recommendation algorithm using personalized propensity information to provide more accurate and meaningful exercise recommendation to home training users. Thus, we classify the data according to the criteria for obesity with a k-nearest neighbor algorithm using personal information that can represent individuals, such as eating habits information and physical conditions. Furthermore, we differentiate the exercise dataset by the level of exercise activities. Based on the neighborhood information of each dataset, we provide personalized exercise recommendations to users through a dimensionality reduction algorithm (SVD) among model-based collaborative filtering methods. Therefore, we can solve the problem of data sparsity and scalability of memory-based collaborative filtering recommendation techniques and we verify the accuracy and performance of the proposed algorithms.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.83-92
• /
• 2004

Gene expression profile is numerical data of gene expression level from organism measured on the microarray. Generally, each specific tissue indicates different expression levels in related genes, so that we can classify cancer with gene expression profile. Because not all the genes are related to classification, it is needed to select related genes that is called feature selection. This paper proposes a new gene selection method using forward selection method in regression analysis. This method reduces redundant information in the selected genes to have more efficient classification. We used k-nearest neighbor as a classifier and tested with colon cancer dataset. The results are compared with Pearson's coefficient and Spearman's coefficient methods and the proposed method showed better performance. It showed 90.3% accuracy in classification. The method also successfully applied to lymphoma cancer dataset.