• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.2
• /
• pp.68-77
• /
• 2017

In order to implement the smart home environment, we need an intelligence service platform that learns the user's life style and behavioral patterns, and recommends appropriate services to the user. The intelligence service platform should embed a couple of effective and efficient data mining algorithms for learning from the data that is gathered from the smart home environment. In this study, we evaluate the suitability of data mining algorithms for smart home intelligent service platforms. In order to do this, we first develop an intelligent service scenario for smart home environment, which is utilized to derive functional and technical requirements for data mining algorithms that is equipped in the smart home intelligent service platform. We then evaluate the suitability of several data mining algorithms by employing the analytic hierarchy process technique. Applying the analytical hierarchy process technique, we first score the importance of functional and technical requirements through a hierarchical structure of pairwise comparisons made by experts, and then assess the suitability of data mining algorithms for each functional and technical requirements. There are several studies for smart home service and platforms, but most of the study have focused on a certain smart home service or a certain service platform implementation. In this study, we focus on the general requirements and suitability of data mining algorithms themselves that are equipped in smart home intelligent service platform. As a result, we provide a general guideline to choose appropriate data mining techniques when building a smart home intelligent service platform.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.1
• /
• pp.86-93
• /
• 2007

A new operation termed competitive generation in the processes of genetic algorithms is proposed for accelerating the optimization speed of genetic algorithms. The competitive generation devised by considering the competition of sperms for fertilization provides a good opportunity for the genetic algorithms to approach global optimum without falling into local optimum. Experimental results with typical problems showed that the genetic algorithms with competitive generation are superior to those without the competitive generation.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.625-628
• /
• 1998

This paper presents an application of genetic algorithms(GAs) for optimal configuration of distribution network. Three problems have been used to show how genetic algorithms are modified and applied. Solutions to the problems are found by minimizing the cost function which is directly related with balancing the loads. Simulation results show that genetic algorithms are technically feasible if they are tailored to meet the needs of real problems.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.5
• /
• pp.630-634
• /
• 2004

According to the progress of an information-oriented society, more human friendly systems are required. The systems can be implemented by a kind of intelligent algorithms. In this paper we propose the possibility of the implementation of an intelligent algorithm from gene, behavior of human beings, which has some properties such as self organization and self regulation. The regulation of gene behavior is widely analyzed by Boolean network. Also the SORE (Self Organizable and Regulating Engine) is one of those algorithms. This paper does not report detailed research results; rather, it studies the feasibility of gene behavior in biocontrol systems based upon computer simulations.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.607-612
• /
• 1998

In this paper, a controller using fuzzy-genetic algorithms is proposed for pat-tracking of WMR. A fuzzy controller is implemented so as to adjust appropriate crossover rate and mutation rate. A genetic algorithms is also implemented to have adaptive adjustment of control gain during optimizing process. To check effectiveness of this algorithms, computer simulation is applied.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.391-394
• /
• 1998

In this paper, we try to analyze two kinds of conventional neuro-fuzzy learning algorithms, which are widely used in recent fuzzy applications for tuning fuzzy rules, and give a summarization of their properties. Some of these properties show that uses of the conventional neuro-fuzzy learning algorithms are sometimes difficult or inconvenient for constructing an optimal fuzzy system model in practical fuzzy applications.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.4
• /
• pp.284-290
• /
• 2013

Feature detection is very important to image processing area. In this paper we compare and analyze some characteristics of image processing algorithms for corner and blob feature detection. We also analyze the simulation results through image matching process. We show that how these algorithms work and how fast they execute. The simulation results are shown for helping us to select an algorithm or several algorithms extracting corner and blob feature.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.7
• /
• pp.598-602
• /
• 2001

Recently, due to the widely use of personal computers and internet, many computer users requested intelligent system that can cope with various types of requirements and user-friendly interfaces. Based on this background, researches on the intelligent agent are now activating in various fields. In this paper, we modeled, designed and implemented an intelligent agent system for pattern classification by adopting intelligent agent concepts. We also investigated the pattern classification method by utilizing some pattern classification algorithms for the common data. As a result, we identified that 300 3-dimensional data are applied to three pattern classification algorithms and returned correct results. Our system showed a distinguished user-friendly interface feature by adopting various agents including graphic agent.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.10 no.1
• /
• pp.31-36
• /
• 2010

Many clustering algorithms have been used in diverse fields. When we need to group given data set into clusters, many clustering algorithms based on similarity or distance measures are considered. Most clustering works have been based on hierarchical and non-hierarchical clustering algorithms. Generally, for the clustering works, researchers have used clustering algorithms case by case from these algorithms. Also they have to determine proper clustering methods subjectively by their prior knowledge. In this paper, to solve the subjective problem of clustering we make empirical comparisons of popular clustering algorithms which are hierarchical and non hierarchical techniques using Silhouette measure. We use silhouette information to evaluate the clustering results such as the number of clusters and cluster variance. We verify our comparison study by experimental results using data sets from UCI machine learning repository. Therefore we are able to use efficient and objective clustering algorithms.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• pp.420-426
• /
• 1998

Evolutionary algorithms are probabilistic optimization algorithms based on the model of natural evolution. Recently the efforts to improve the performance of evolutionary algorithms have been made extensively. In this paper, we introduce the research for improving the convergence rate and search faculty of evolution algorithms by using reinforcement learning. After providing an introduction to evolution algorithms and reinforcement learning, we present adaptive genetic algorithms, reinforcement genetic programming, and reinforcement evolution strategies which are combined with reinforcement learning. Adaptive genetic algorithms generate mutation probabilities of each locus by interacting with the environment according to reinforcement learning. Reinforcement genetic programming executes crossover and mutation operations based on reinforcement and inhibition mechanism of reinforcement learning. Reinforcement evolution strategies use the variances of fitness occurred by mutation to make the reinforcement signals which estimate and control the step length.