• 정보처리학회논문지B
• /
• 제8B권5호
• /
• pp.477-484
• /
• 2001

본 논문에서는 회귀용 support vector machine의 성능 개선을 위한 모멘텀과 kernel-adatron 기법이 조합형 학습알고리즘을 제안하였다. 제안된 학습알고리즘은 supper vector machine의 학습기법인 기술기상승법에 발생하는 최적해로의 수렴에 따란 발진을 억제하여 그수렴속도를 좀 더 개선시키는 모멘텀의 장점과 비선형 특징공간에서의 동작과 구현의 용이성을 갖는 kernel-adatorn 알고리즘의 장점을 그대로 살린 것이다. 제안된 알고리즘의 support vector machine을 1차원과 2차원 비선형 함수 회귀에 적용하여 시뮬레이션한 결과, 학습속도에 있어서 2차 프로그래밍과 기존의 kernel-adaton 알고리즘보다 더 우수하고, 회귀성능면에서도 우수한 성능이 있음을 확인하였다.

• Journal of Information Science Theory and Practice
• /
• 제2권3호
• /
• pp.29-39
• /
• 2014

In recent years, several studies have proposed making use of the Twitter micro-blogging service to track various trends in online media and discussion. In this study, we specifically examine the use of Twitter to track discussions of food safety in the Korean language. Given the irregularity of keyword use in most tweets, we focus on optimistic machine-learning and feature set selection to classify collected tweets. We build the classifier model using Naive Bayes & Naive Bayes Multinomial, Support Vector Machine, and Decision Tree Algorithms, all of which show good performance. To select an optimum feature set, we construct a basic feature set as a standard for performance comparison, so that further test feature sets can be evaluated. Experiments show that precision and F-measure performance are best when using a Naive Bayes Multinomial classifier model with a test feature set defined by extracting Substantive, Predicate, Modifier, and Interjection parts of speech.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2021년도 춘계학술대회
• /
• pp.280-282
• /
• 2021

주관적 판단을 적용하여 예보되는 미세먼지 예보의 문제를 해결하기 위해 딥러닝 알고리즘을 이용하여 미세먼지 예측 모델을 설계하였다. 딥러닝 알고리즘 중 RNN과 LSTM을 이용하였으며, 하이퍼 파라미터 탐색을 통해 최적의 파라미터를 적용하여 설계하였다. RMSE와 예측 정확도를 통해 두 모델의 예측 성능을 평가하였다. 성능 평가 결과, RMSE와 전체 정확도에서 큰 차이는 없었으나 세부 예측 정확도의 차이가 있음을 확인하였다.

• Journal of Computing Science and Engineering
• /
• 제5권4호
• /
• pp.288-293
• /
• 2011

To resolve ambiguities in speech act classification, various machine learning models have been proposed over the past 10 years. In this paper, we review these machine learning models and present the results of experimental comparison of three representative models, namely the decision tree, the support vector machine (SVM), and the maximum entropy model (MEM). In experiments with a goal-oriented dialogue corpus in the schedule management domain, we found that the MEM has lighter hardware requirements, whereas the SVM has better performance characteristics.

• 반도체디스플레이기술학회지
• /
• 제19권1호
• /
• pp.1-5
• /
• 2020

In this paper, a predictive maintenance of the robot trouble using the machine learning method, so called MT(Mahalanobis Taguchi), was studied. Especially, 'MD(Mahalanobis Distance)' was used to compare the robot arm motion difference between before the maintenance(bearing change) and after the maintenance. 6-axies vibration sensor was used to detect the vibration sensing during the motion of the robot arm. The results of the comparison, MD value of the arm motions of the after the maintenance(bearing change) was much lower and stable compared to MD value of the arm motions of the before the maintenance. MD value well distinguished the fine difference of the arm vibration of the robot. The superior performance of the MT method applied to the prediction of the robot trouble was verified by this experiments.

• 한국멀티미디어학회논문지
• /
• 제25권9호
• /
• pp.1367-1374
• /
• 2022

In this paper, we propose an automatic cosmetic foundation recommendation system that suggests a good foundation product based on the user's skin color. The proposed system receives and preprocesses user images and detects skin color with OpenCV and machine learning algorithms. The system then compares the performance of the training model using XGBoost, Gradient Boost, Random Forest, and Adaptive Boost (AdaBoost), based on 550 datasets collected as essential bestsellers in the United States. Based on the comparison results, this paper implements a recommendation system using the highest performing machine learning model. As a result of the experiment, our system can effectively recommend a suitable skin color foundation. Thus, our system model is 98% accurate. Furthermore, our system can reduce the selection trials of foundations against the user's skin color. It can also save time in selecting foundations.

• International Journal of Computer Science & Network Security
• /
• 제24권3호
• /
• pp.101-106
• /
• 2024

This article aims to compare the accuracy of the Backpropagation Neural Network (BPNN) and Learning Vector Quantization (LVQ) approaches in recognizing Sundanese characters. Based on experiments, the level of accuracy that has been obtained by the BPNN technique is 95.23% and the LVQ technique is 66.66%. Meanwhile, the learning time that has been required by the BPNN technique is 2 minutes 45 seconds and then the LVQ method is 17 minutes 22 seconds. The results indicated that the BPNN technique was better than the LVQ technique in recognizing Sundanese characters in accuracy and learning time.

• 한국컴퓨터정보학회논문지
• /
• 제15권7호
• /
• pp.11-17
• /
• 2010

본 논문에서는 클래스 불균형 학습을 위한 이차 최적화 문제의 해를 구하는 개선된 SMO 학습 알고리즘을 제안한다. 클래스에 서로 다른 정규화 값이 부여되는 지지벡터기계의 최적화 문제의 구현에 SMO 알고리즘이 적합하며, 제안된 알고리즘은 서로 다른 클래스에서 선택된 두 라그랑지 변수의 현재 해를 구하는 학습 단계를 반복한다. 제안된 학습 알고리즘은 UCI 벤치마킹 문제에서 테스트되어 클래스 불균형 분포를 반영하는 g-mean 평가를 이용한 일반화 성능이 SMO 알고리즘과 비교되었다. 실험 결과에서 제안된 알고리즘은 SMO에 비해 적은 클래스 데이터의 예측율을 높이고 학습시간을 단축시킬 수 있다.

• 한국공간구조학회논문집
• /
• 제21권2호
• /
• pp.99-110
• /
• 2021

This study presents the estimation of crack depth by analyzing temperatures extracted from thermal images and environmental parameters such as air temperature, air humidity, illumination. The statistics of all acquired features and the correlation coefficient among thermal images and environmental parameters are presented. The concrete crack depths were predicted by four different machine learning models: Multi-Layer Perceptron (MLP), Random Forest (RF), Gradient Boosting (GB), and AdaBoost (AB). The machine learning algorithms are validated by the coefficient of determination, accuracy, and Mean Absolute Percentage Error (MAPE). The AB model had a great performance among the four models due to the non-linearity of features and weak learner aggregation with weights on misclassified data. The maximum depth 11 of the base estimator in the AB model is efficient with high performance with 97.6% of accuracy and 0.07% of MAPE. Feature importances, permutation importance, and partial dependence are analyzed in the AB model. The results show that the marginal effect of air humidity, crack depth, and crack temperature in order is higher than that of the others.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권1호
• /
• pp.38-59
• /
• 2022

Web services instances can be classified into two categories, namely trusted and untrusted from users. A web service with high throughput (TP) and low response time (RT) instance values is a trusted web service. Web services are not trustworthy due to the mismatch in the guaranteed instance values and the actual values achieved by users. To perform web services selection from users' attained TP and RT values, we need to verify the correct prediction of trusted and untrusted instances from invoked web services. This accurate prediction of web services instances is used to perform the selection of web services. We propose to construct fuzzy rules to label web services instances correctly. This paper presents web services selection using a well-known machine learning algorithm, namely REPTree, for the correct prediction of trusted and untrusted instances. Performance comparison of REPTree with five machine learning models is conducted on web services datasets. We have performed experiments on web services datasets using a ten k-fold cross-validation method. To evaluate the performance of the REPTree classifier, we used accuracy metrics (Sensitivity and Specificity). Experimental results showed that web service (WS1) gained top selection score with the (47.0588%) trusted instances, and web service (WS2) was selected the least with (25.00%) trusted instances. Evaluation results of the proposed web services selection approach were found as (asymptotic sig. = 0.019), demonstrating the relationship between final selection and recommended trust score of web services.