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

In general, it is very difficult to find optimal fuzzy rules by experience when a system is dynamical and/or complex. Futhermore proper fuzzy partitioning is not deterministic and there is no unique solution. Therefore we propose a new design method of an optimal fuzzy logic controller, that is a co-evolutionary genetic algorithm finding optimal fuzzy rule and proper membership functions at the same time. We formalize the relation between fuzzy rules and membership functions in terms of fitness. We review the typical approaching methods to co-evolutionary genetic algorithms , and then classify them by fitness relation matrix. Applications of the proposed method to a path planning problem of autonomous mobile robots when moving objects exist are presented to demonstrate the performance and effectiveness of the method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.10a
• /
• pp.652-655
• /
• 2018

과반수 문제는 전역 문제(global problem) 문제이기 때문에 국소 정보(local information)를 이용해야 하는 셀룰러 오토마타(cellular automata; CA) 상에서 풀기 어려운 문제이다. 본 논문에서는 일차원 CA에서 과반수 문제를 푸는 CA을 찾는 방법을 제안한다. 상태전이 함수를 CA에서 일반적으로 사용되는 규칙 표(rule table)가 아닌 CMR(conditionally matching rules)로 나타내고 진화 알고리즘을 적용하였다. 제안한 방법으로 다수의 서로 다른 규칙들을 찾아낼 수 있었고 찾아낸 규칙은 이전 연구에서 찾아낸 규칙과 유사한 성능을 보여주었다. CA의 문제를 해결하는데 CMR에 진화 알고리즘을 적용하는 것이 효용성이 있음을 보였다.

• International journal of advanced smart convergence
• /
• v.7 no.4
• /
• pp.27-39
• /
• 2018

Since the global positioning system (GPS) has been included in mobile devices (e.g., for car navigation, in smartphones, and in smart watches), the impact of personal GPS log data on daily life has been unprecedented. For example, such log data have been used to solve public problems, such as mass transit traffic patterns, finding optimum travelers' routes, and determining prospective business zones. However, a real-time analysis technique for GPS log data has been unattainable due to theoretical limitations. We introduced a machine learning model in order to resolve the limitation. In this paper presents a new, three-stage real-time prediction model for a person's daily route activity. In the first stage, a machine learning-based clustering algorithm is adopted for place detection. The training data set was a personal GPS tracking history. In the second stage, prediction of a new person's transient mode is studied. In the third stage, to represent the person's activity on those daily routes, inference rules are applied.

• Korean Institute of Interior Design Journal
• /
• no.11
• /
• pp.20-25
• /
• 1997

The purpose of this study is to find out the correlation between Truth(道) and dimension through the understanding of architectural point of value in the aspect of correlation between modern western thoughts and the thoughts of Truth and also through the reading of what kind of composite trend of the Truth can be seen in a Korea traditional house. This stduy takes the following procedure with reference books and traditional house that we have. 1) Making foundation for this study by finding out the fundamental meaning of the thoughts of Truth through the comparing and analyzing between modern western thoughts and the thoughts of Truth. 2) Reviewing the understanding of dimension in the thoughts of Truth. 3) Traslation of the organic correlation through the analysis of composition, placement and characteristics of dimension in a real present traditional Korea house. 4) Finding out the meaning of each dimension through the adaptation of the fundamental rules of nature of Jane(藏:store), Sang(生:life), Jang(長:long), Su(收obtain) to the dimension composite of a traditional house and concluding that the cyclical process in the oriental thoughts could be made.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.155-159
• /
• 2003

In order to compansate the problem of fragmentating data and disdaining small group of data in decision trees, a descriptive rule set discovery method is suggested. The principle of association rule finding algorithm is presented and a modified association nile finding algorithm for efficiency is applied to target database which has condition and decision attributes to see the effect of modification.

• The Journal of Korean Medical History
• /
• v.32 no.2
• /
• pp.61-69
• /
• 2019

Simyak (Finding Herbs) was a medical bureaucracy appointed directly by the central government of the Joseon Dynasty to the province. Simyaksalye (Casebook of Finding Herbs) was a 19th-century manuscript dealing only with Simyak. This study has outlined and analyzed the contents of this document. This article reveal facts which include : 1) The year of completion of this document was after December 24, 1873. However, the contents of the text were mixed with different writing periods in the 19th century. 2) The author of this document was assumed to be a member of Jeonuigam. Jeonuigam-based expressions appear in the content. 3) Simyak's main focus was not on contributing to local health care, but on the procurement of goods for central care. Much of Simyaksalye's content were on medicines and goods facts and their benefits. If Simyak's role was important in local medical cadet education, then there would have been rules related to it.

• Proceedings of the Korea Concrete Institute Conference
• /
• 1995.04a
• /
• pp.366-371
• /
• 1995

This paper is designed to bring to the attention of the reader the situation that may constitute a threat to the safety of RC structures designed and constructed in Korea. This threat stems from the inadequate rules of the acceptance strength control of concrete. As a result in some cases probability of brittle failure can be very high and reliability becomes very low. The paper substantiates the above statements. Further investigations aimed at finding the measures to remedy the situatuion are recommended.

• Management Science and Financial Engineering
• /
• v.21 no.2
• /
• pp.25-30
• /
• 2015

This short article compares different solution methods for a basic RBC model (Hansen, 1985). We solve and simulate the model using two main algorithms: the methods of perturbation and projection, respectively. One novelty is that we offer a type of the hybrid method: we compute easily a second-order approximation to decision rules and use that approximation as an initial guess for finding Chebyshev polynomials. We also find that the second-order perturbation method is most competitive in terms of accuracy for standard RBC model.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1996.10a
• /
• pp.115-118
• /
• 1996

연관규칙(Association Rule)은 데이터 베이스에 존재하는 속성들 사이의 관계를 기술하는 것으로, 간단하면서도 사용자에게 많은 정보를 줄 수 있다. 그러나, 지금까지는 이진 데이터베이스에 존재하는 연관규칙의 발견에 대해서 주로 연구되어 왔으며, 실수값 속성을 갖는 데이터에 관한 연구는 미비하였다. 본 논문에서는 퍼지집합을 이용하여 실수값 사이에 존재하는 연관규칙을 기술하고, 그것을 찾아내는 방법을 제시한다. 제시하는 방법은 사용자에 의해서 정의된 언어항을 이용하여, 실수값 속성을 가진 데이터를 이진 데이터로 재구성한다. 그리고 재구성된 이진 데이터에 기존의 연관규칙 발견 방법을 이용하여 연관규칙을 찾아내고, 찾아진 연관규칙을 정의된 언어항을 이용하여 다시 기술한다.

• Journal of Intelligence and Information Systems
• /
• v.14 no.1
• /
• pp.1-17
• /
• 2008

Data mining is defined as the process of discovering meaningful and useful pattern in large volumes of data. In particular, finding associations rules between items in a database of customer transactions has become an important thing. Some data structures and algorithms had been proposed for storing meaningful information compressed from an original database to find frequent itemsets since Apriori algorithm. Though existing method find all association rules, we must have a lot of process to analyze association rules because there are too many rules. In this paper, we propose a new data structure, called a Frequent Pattern Network (FPN), which represents items as vertices and 2-itemsets as edges of the network. In order to utilize FPN, We constitute FPN using item's frequency. And then we use a clustering method to group the vertices on the network into clusters so that the intracluster similarity is maximized and the intercluster similarity is minimized. We generate association rules based on clusters. Our experiments showed accuracy of clustering items on the network using confidence, correlation and edge weight similarity methods. And We generated association rules using clusters and compare traditional and our method. From the results, the confidence similarity had a strong influence than others on the frequent pattern network. And FPN had a flexibility to minimum support value.