• 한국융합학회논문지
• /
• 제12권10호
• /
• pp.37-43
• /
• 2021

본 연구는 대학생의 중도탈락 패턴을 식별하는 효과적인 자동 분류 기법을 제안하고, 이를 바탕으로 중도탈락을 예방하기 위한 지능형 추천 시스템의 구현 방안을 제시하는 것을 목표로 한다. 이를 위해 1) 실제 대학생의 재학/제적 데이터를 기반으로 기계 학습의 성능을 향상시킬 수 있는 데이터 처리 방안을 제안하고, 2) 5종의 기계학습 알고리즘을 이용하여 성능 비교 실험을 실시하였다. 3) 실험 결과, 제안 기법이 베이스라인에 비해 모든 알고리즘에서 우수한 성능을 보여주었다. 제적생의 식별 정확률(precision)은 랜덤 포레스트(Random Forest)를 사용할 때 최대 95.6%, 제적생의 재현율(recall)은 나이브 베이즈(Naive Bayes)를 사용할 때 최대 80.0%로 측정되었다. 4) 마지막으로, 실험 결과를 바탕으로 중도탈락 가능성이 높은 학생을 우선 상담하는 추천 시스템의 활용 방안을 제시하였다. 교육 현안 문제를 해결하기 위해 IT 분야의 기술을 활용하는 융합 연구를 통해 합리적인 의사결정을 수행할 수 있음을 확인하였으며 향후 지속적인 연구를 통해 다양한 인공지능 기술을 적용하고자 한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.941-946
• /
• 2005

In this paper an active random noise control using adaptive learning rate neural networks is presented. The adaptive learning rate strategy increases the learning rate by a small constant if the current partial derivative of the objective function with respect to the weight and the exponential average of the previous derivatives have the same sign, otherwise the learning rate is decreased by a proportion of its value. The use of an adaptive learning rate attempts to keep the learning step size as large as possible without leading to oscillation. It is expected that a cost function minimize rapidly and training time is decreased. Numerical simulations and experiments of active random noise control with the transfer function of the error path will be performed, to validate the convergence properties of the adaptive learning rate Neural Networks. Control results show that adaptive learning rate Neural Networks control structure can outperform linear controllers and conventional neural network controller for the active random noise control.

• International Journal of Control, Automation, and Systems
• /
• 제6권4호
• /
• pp.559-570
• /
• 2008

This paper proposes an improved particle swarm optimization named PSO with Controllable Random Exploration Velocity (PSO-CREV) behaving an additional exploration behavior. Different from other improvements on PSO, the updating principle of PSO-CREV is constructed in terms of stochastic approximation diagram. Hence a stochastic velocity independent on cognitive and social components of PSO can be added to the updating principle, so that particles have strong exploration ability than those of conventional PSO. The conditions and main behaviors of PSO-CREV are described. Two properties in terms of "divergence before convergence" and "controllable exploration behavior" are presented, which promote the performance of PSO-CREV. An experimental method based on a complex test function is proposed by which the proper parameters of PSO-CREV used in practice are figured out, which guarantees the high exploration ability, as well as the convergence rate is concerned. The benchmarks and applications on FCRNN training verify the improvements brought by PSO-CREV.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권4호
• /
• pp.265-276
• /
• 2004

Genetic Algorithm(GA), that is shown stable performance to find an optimal solution, has been used as a method of solving large-scaled optimization problems with complex constraints in various applications. Since it takes so much time to execute a long computation process for iterative evolution and adaptation. In this paper, a hardware-based adaptive GA was proposed to reduce the serious computation time of the evolutionary process and to improve the accuracy of convergence to optimal solution. The proposed GA, based on steady-state model among continuos generation model, performs an adaptive mutation process with consideration of the evolution flow and the population diversity. The drawback of the GA, premature convergence, was solved by the proposed adaptation. The Performance improvement of convergence accuracy for some kinds of problem and condition reached to 5-100% with equivalent convergence speed to high-speed algorithm. The proposed adaptive GAP(Genetic Algorithm Processor) was implemented on FPGA device Xilinx XCV2000E of EHW board for face recognition.

• 대한수학회보
• /
• 제38권4호
• /
• pp.763-772
• /
• 2001

The rate of convergence for an almost surely convergent series $S_n={\Sigma^n}_{i-1}X_i$ of independent random variables is studied in this paper. More specifically, when S$_{n}$ converges almost surely to a random variable S, the tail series $T_n{\equiv}$ S - S_{n-1} = {\Sigma^\infty}_{i-n} X_i$ is a well-defined sequence of random variables with T$_{n}$ $\rightarrow$ 0 almost surely. Conditions are provided so that for a given positive sequence {$b_n, n {\geq$ 1}, the limit law sup$_{\kappa}\geqn | T_{\kappa}|/b_n \rightarrow$ 0 holds. This result generalizes a result of Nam and Rosalsky [4].

• 산업경영시스템학회지
• /
• 제20권43호
• /
• pp.299-319
• /
• 1997

Since a convergence strategy in interactive procedure is the origin of a lot of the restrictions and inconvenience of many methods, a new flexible convergence strategy is necessary for developing that is applicable for interactive MOLP as well as interactive multiple objective integer programming(MOIP). A method for computing the volume of the interval defined subsets of weighting vector space is developed using Sobol's LP$_{i}$, Generator. Since the interactive procedure requires a number of iterations, with a fixed number of solutions presented per iteration, a convergence strategy is needed to control the rate at which the interactive procedure converges to a final solution. Thus, in this paper, a new convergency strategy is developed.

• 대한수학회보
• /
• 제55권4호
• /
• pp.1241-1261
• /
• 2018

We derive discrete time model of the geometric fractional Brownian motion. It provides numerical pricing scheme of financial derivatives when the market is driven by geometric fractional Brownian motion. With the convergence analysis, we guarantee the convergence of Monte Carlo simulations. The strong convergence rate of our scheme has order H which is Hurst parameter. To obtain our model we need to convert Wick product term of stochastic differential equation into Wick free discrete equation through Malliavin calculus but ours does not include Malliavin derivative term. Finally, we include several numerical experiments for the option pricing.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 1998년도 춘계학술대회논문집; 용평리조트 타워콘도, 21-22 May 1998
• /
• pp.670-677
• /
• 1998

Many of the adaptive noise control systems utilize a form of the least mean square (LMS) algorithm. In the active control of noise, it is common practice to locate an error microphone far from the control source to avoid the near-field effects by evanescent waves. Such a distance between the control source and the error microphone makes a certain level of time-delay inevitable and, hence, may yield undesirable effects on the convergence properties of control algorithms such as filtered-x LMS. This paper discusses the dependence of the convergence rate on the acoustic error path in these popular algorithms and introduces new algorithms which increase the convergence region regardless of the time-delay in the acoustic error path. Performances of the new LMS algorithms are presented in comparison with those by the conventional algorithms based on computer stimulations and experiments.

• Journal of applied mathematics & informatics
• /
• 제29권3_4호
• /
• pp.669-680
• /
• 2011

In this paper, some strong convergence theorems are obtained for hybrid method for modified Ishikawa iteration process of asymptotically nonexpansive mappings and asymptotically nonexpansive semigroups in Hilbert spaces. The results presented in this article generalize and improve results of Tae-Hwa Kim and Hong-Kun Xu and others. The convergence rate of the iteration process presented in this article is faster than hybrid method of Tae-Hwa Kim and Hong-Kun Xu and others.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2011년도 추계학술대회
• /
• pp.607-608
• /
• 2011

본 논문에서는 터널 내에 정지한 차량에 대한 검출 알고리즘을 제안한다. 제안 알고리즘은 배경 추정을 통하여 객체를 분리하고, 차량등 컬러 정보의 실험적 분석을 통하여 효과적으로 차량을 검출하였다. 모의 실험 결과는 터널 영상에 대하여 95% 이상의 정지 차량 검출율을 보여준다.