• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.193-195
• /
• 2004

기존의 규칙 귀납법(Rule Induction)은 양성적 추론(positive reasoning)과 음성적 추론(negative reasoning)을 잘 반영하지 못하고 있지만 의학 분야의 추론은 양성적 추론과 음성적 추론을 모두 포함하고 있다. 이것이 의학 전문가들이 귀납된 규칙을 해석하는데 어려움을 가지게 되며, 진단 과정을 위해서 규칙을 해석하는 것을 쉽게 진행할 수 없는 이유이기도 하다. 본 연구에서는 양성적 규칙들과 음성적 규칙들의 귀납법을 위한 두 가지 알고리즘을 적용한 진단 시스템인 DS-ARI(Diagnosis System using Algorithms for Rule Induction)물 제안한다. 제안하는 시스템과 기존 시스템을 비교해 보았을 때 제안하는 시스템에서 전문가의 지식을 보다 정확하게 표현하여 정확성을 높이게 되었다.

• Journal of Internet Computing and Services
• /
• v.5 no.4
• /
• pp.115-124
• /
• 2004

This paper presents a weighted fuzzy backward reasoning algorithm for rule-based systems based on weighted fuzzy Petri nets. The fuzzy production rules in the knowledge base of a rule-based system are modeled by weighted fuzzy Petri nets, where the truth values of the propositions appearing in the fuzzy production rules and the certainty factors of the rules are represented by fuzzy numbers. Furthermore, the weights of the propositions appearing in the rules are also represented by fuzzy numbers. The proposed weighted fuzzy backward reasoning generates the backward reasoning path from the goal node to the initial nodes and then evaluates the certainty factor of the goal node. The algorithm we proposed can allow the rule-based systems to perform weighted fuzzy backward reasoning in more flexible and human-like manner.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.4
• /
• pp.293-298
• /
• 2000

In fuzzy expert systems or database systems that have volumes of fuzzy data or large fuzzy rules, the inference time is much increased. Therefore, a high performance parallel fuzzy computing environment is needed. In this paper, we propose a parallel fuzzy inference mechanism in parallel computing environments. In this, fuzzy rules are distributed and executed simultaneously. The ONE_TO_ALL algorithm is used to broadcast the fuzzy input input vector to the all nodes. The results of the MIN/MAX operations are transferred to the output processor by the ALL_TO_ONE algorithm. By parallel processing of fuzzy or data, the parallel fuzzy inference algortihm extracts effective and achieves and achieves a good speed factor.

• Journal of KIISE
• /
• v.42 no.12
• /
• pp.1561-1567
• /
• 2015

Abstract Semi-supervised learning is an area in machine learning that employs both labeled and unlabeled data in order to train a model and has the potential to improve prediction performance compared to supervised learning. Graph-based semi-supervised learning has recently come into focus with two phases: graph construction, which converts the input data into a graph, and label inference, which predicts the appropriate labels for unlabeled data using the constructed graph. The inference is based on the smoothness assumption feature of semi-supervised learning. In this study, we propose an enhanced label inference algorithm by incorporating the importance of each vertex. In addition, we prove the convergence of the suggested algorithm and verify its excellence.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.287-295
• /
• 2007

This paper proposes a novel data editing techniques with genetic algorithm (GA) in case-based reasoning (CBR) for the prediction of Korea Stock Price Index (KOSPI). CBR has been widely used in various areas because of its convenience and strength in compelax problem solving. Nonetheless, compared to other machine teaming techniques, CBR has been criticized because of its low prediction accuracy. Generally, in order to obtain successful results from CBR, effective retrieval of useful prior cases for the given problem is essential. However. designing a good matching and retrieval mechanism for CBR system is still a controversial research issue. In this paper, the GA optimizes simultaneously feature weights and a selection task for relevant instances for achieving good matching and retrieval in a CBR system. This study applies the proposed model to stock market analysis. Experimental results show that the GA approach is a promising method for data editing in CBR.

• Journal of Digital Convergence
• /
• v.14 no.1
• /
• pp.203-209
• /
• 2016

In this paper, we introduce a fuzzy inference systems for nonlinear inference using fuzzy cluster. Typically, the generation of fuzzy rules for nonlinear inference causes the problem that the number of fuzzy rules increases exponentially if the input vectors increase. To handle this problem, the fuzzy rules of fuzzy model are designed by dividing the input vector space in the scatter form using fuzzy clustering algorithm which expresses fuzzy cluster. From this method, complex nonlinear process can be modeled. The premise part of the fuzzy rules is determined by means of FCM clustering algorithm with fuzzy clusters. The consequence part of the fuzzy rules have four kinds of polynomial functions and the coefficient parameters of each rule are estimated by using the standard least-squares method. And we use the data widely used in nonlinear process for the performance and the nonlinear characteristics of the nonlinear process. Experimental results show that the non-linear inference is possible.

• Journal of KIISE:Databases
• /
• v.35 no.6
• /
• pp.505-517
• /
• 2008

This paper proposes a rewriting algorithm of OWL-DL ontology query in SPARQL. Currently, to obtain inference results of given SPARQL queries, Web ontology repositories construct inference ontology models and match the SPARQL queries with the models. However, an inference model requires much larger space than its original base model, and reusability of the model is not available for other inferrable SPARQL queries. Therefore, the aforementioned approach is not suitable for large scale SPARQL query processing. To resolve tills issue, this paper proposes a novel SPARQL query rewriting algorithm that can obtain results by rewriting SPARQL queries and accomplishing query operations against the base ontology model. To achieve this goal, we first define OWL-DL inference rules and apply them on rewriting graph pattern in queries. The paper categorizes the inference rules and discusses on how these rules affect the query rewriting. To show the advantages of our proposal, a prototype system based on lena is implemented. For comparative evaluation, we conduct an experiment with a set of test queries and compare of our proposal with the previous approach. The evaluation result showed the proposed algorithm supports an improved performance in efficiency of the inferrable SPARQL query processing without loss of completeness and soundness.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.7
• /
• pp.1457-1464
• /
• 2011

In this paper, we go one step further in that the number of competitive layers is not determined by experience but can be determined by fuzzy control rules based on input pattern information. In our method, we design a set of membership functions and corresponding rules and used Max-Min reasoning proposed by Mamdani. Also, we use centroid method as a defuzzification. In experiment that has various patterns of English inputs, this new method works beautifully to determine the number of competitive layers and also efficient in overall accuracy as a result.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2005.11a
• /
• pp.488-496
• /
• 2005

현재의 웹이 HTML을 바탕으로 인간 사용자와의 인터페이스에 초점을 맞추고 있는데 비하여, 차세대 웹은 XML 및 XML 기반 각종 표준들을 바탕으로 소프트웨어 에이전트와의 인터페이스에 초점을 맞추어 나가고 있다. 차세대 웹에서 소프트웨어 에이전트의 두뇌 역할을 수행하기 위하여 추론엔진은 차세대 웹의 표준 언어인 시맨틱 웹(Semantic Web)을 충실히 이해할 수 있어야 한다. 이를 위한 기초 작업의 일환으로 OWL(Web Ontology Language)과 RuleML(Rule Markup Language)이 W3C에 제안된 바 있다. 본 연구에서는 SWRL을 규칙 표현 방법으로 사용하고, OWL을 사실 표현 방법으로 사용하는 역방향 추론엔진인 SMART-B(SeMantic web Agent Reasoning Tools - Backward chaining inference engine)을 개발하고자 한다. 이를 위하여 SWRL 기반 역방향 추론을 위한 요구 기능을 분석하고, 기존 역방향 추론 알고리즘에 차세대 시맨틱 웹을 요구 기능을 반영한 역방향 추론 알고리즘을 설계하였다. 또한, 유비쿼터스 환경에서의 각종 플랫폼의 독립성과 이식성을 확보하고 기기 간의 성능 차이를 극복할 수 있도록 사실 베이스 및 규칙 베이스의 관리도구와 역방향 추론 엔진 등을 Java 프로그래밍 언어를 이용하여 단위 컴포넌트의 형태로 개발 중에 있다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.6
• /
• pp.316-325
• /
• 2006

In diploid organisms like human, each chromosome consists of two copies. A haplotype is a SNP(single nucleotide polymorphism) sequence information from each copy. Finding the complete map of haplotypes in human population is one of the important issues in human genome. To obtain haplotypes via experimental methods is both time-consuming and expensive. Therefore, inference methods have been used to infer haplotyes from the genotype samples. In this paper, we propose a new approach using genetic algorithm to infer haplotypes, which is based on the model of finding the minimum number of haplotypes that explain the genotype samples. We show that by doing a computational experiment, our algorithm has the correctness similar to HAPAR[1] which is known to produce good results while the execution time of our algorithm is less than that of HAPAR as the input size is increased. The experimental result is also compared with the result by the recent method PTG[2].