• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2000년도 춘계학술대회 학술발표 논문집
• /
• pp.63-68
• /
• 2000

In this paper, a control algorithm suitable for multi-objective control problems is proposed based on the orthogonal array which is normally used in statistics and industrial engineering. And a newly defined Nth-certainty factor is suggested, which can effectively exclude the less confident rules. The Nth-certainty factor is defined by the F-values of the ANOVA(analysis of variance) table. It is shown that the algorithm can be successfully adopted to the design of controller for an active magnetic bearing system.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제10권1호
• /
• pp.89-93
• /
• 2010

In this paper a new fuzzy clustering approach to the color clustering problem has been proposed. To deal with the limitations of the traditional FCM algorithm, we propose a spatial homogeneity-based FCM algorithm. Moreover, the cluster validity index is employed to automatically determine the number of clusters for a given image. We refer to this method as VS-FCM algorithm. The effectiveness of the proposed method is demonstrated through various clustering examples.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1995년도 추계학술대회 학술발표 논문집
• /
• pp.98-103
• /
• 1995

In this paper, a method is presented for finding an optimal temperature control pattern in microwaveoven using genetic algorithm. Power spectrum of temperature variance of charcoal is obtained and oven system modeling with fuzzy-neural-network is explained. Fan on/off timing is converted to strings in gene pool and then genetic iterations make the power spectrum of simmulated temperature variance of microwave oven closer to that o charcoal.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1995년도 추계학술대회 학술발표 논문집
• /
• pp.218-223
• /
• 1995

A new design scheme of a binary decision tree is proposed. In this scheme a binary decision tree is constructed by using genetic algorithm and FCM algorithm. At each node optimal or near-optimal feature or feature subset among all the available features is selected based on fitness function in genetic algorithm which is inversely proportional to classification error, balance between cluster, number of feature used. The proposed design scheme is applied to the handwtitten alphabetic characters. Experimental results show the usefulness of the proposed scheme.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2002년도 추계학술대회 및 정기총회
• /
• pp.375-378
• /
• 2002

In this paper we propose parallel GA to optimize mutation rate and crossover rate using server-client model. The performance of GA depend on the good choice of crossover and mutation rates. Although many researcher has been study about the good choice, it is still unsolved problem. proposed GA optimize crossover and mutation rates trough evolving subpopulation. In virtue of the server-client model, these parameters can be evolved rapidly with relatively low-grade

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2006년도 추계학술대회 학술발표 논문집 제16권 제2호
• /
• pp.305-309
• /
• 2006

In this paper, a face recognition algorithm system using Principle Component Analysis is proposed. The algorithm recognized a person by comparing characteristics (features) of the face to those of known individuals which is a face database of Intelligence Control Laboratory(ICONL). Experiments were simulated in order to demonstrate the performance of this algorithm due to face recognition which presented for the classification of face and non-face and the classification of known and unknown.

• 한국지능시스템학회논문지
• /
• 제15권4호
• /
• pp.451-456
• /
• 2005

본 논문에서는 유전 알고리즘의 한 방법인 mGA를 이용하여 지능형 로봇의 주행제어 방법을 제안한다. 지능형 로봇의 주행에 필요한 퍼지 제어기의 설계는 전문가적 지식에 많이 의존한다. 이러한 전문가의 경험에 의해 설정된 퍼지 제어기의 여러 구성 요소들의 매개 변수 값들이 최적의 값이라는 보장이 없다. 상기 문제를 해결하기 위해 본 논문에서는 퍼지 제어 기의 구성 요소인 퍼지 규칙의 수와 멤버쉽 함수의 매개 변수들을 mGA를 이용하여 동정하는 방법을 제안한다. 제안된 방법에 의해 동정된 매개 변수들의 정확성과 효율성을 평가하기 위하여 지능형 로봇의 벽면 주행에 대한 모의실험을 수행한다.

• 한국지능시스템학회논문지
• /
• 제18권4호
• /
• pp.518-523
• /
• 2008

본 논문에서는 저압 배선 진단 시스템 개발에서 핵심 파트 중 하나인 지능형 차단 시스템 구축을 목표로 한다. 제안된 진단 시스템은 TFDR (Time-Frequency Domain Reflectometry) 알고리즘을 바탕으로 하여 실제 전압이 흐르는 배선에 대해 이상 거리 측정을 하게 된다. 그리고 배선으로부터 얻은 정보를 바탕으로 배선 이상의 종류를 분석하는 것이 지능형 차단 시스템의 목표이다. 효율적인 분석을 위해, 본 논문에서는 퍼지-베이시안 (Fuzzy-Bayesian) 알고리즘을 바탕으로 하여 시스템을 구성하였다. 실제 저압 배선에서 실험된 데이터를 바탕으로 한 실험을 통해 제안된 기술의 우수성을 입증하고자 한다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제16권4호
• /
• pp.270-275
• /
• 2016

We present an approach for acceleration actor-critic algorithm for reinforcement learning with continuous action space. Actor-critic algorithm has already proved its robustness to the infinitely large action spaces in various high dimensional environments. Despite that success, the main problem of the actor-critic algorithm remains the same-speed of convergence to the optimal policy. In high dimensional state and action space, a searching for the correct action in each state takes enormously long time. Therefore, in this paper we suggest a search accelerating function that allows to leverage speed of algorithm convergence and reach optimal policy faster. In our method, we assume that actions may have their own distribution of preference, that independent on the state. Since in the beginning of learning agent act randomly in the environment, it would be more efficient if actions were taken according to the some heuristic function. We demonstrate that heuristically-accelerated actor-critic algorithm learns optimal policy faster, using Educational Process Mining dataset with records of students' course learning process and their grades.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.392-394
• /
• 2003

There is a well-known simple, stable standard merge algorithm, which uses only linear time but for the price of double space. This extra space consumption has been often remarked as lack of the standard merge sort algorithm that covers a merge process as central operation. In-place merging is a way to overcome this lack and so is a topic with a long tradition of inspection in the area of theoretical computer science. We present an in-place merging algorithm that rear-ranges the elements to be merged by rotation, a special form of block interchanging. Our algorithm is novel, due to its technique of determination of the rotation-areas. Further it has a short and transparent definition. We will give a presentation of our algorithm and prove that it needs in the worst case not more than twice as much comparisons as the standard merge algorithm. Experimental work has shown that our algorithm is efficient and so might be of high practical interest.