• ETRI Journal
• /
• 제44권5호
• /
• pp.733-745
• /
• 2022

In software-defined wireless networking (SDWN), the optimal routing technique is one of the effective solutions to improve its performance. This routing technique is done by many different methods, with the most common using integer linear programming problem (ILP), building optimal routing metrics. These methods often only focus on one routing objective, such as minimizing the packet blocking probability, minimizing end-to-end delay (EED), and maximizing network throughput. It is difficult to consider multiple objectives concurrently in a routing algorithm. In this paper, we investigate the application of machine learning to control routing in the SDWN. An intelligent routing algorithm is then proposed based on the machine learning to improve the network performance. The proposed algorithm can optimize multiple routing objectives. Our idea is to combine supervised learning (SL) and reinforcement learning (RL) methods to discover new routes. The SL is used to predict the performance metrics of the links, including EED quality of transmission (QoT), and packet blocking probability (PBP). The routing is done by the RL method. We use the Q-value in the fundamental equation of the RL to store the PBP, which is used for the aim of route selection. Concurrently, the learning rate coefficient is flexibly changed to determine the constraints of routing during learning. These constraints include QoT and EED. Our performance evaluations based on OMNeT++ have shown that the proposed algorithm has significantly improved the network performance in terms of the QoT, EED, packet delivery ratio, and network throughput compared with other well-known routing algorithms.

• International journal of advanced smart convergence
• /
• 제7권3호
• /
• pp.15-22
• /
• 2018

Nowadays multiple control methods are used in robot control systems. A model, predictor or error estimator is often used as feedback controller to control a robot. While robots have become more and more intensive with algorithms capable to acquiring independent knowledge from raw data. This paper represents experimental results of real time machine learning control that does not require explicit knowledge about the plant. The controller can be applied on a broad range of tasks with different dynamic characteristics. We tested our controller on the balancing problem of a single propeller pendulum. Experimental results show that the use of a supervised machine learning algorithm in a single propeller pendulum allows the stable swing of a given angle.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제8권1호
• /
• pp.1-5
• /
• 2008

Generally the analytical tools of data mining have two learning types which are supervised and unsupervised learning algorithms. Classification and prediction are main analysis tools for supervised learning. In this paper, we perform a comparison study of classification algorithms in data mining. We make comparative studies between popular classification algorithms which are LDA, QDA, kernel method, K-nearest neighbor, naive Bayesian, SVM, and CART. Also, we use almost all classification data sets of UCI machine learning repository for our experiments. According to our results, we are able to select proper algorithms for given classification data sets.

• 한국농공학회논문집
• /
• 제64권1호
• /
• pp.15-26
• /
• 2022

3D open-field farm model developed from UAV (Unmanned Aerial Vehicle) data could make crop monitoring easier, also could be an important dataset for various fields like remote sensing or precision agriculture. It is essential to separate crops from the non-crop area because labeling in a manual way is extremely laborious and not appropriate for continuous monitoring. We, therefore, made a 3D open-field farm model based on UAV images and developed a crop segmentation model using a supervised machine learning algorithm. We compared performances from various models using different data features like color or geographic coordinates, and two supervised learning algorithms which are SVM (Support Vector Machine) and KNN (K-Nearest Neighbors). The best approach was trained with 2-dimensional data, ExGR (Excess of Green minus Excess of Red) and z coordinate value, using KNN algorithm, whose accuracy, precision, recall, F1 score was 97.85, 96.51, 88.54, 92.35% respectively. Also, we compared our model performance with similar previous work. Our approach showed slightly better accuracy, and it detected the actual crop better than the previous approach, while it also classified actual non-crop points (e.g. weeds) as crops.

• 문화기술의 융합
• /
• 제8권6호
• /
• pp.207-213
• /
• 2022

MBTI(Myer Briggs Type Indicator)는 사람들의 성향을 직관적으로 파악하고 분류하는데 효과적인 성격유형검사이다. 이에 따라 학습 영역에 MBTI를 적용하려는 시도가 활발히 이뤄지고 있으나, MBTI를 활용하여 새로운 학습유형을 만드는 연구는 부족한 실정이다. 따라서 본 논문은 학습에 영향을 미치는 요인들을 살펴보고, 이를 특성으로 하는 머신러닝 알고리즘에 적용하여 새로운 학습 유형 MY, STI(MY, Study Type Indicator)를 구현했다. 데이터는 일반인 144명에게 구글폼으로 제작한 학습유형 검사를 실시하여 수집하였고, 머신러닝 중 지도 학습을 사용하여 학습시켰다. 그 결과 MY, STI의 정확도는 학습 방법, 학습 동기, 외부 자극 유무, 학습 시간 기준별 각각 0.933, 0.866, 0.844, 0.733으로 나타났다.

• 전기전자학회논문지
• /
• 제22권3호
• /
• pp.816-821
• /
• 2018

최근 감정 분석 및 질병 진단을 위한 뇌파 연구 분야에서 인공 신경망을 기반으로 한 기계학습 알고리즘이 분류기로 널리 사용되기 시작했다. 뇌파 데이터 분류를 위해 기계학습 모델을 사용하는 경우 유사한 특성을 가지는 데이터만으로 학습데이터가 구성되면 다른 그룹의 데이터에 적용했을 때 분류 성능이 떨어질 수 있다. 본 논문에서는 이러한 문제점을 개선하기 위해 준 지도학습 알고리즘을 사용해 여러 그룹의 데이터를 선택하여 학습데이터 세트를 구성하는 방법을 제안한다. 이후 제안하는 방법을 사용하여 구성한 학습데이터 세트와 유사한 특성을 가지는 데이터로 구성된 학습데이터 세트로 모델을 학습하여 두 모델의 성능을 비교하였다.

• 대한산업공학회지
• /
• 제39권1호
• /
• pp.30-45
• /
• 2013

Predicting monthly electricity price has been a significant factor of decision-making for plant resource management, fuel purchase plan, plans to plant, operating plan budget, and so on. In this paper, we propose a sophisticated prediction model in terms of the technique of modeling and the variety of the collected variables. The proposed model hybridizes the semi-supervised learning and the artificial neural network algorithms. The former is the most recent and a spotlighted algorithm in data mining and machine learning fields, and the latter is known as one of the well-established algorithms in the fields. Diverse economic/financial indexes such as the crude oil prices, LNG prices, exchange rates, composite indexes of representative global stock markets, etc. are collected and used for the semi-supervised learning which predicts the up-down movement of the price. Whereas various climatic indexes such as temperature, rainfall, sunlight, air pressure, etc, are used for the artificial neural network which predicts the real-values of the price. The resulting values are hybridized in the proposed model. The excellency of the model was empirically verified with the monthly data of electricity price provided by the Korea Energy Economics Institute.

• Communications for Statistical Applications and Methods
• /
• 제15권3호
• /
• pp.343-351
• /
• 2008

By supervised learning with p predictors, we frequently obtain a prediction function of the form $y\;=\;f(x_1,...,x_p)$. When $p\;{\geq}\;3$, it is not easy to understand the inner structure of f, except for the case the function is formulated as additive. In this study, we propose to use p simple graphs for visual understanding of complex prediction functions produced by several supervised learning engines such as LOESS, neural networks, support vector machines and random forests.

• 한국경영과학회지
• /
• 제31권2호
• /
• pp.69-85
• /
• 2006

Transductive Support Vector Machine(TSVM) is one of semi-supervised learning algorithms which exploit the domain structure of the whole data by considering labeled and unlabeled data together. Although it was proposed several years ago, there has been no efficient algorithm which can handle problems with more than hundreds of training examples. In this paper, we propose an efficient branch-and-bound algorithm which can solve large-scale TSVM problems with thousands of training examples. The proposed algorithm uses two bounding techniques: min-cut bound and reduced SVM bound. The min-cut bound is derived from a capacitated graph whose cuts represent a lower bound to the optimal objective function value of the dual problem. The reduced SVM bound is obtained by constructing the SVM problem with only labeled data. Experimental results show that the accuracy rate of TSVM can be significantly improved by learning from the optimal solution of TSVM, rather than an approximated solution.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2024년도 제69차 동계학술대회논문집 32권1호
• /
• pp.49-50
• /
• 2024

본 논문에서는 웹쉘 악성코드를 정확하게 분류하고, 빠른시간안에 자동으로 웹쉘 분류 및 분석을 통하여 웹쉘을 탐지하기 위하여 인공지능 머신러닝 기반의 Supervised AI ML 및 Classification 알고리즘을 적용하여 빠른 시간안에 분류, 정확한 분석을 통하여 자동화된 탐지시스템인 MWSDS를 제안하고 웹쉘 실험 데이터를 통하여 실증하였다. 본제안의 경우 웹쉘악성코드 공격에 대한 대응뿐만아니라 관리적인 정보보호 체계수립을 통하여 보다 효과적이며, 지속적으로 대응할 수 있을 것으로 전망된다.