• Title/Summary/Keyword: Inference

Search Result 3,366, Processing Time 0.031 seconds

Multiple Instance Mamdani Fuzzy Inference

  • Khalifa, Amine B.;Frigui, Hichem
    • 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.

Development of Expert Systems using Automatic Knowledge Acquisition and Composite Knowledge Expression Mechanism

  • Kim, Jin-Sung
    • 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.

  • PDF

An Integer Matrix-Driven Inference Mechanism for Negotiation Decision Support in B2B Electronic Commerce (기업간 전자상거래에 있어서 협상의사결정지원을 위한 정수행렬 연산 추론 메커니즘에 관한 연구)

  • Lee, Kun-Chang;Cho, Hyung-Rae;Kwon, Soon-Jae
    • 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.

  • PDF

An Expert System for the Real-Time Computer Control of the Large-Scale System (대규모 시스템의 실시간 컴퓨터 제어를 위한 전문가 시스템)

  • Ko, Yun-Seok
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.6
    • /
    • pp.781-788
    • /
    • 1999
  • In this paper, an expert system is proposed, which can be effectively applied to the large-scale systems with the diversity time constraints, the objectives and the unfixed system structure. The inference scheme of the expert system have the integrated structure composed of the intuitive inference module and logical inference module in order to support effectively the operating constraints of system. The intuitive inference module is designed using the pattern matching or pattern recognition method in order to search a same or similar pattern under the fixed system structure. On the other hand, the logical inference module is designed as the structure with the multiple inference mode based on the heuristic search method in order to determine the optimal or near optimal control strategies satisfing the time constraints for system events under the unfixed system structure, and in order to use as knowledge generator. Here, inference mode consists of the best-first, the local-minimum tree, the breadth-iterative, the limited search width/time method. Finally, the application results for large-scale distribution SCADA system proves that the inference scheme of the expert system is very effective for the large-scale system. The expert system is implemented in C language for the dynamic mamory allocation method, database interface, compatability.

  • PDF

A Vindication of Induction by Practical Inference (실천추론에 의한 귀납의 정당화)

  • Lee, Byeong-Deok
    • 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.

  • PDF

An Extended AND-OR Graph-based Simulation and Electronic Commerce

  • Lee, Kun-Chang;Cho, Hyung-Rae
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1999.04a
    • /
    • pp.242-250
    • /
    • 1999
  • The objective of this paper is to propose an Extended AND-OR Graph (EAOG)-driven inferential simulation mechanism with which decision makers engaged in electronic commerce (EC) can effectively deal with complicated decision making problem. In the field of traditional expect systems research, AND-OR Graph approach cannot be effectively used in the EC problems in which real-time problem-solving property should be highly required. In this sense, we propose the EAOG inference mechanism for EC problem-solving in which heurisric knowledge necessary for intelligent EC problem-solving can be represented in a form of matrix. The EAOG method possesses the following three characteristics. 1. Realtime 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 based on either and computational efficiency. However, the proposed EAOG inference mechanism is generically bi-directional without loss of both speed and efficiency.We have proved the validity of our approach with several propositions and an illustrative EC example.

  • PDF

Scalable RDFS Reasoning Using the Graph Structure of In-Memory based Parallel Computing (인메모리 기반 병렬 컴퓨팅 그래프 구조를 이용한 대용량 RDFS 추론)

  • Jeon, MyungJoong;So, ChiSeoung;Jagvaral, Batselem;Kim, KangPil;Kim, Jin;Hong, JinYoung;Park, YoungTack
    • Journal of KIISE
    • /
    • v.42 no.8
    • /
    • pp.998-1009
    • /
    • 2015
  • In recent years, there has been a growing interest in RDFS Inference to build a rich knowledge base. However, it is difficult to improve the inference performance with large data by using a single machine. Therefore, researchers are investigating the development of a RDFS inference engine for a distributed computing environment. However, the existing inference engines cannot process data in real-time, are difficult to implement, and are vulnerable to repetitive tasks. In order to overcome these problems, we propose a method to construct an in-memory distributed inference engine that uses a parallel graph structure. In general, the ontology based on a triple structure possesses a graph structure. Thus, it is intuitive to design a graph structure-based inference engine. Moreover, the RDFS inference rule can be implemented by utilizing the operator of the graph structure, and we can thus design the inference engine according to the graph structure, and not the structure of the data table. In this study, we evaluate the proposed inference engine by using the LUBM1000 and LUBM3000 data to test the speed of the inference. The results of our experiment indicate that the proposed in-memory distributed inference engine achieved a performance of about 10 times faster than an in-storage inference engine.

Remote Diagnosis of Hypertension through HTML-based Backward Inference

  • Song, Yong-Uk;Chae, Young-Moon;Cho, Kyoung-Won;Ho, Seung-Hee
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2001.01a
    • /
    • pp.496-507
    • /
    • 2001
  • An expert system for the diagnosis and indication of hypertension is implemented through HTML-based backward inference. HTML-based backward inference is performed using the hypertext function of HTML, and many HTML files, which are hyperlinked to each other based on the backward rules, should be prepared beforehand. The development and maintenance of the HTML files are conducted automatically using the decision graph. Still, the drawing and input of the decision graph is a time consuming and tedious job if it is done manually. So, automatic generator of the decision graph for the diagnosis and indication of hypertension was implemented. The HTML-based backward inference ensures accessibility, multimedia facilities, fast response, stability, easiness, and platform independency of the expert system. So, this research reveals that HTML-based inference approach can be used for many Web-based intelligent site with fast and stable performance.

  • PDF

Reject Inference of Incomplete Data Using a Normal Mixture Model

  • Song, Ju-Won
    • The Korean Journal of Applied Statistics
    • /
    • v.24 no.2
    • /
    • pp.425-433
    • /
    • 2011
  • Reject inference in credit scoring is a statistical approach to adjust for nonrandom sample bias due to rejected applicants. Function estimation approaches are based on the assumption that rejected applicants are not necessary to be included in the estimation, when the missing data mechanism is missing at random. On the other hand, the density estimation approach by using mixture models indicates that reject inference should include rejected applicants in the model. When mixture models are chosen for reject inference, it is often assumed that data follow a normal distribution. If data include missing values, an application of the normal mixture model to fully observed cases may cause another sample bias due to missing values. We extend reject inference by a multivariate normal mixture model to handle incomplete characteristic variables. A simulation study shows that inclusion of incomplete characteristic variables outperforms the function estimation approaches.

On the Bayesian Statistical Inference (베이지안 통계 추론)

  • Lee, Ho-Suk
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06c
    • /
    • pp.263-266
    • /
    • 2007
  • This paper discusses the Bayesian statistical inference. This paper discusses the Bayesian inference, MCMC (Markov Chain Monte Carlo) integration, MCMC method, Metropolis-Hastings algorithm, Gibbs sampling, Maximum likelihood estimation, Expectation Maximization algorithm, missing data processing, and BMA (Bayesian Model Averaging). The Bayesian statistical inference is used to process a large amount of data in the areas of biology, medicine, bioengineering, science and engineering, and general data analysis and processing, and provides the important method to draw the optimal inference result. Lastly, this paper discusses the method of principal component analysis. The PCA method is also used for data analysis and inference.

  • PDF