• 대한임베디드공학회논문지
• /
• 제17권5호
• /
• pp.297-307
• /
• 2022

The simple procedural segment selection algorithm commonly used in Dynamic Adaptive Streaming over HTTP (DASH) reveals severe weakness to provide high-quality streaming services in the integrated mobile networks of various wired and wireless links. A major issue could be how to properly cope with dynamically changing underlying network conditions. The key to meet it should be to make the segment selection algorithm much more adaptive to fluctuation of network traffics. This paper presents a system architecture that replaces the existing procedural segment selection algorithm with a deep reinforcement learning algorithm based on the Asynchronous Advantage Actor-Critic (A3C). The distributed A3C-based deep learning server is designed and implemented to allow multiple clients in different network conditions to stream videos simultaneously, collect learning data quickly, and learn asynchronously, resulting in greatly improved learning speed as the number of video clients increases. The performance analysis shows that the proposed algorithm outperforms both the conventional DASH algorithm and the Deep Q-Network algorithm in terms of the user's quality of experience and the speed of deep learning.

• Nuclear Engineering and Technology
• /
• 제55권2호
• /
• pp.506-515
• /
• 2023

This study is to find a method to learn engine sound after the start-up of a diesel generator installed in nuclear power plant with an unsupervised deep learning algorithm (CNN autoencoder) and a new method to predict the failure of a diesel generator using it. In order to learn the sound of a diesel generator with a deep learning algorithm, sound data recorded before and after the start-up of two diesel generators was used. The sound data of 20 min and 2 h were cut into 7 s, and the split sound was converted into a spectrogram image. 1200 and 7200 spectrogram images were created from sound data of 20 min and 2 h, respectively. Using two different deep learning algorithms (CNN autoencoder and binary classification), it was investigated whether the diesel generator post-start sounds were learned as normal. It was possible to accurately determine the post-start sounds as normal and the pre-start sounds as abnormal. It was also confirmed that the deep learning algorithm could detect the virtual abnormal sounds created by mixing the unusual sounds with the post-start sounds. This study showed that the unsupervised anomaly detection algorithm has a good accuracy increased about 3% with comparing to the binary classification algorithm.

• International Journal of Computer Science & Network Security
• /
• 제23권8호
• /
• pp.190-198
• /
• 2023

To enhance customer satisfaction for higher profits, an e-commerce sector can establish a continuous relationship and acquire new customers. Utilize machine-learning models to analyse their customer's behavioural evidence to produce their competitive advantage to the e-commerce platform by helping to improve overall satisfaction. These models will forecast customers who will churn and churn causes. Forecasts are used to build unique business strategies and services offers. This work is intended to develop a machine-learning model that can accurately forecast retainable customers of the entire e-commerce customer data. Developing predictive models classifying different imbalanced data effectively is a major challenge in collected data and machine learning algorithms. Build a machine learning model for solving class imbalance and forecast customers. The satisfaction accuracy is used for this research as evaluation metrics. This paper aims to enable to evaluate the use of different machine learning models utilized to forecast satisfaction. For this research paper are selected three analytical methods come from various classifications of learning. Classifier Selection, the efficiency of various classifiers like Random Forest, Logistic Regression, SVM, and Gradient Boosting Algorithm. Models have been used for a dataset of 8000 records of e-commerce websites and apps. Results indicate the best accuracy in determining satisfaction class with both gradient-boosting algorithm classifications. The results showed maximum accuracy compared to other algorithms, including Gradient Boosting Algorithm, Support Vector Machine Algorithm, Random Forest Algorithm, and logistic regression Algorithm. The best model developed for this paper to forecast satisfaction customers and accuracy achieve 88 %.

• International Journal of Advanced Culture Technology
• /
• 제6권2호
• /
• pp.123-128
• /
• 2018

Learning data is composed of 100 characters with 10 different fonts, and test data is composed of 10 characters with a new font that is not used for the learning data. In order to consider the variety of learning data with several different fonts, 10 learning masks are constructed by accumulating pixel values of same characters with 10 different fonts. This process eliminates minute difference of characters with different fonts. After finding maximum values of learning masks, test data is expanded by multiplying these maximum values to the test data. The algorithm calculates sum of differences of two corresponding pixel values of the expanded test data and the learning masks. The learning mask with the smallest value among these 10 calculated sums is selected as the result of the recognition process for the test data. The proposed algorithm can recognize various types of fonts, and the learning data can be modified easily by adding a new font. Also, the recognition process is easy to understand, and the algorithm makes satisfactory results for character recognition.

• 말소리와 음성과학
• /
• 제3권3호
• /
• pp.91-98
• /
• 2011

In this paper, a multi-channel speech enhancement method using the linearly constrained minimum variance (LCMV) algorithm and a variable learning rate control is proposed. To control the learning rate for adaptive filters of the LCMV algorithm, the direction of arrival (DOA) is measured for each short-time input signal and the likelihood function of the target speech presence is estimated to control the filter learning rate. Using the likelihood measure, the learning rate is increased during the pure noise interval and decreased during the target speech interval. To optimize the parameter of the mapping function between the likelihood value and the corresponding learning rate, an exhaustive search is performed using the Bark's scale distortion (BSD) as the performance index. Experimental results show that the proposed algorithm outperforms the conventional LCMV with fixed learning rate in the BSD by around 1.5 dB.

• 컴퓨터교육학회논문지
• /
• 제14권2호
• /
• pp.13-22
• /
• 2011

창의적 문제해결 능력을 위한 알고리즘 교육의 중요성이 강조되고 있다. 특히 수학 과학과 연계된 논리적 사고력 증진을 위한 알고리즘 교재 개발이 추진 중 이다. 그러나 교육현장에서 적용 가능한 교수-학습 모형에 대한 제시가 미비한 실정이다. 따라서 본 연구는 효과적인 알고리즘 교육을 위한 교수-학습 모형을 제시한다. 나선형 모형으로 학습 진도를 진행하며, 논리적 사고력을 기반으로 하는 알고리즘 교육의 특성을 반영하여 교수-학습 모형을 개발하였다. 또한 학습자의 만족도를 위하여 설문을 실시하였으며, 그 결과로 설계된 교수-학습 모형은 PBL과 자기주도학습 및 동료교수법의 혼합 모형이다. 제시된 모형에 근거하여 수학과 과학의 수업 예시를 구성하여 적용 가능성을 보였다.

• 컴퓨터교육학회논문지
• /
• 제16권2호
• /
• pp.9-18
• /
• 2013

정보 교과는 정보과학적 사고와 원리를 통해 창의적 문제해결력 함양을 교육목표로 하며, 문제 해결 방법과 절차 단원을 통하여 알고리즘 학습을 강조한다. 알고리즘 학습이 문제해결력 향상에 효과가 있다는 선행연구들을 바탕으로 창의적 문제해결력 향상에도 효과를 입증하는 연구들이 이루어지고 있다. 그러나 이러한 연구들이 알고리즘 내용보다는 CPS와 같은 교수학습 모형이나 콘텐츠에 의존하고 있기 때문에 알고리즘 학습의 중요성이 상대적으로 약해질 수 있다. 본 연구는 일반적인 문제해결과정과 창의적 문제해결과정이 동일하다는 관점에서 알고리즘 학습이 창의적 문제해결력 향상에 효과가 있음을 검증한다. 이를 위하여 일반적인 사고 가운데 창의적인 사고로 간주되는 유추 추론(analogical reasoning)에 대하여 살펴보고, 유추 추론에 필요한 바탕 지식으로 분할 정복 알고리즘을 선택하였다. 퀵 정렬 알고리즘 학습 실험 결과, 분할 정복 알고리즘의 원리 학습한 실험집단과 알고리즘의 절차만 학습한 통제집단이 퀵 정렬 문제를 해결하는 비율에는 차이가 없었으나, 탐색 문제에서는 실험집단이 통제집단 보다 이진 탐색을 사용하는 비율이 더 높았다. 이는 분할 정복과 같은 추상적인 원리를 포함하는 알고리즘 학습이 새로운 영역의 문제를 해결하는 유추 추론에 효과가 있으며, 이는 창의적 문제해결력 향상으로 이어질 수 있음을 의미한다.

• 한국정보처리학회논문지
• /
• 제6권3호
• /
• pp.633-640
• /
• 1999

Reinforcement learning performs learning through interacting with trial-and-error in dynamic environment. Therefore, in dynamic environment, reinforcement learning method like Q-learning and TD(Temporal Difference)-learning are faster in learning than the conventional stochastic learning method. However, because many of the proposed reinforcement learning algorithms are given the reinforcement value only when the learning agent has reached its goal state, most of the reinforcement algorithms converge to the optimal solution too slowly. In this paper, we present COMREL(COMpressed REinforcement Learning) algorithm for finding the shortest path fast in a maze environment, select the candidate states that can guide the shortest path in compressed maze environment, and learn only the candidate states to find the shortest path. After comparing COMREL algorithm with the already existing Q-learning and Priortized Sweeping algorithm, we could see that the learning time shortened very much.

• 디지털융복합연구
• /
• 제14권2호
• /
• pp.245-258
• /
• 2016

본 논문에서는 기계학습과 관련된 다양한 사례들에 대한 연구를 바탕으로 기계학습 응용 및 학습 알고리즘의 성능 개선 방안을 제시한다. 이를 위해 기계학습 기법을 적용하여 결과를 얻어낸 문헌을 자료로 수집하고 학문분야로 나누어 각 분야에서 적합한 기계학습 기법을 선택 및 추천하였다. 공학에서는 SVM, 의학에서는 의사결정나무, 그 외 분야에서는 SVM이 빈번한 이용 사례와 분류/예측의 측면에서 그 효용성을 보였다. 기계학습의 적용 사례분석을 통해 응용 방안의 일반적 특성화를 꾀할 수 있었다. 적용 단계는 크게 3단계로 이루어진다. 첫째, 데이터 수집, 둘째, 알고리즘을 통한 데이터 학습, 셋째, 알고리즘에 대한 유의미성 테스트 이며, 각 단계에서의 알고리즘의 결합을 통해 성능을 향상시킨다. 성능 개선 및 향상의 방법은 다중 기계학습 구조 모델링과 $+{\alpha}$ 기계학습 구조 모델링 등으로 분류한다.

• 한국인공지능학회지
• /
• 제5권1호
• /
• pp.1-9
• /
• 2017

Recently, the Q-Learning algorithm, which is one kind of reinforcement learning, is mainly used to implement artificial intelligence system in combination with deep learning. Many research is going on to improve the performance of Q-Learning. Therefore, purpose of theory try to improve the performance of Q-Learning algorithm. This Theory apply Cross Entropy Error to the loss function of Q-Learning algorithm. Since the mean squared error used in Q-Learning is difficult to measure the exact error rate, the Cross Entropy Error, known to be highly accurate, is applied to the loss function. Experimental results show that the success rate of the Mean Squared Error used in the existing reinforcement learning was about 12% and the Cross Entropy Error used in the deep learning was about 36%. The success rate was shown.