• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.10a
• /
• pp.121-130
• /
• 1999

The objective of this paper is to apply Extended AND-OR Graph (EAOG)-related techniques to extract knowledge from a specific problem-domain and perform analysis in complicated decision making area. Expert systems use expertise about a specific domain as their primary source of solving problems belonging to that domain. However, such expertise is complicated as well as uncertain, because most knowledge is expressed in causal relationships between concepts or variables. Therefore, if expert systems can be used effectively to provide more intelligent support for decision making in complicated specific problems, it should be equipped with real-time inference mechanism. We develop two kinds of EAOG-driven inference mechanisms(1) EAOG-based forward chaining and (2) EAOG-based backward chaining. and The EAOG method processes the following three characteristics. 1. Real-time inference : The EAOG inference mechanism is suitable for the real-time inference because its computational mechanism is based on matrix computation. 2. Matrix operation : All the subjective knowledge is delineated in a matrix form, so that inference process can proceed based on the matrix operation which is computationally efficient. 3. Bi-directional inference : Traditional inference method of expert systems is based on either forward chaining or backward chaining which is mutually exclusive in terms of logical process and computational efficiency. However, the proposed EAOG inference mechanism is generically bi-directional without loss of both speed and efficiency.

• Journal of Intelligence and Information Systems
• /
• v.9 no.2
• /
• pp.19-38
• /
• 2003

In this research, we propose the mechanism to develop self-evolving expert systems (SEES) based on data mining (DM), fuzzy neural networks (FNN), and relational database (RDB)-driven forward/backward inference engine. Most researchers had tried to develop a text-oriented knowledge base (KB) and inference engine (IE). However, this approach had some limitations such as 1) automatic rule extraction, 2) manipulation of ambiguousness in knowledge, 3) expandability of knowledge base, and 4) speed of inference. To overcome these limitations, knowledge engineers had tried to develop an automatic knowledge extraction mechanism. As a result, the adaptability of the expert systems was improved. Nonetheless, they didn't suggest a hybrid and generalized solution to develop self-evolving expert systems. To this purpose, we propose an automatic knowledge acquisition and composite inference mechanism based on DM, FNN, and RDB-driven inference engine. Our proposed mechanism has five advantages. First, it can extract and reduce the specific domain knowledge from incomplete database by using data mining technology. Second, our proposed mechanism can manipulate the ambiguousness in knowledge by using fuzzy membership functions. Third, it can construct the relational knowledge base and expand the knowledge base unlimitedly with RDBMS (relational database management systems) module. Fourth, our proposed hybrid data mining mechanism can reflect both association rule-based logical inference and complicate fuzzy relationships. Fifth, RDB-driven forward and backward inference time is shorter than the traditional text-oriented inference time.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1992.04a
• /
• pp.354-358
• /
• 1992

This paper describes a development of high speed fuzzy inference circuit for the industrialprocesses. The hardware fuzzy inference circuit is developed utilizing a hardware fuzzy inference circuit is developed utilizing a DSP and a multiplier and accumulator chip. To enhance the inference speed, the pipeline disign is adopted at the bottleneck and the general Max-Min inference method is slightly modified as Max-max method. As a results, the inference speed is evaluated to be 100 KFLIPS. Owing to this high speed feature, satisfactory application can be attained for complex high speed motion control as well as the control of multi-input multi-output nonlinear system. As an application, the developed fuzzy inference circuit is embedded to a PLC (Porgrammable Logic Controller) for industrial process control. For the fuzzy PLC system, to fascilitate the design of the fuzzy control knowledge such as membership functions, rules, etc., a MS-Windows based GUI (Graphical User Interface) software is developed.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.175-178
• /
• 2008

Z. Cao had proposed NFRM(new fuzzy reasoning method) which infers in detail using relation matrix. In spite of the small inference rules, it shows good performance than mamdani's fuzzy inference method. But the most of fuzzy systems are difficult to make fuzzy inference rules in the case of MIMO system. The past days, We had proposed the MIMO fuzzy inference which had extended a Z. Cao's fuzzy inference to handle MIMO system. But many times and effort needed to determine the relation matrix elements of MIMO fuzzy inference by heuristic and trial and error method in order to improve inference performances. In this paper, we propose a MIMO fuzzy inference method with the learning ability witch is used a gradient descent method in order to improve the performances. Through the computer simulation studies for the inverse kinematics problem of 2-axis robot, we show that proposed inference method using a gradient descent method has good performances.

• Korean Journal of Adult Nursing
• /
• v.14 no.2
• /
• pp.174-183
• /
• 2002

Purpose: The purpose of this study was to determine the effect of nurses' pain experience on the inference of their patients' suffering. Method: Study subjects were sampled from 184 nurses who worked in general wards in one S university hospital located at Seoul. Nurses' pain experience consists of personal pain experience and professional pain experience. The Standard Measure of Inference of Suffering (Davitz & Davitz, 1981) was used for suffering inference measure, and patients' suffering which consists of physical pain and psychological distress. Result: Suffering inference scores of nurses without personal pain experience revealed a higher value than that of nurses with personal pain experience. But these differences were not statistically significant. The higher intense pain was experienced, the higher were suffering inference scores. This physical pain inference score was statistically significant(p=.044). Of the nurses who had personal pain experience, suffering inference scores of nurses with unrelieved pain experience revealed a higher value than that of nurses with relieved pain experience. Physical pain and psychological distress inference scores were statistically significant(p=.010, p=.006). Suffering inference scores of nurses without professional pain experience(internal medicine, general surgery, orthopedic surgery) revealed a higher value than that of nurses with professional pain experience. Professional pain experience of internal medical illness was statistically significant in psychological distress of internal medical illness(p=.044), and professional pain experience of orthopedic surgical illness was statistically significant in physical pain of orthopedic surgical illness(p=.027). Conclusion: Nurses who have experienced low pain intensity or good pain relief are inclined n to underestimate patient' pain. Although nurses who care for the same patient over a long time deal skillfully with that patient, nurses are inclined to underestimate that patients' pain. Nurses need to be aware of possible biases related to pain assessment as a result of pain experience.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.1 no.1
• /
• pp.119-124
• /
• 2001

In this pattern recognition on the large volumes of remote sensing satellite images, the inference time is much increased. In the case of the remote sensing data [5] having 4 wavebands, the 778 training patterns are learned. Each land cover pattern is classified by using 159, 900 patterns including the trained patterns. For the fuzzy classification, the 778 fuzzy rules are generated. Each fuzzy rule has 4 fuzzy variables in the condition part. Therefore, high performance parallel fuzzy inference system is needed. In this paper, we propose a novel parallel fuzzy inference system on T3E parallel computer. In this, fuzzy rules are distributed and executed simultaneously. The ONE_To_ALL algorithm is used to broadcast the fuzzy input 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 the fuzzy rules, the parallel fuzzy inference algorithm extracts match parallelism and achieves a good speed factor. This system can be used in a large expert system that ha many inference variables in the condition and the consequent part.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.15 no.4
• /
• pp.217-231
• /
• 2015

A novel fuzzy learning framework that employs fuzzy inference to solve the problem of Multiple Instance Learning (MIL) is presented. The framework introduces a new class of fuzzy inference systems called Multiple Instance Mamdani Fuzzy Inference Systems (MI-Mamdani). In multiple instance problems, the training data is ambiguously labeled. Instances are grouped into bags, labels of bags are known but not those of individual instances. MIL deals with learning a classifier at the bag level. Over the years, many solutions to this problem have been proposed. However, no MIL formulation employing fuzzy inference exists in the literature. Fuzzy logic is powerful at modeling knowledge uncertainty and measurements imprecision. It is one of the best frameworks to model vagueness. However, in addition to uncertainty and imprecision, there is a third vagueness concept that fuzzy logic does not address quiet well, yet. This vagueness concept is due to the ambiguity that arises when the data have multiple forms of expression, this is the case for multiple instance problems. In this paper, we introduce multiple instance fuzzy logic that enables fuzzy reasoning with bags of instances. Accordingly, a MI-Mamdani that extends the standard Mamdani inference system to compute with multiple instances is introduced. The proposed framework is tested and validated using a synthetic dataset suitable for MIL problems. Additionally, we apply the proposed multiple instance inference to fuse the output of multiple discrimination algorithms for the purpose of landmine detection using Ground Penetrating Radar.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.447-450
• /
• 2003

In this research, we propose an automatic knowledge acquisition and composite knowledge expression mechanism based on machine learning and relational database. Most of traditional approaches to develop a knowledge base and inference engine of expert systems were based on IF-THEN rules, AND-OR graph, Semantic networks, and Frame separately. However, there are some limitations such as automatic knowledge acquisition, complicate knowledge expression, expansibility of knowledge base, speed of inference, and hierarchies among rules. To overcome these limitations, many of researchers tried to develop an automatic knowledge acquisition, composite knowledge expression, and fast inference method. As a result, the adaptability of the expert systems was improved rapidly. Nonetheless, they didn't suggest a hybrid and generalized solution to support the entire process of development of expert systems. Our proposed mechanism has five advantages empirically. First, it could extract the specific domain knowledge from incomplete database based on machine learning algorithm. Second, this mechanism could reduce the number of rules efficiently according to the rule extraction mechanism used in machine learning. Third, our proposed mechanism could expand the knowledge base unlimitedly by using relational database. Fourth, the backward inference engine developed in this study, could manipulate the knowledge base stored in relational database rapidly. Therefore, the speed of inference is faster than traditional text -oriented inference mechanism. Fifth, our composite knowledge expression mechanism could reflect the traditional knowledge expression method such as IF-THEN rules, AND-OR graph, and Relationship matrix simultaneously. To validate the inference ability of our system, a real data set was adopted from a clinical diagnosis classifying the dermatology disease.

• Asia pacific journal of information systems
• /
• v.11 no.1
• /
• pp.1-24
• /
• 2001

This paper is aimed at proposing a new inference mechanism for B-to-B electronic commerce decision-makings, named IMITAO(Integer Matrix-driven Inference based on Transformed And-Or graph) which is based on integer matrix operation to speed up the inference. During the B-to-B electronic commerce, many kinds of negotiations are needed for mutually satisfactory decision-makings. During such negotiations, several factors including subjective and objective constraints should be considered so as to reach satisfactory decisions. In this respect, we suggest first a Transformed AND-OR Graph(TAOG) which each firm's conditions or judgement are incorporated into, and then we propose a high-speedy inference mechanism named IMITAO which basically depends on TAOG. Firms engaged in B-to-B negotiations on the Internet can get an appropriate decision support from using IMITAO for their negotiation simulations. The proposed IMITAO inference mechanism is characterized by its fast inference because its main inference procedures are based on integer matrix operation. A real-world example for B-to-B negotiations was used to prove the validity of our proposed TAOG and IMITAO approach. Experimental results showed that our approach was very useful in performing the B-to-B electronic commerce decision-makings considering a wide variety of either subjective or objective constraints.

• Korean Journal of Logic
• /
• v.12 no.2
• /
• pp.59-88
• /
• 2009

According to David Hume, a deductive demonstration for inductive inference is not possible, because inductive inference is not deductive; and an inductive demonstration for inductive inference is not possible either, because such a demonstration is circular. Thus, on his view, there is no way of justifying inductive inference. Ever since Hume raised this problem of induction, a fair number of philosophers have tried to solve it. Nevertheless there is still no solution which is plausible enough to receive wide endorsement. According to Wilfrid Sellars, we cannot justify inductive inference by any theoretical reasoning; we can vindicate it only by a certain sort of practical reasoning. In this paper, I defend this Sellarsian proposal by developing and explaining it.