Showing papers on "Fuzzy associative matrix published in 1986"
TL;DR: It is shown that Sugeno's fuzzy integral is a particular case of them and they are studied to study their principal properties.
160 citations
TL;DR: A fuzzy rule based expert production system that accepts as input a fuzzy vector all of whose components are fuzzy sets, and produces as output a fuzzy set of conclusions.
115 citations
TL;DR: It is shown that all fuzzy aggregation rules which have non-narrow domains and which satisfy the fuzzy counterparts of independence of irrelevant alternatives and Pareto criterion are characterized by a distribution of 'veto' power which would be generally considered undesirable.
97 citations
TL;DR: Some aspects of manipulation of fuzzy data with the aid of fuzzy relational equations are considered and two stages of manipulation process are indicated: combining pieces of evidence and inferring their mutual correspondence.
78 citations
01 Mar 1986
TL;DR: An algorithm of ordering retrieved documents according to the values of the fuzzy thesaurus is proposed and it is shown that one can obtain documents of maximum relevance in a fixed time interval.
Abstract: A fuzzy bibliographic information retrieval based on a fuzzy thesaurus or on a fuzzy pseudothesaurus is described. A fuzzy thesaurus consists of two fuzzy relations defined on a set of keywords for the bibliography. The fuzzy relations are generated based on a fuzzy set model, which describes association of a keyword to its concepts. If the set of concepts in the fuzzy set model is replaced by the set of documents, the fuzzy relations are called a pseudothesaurus, which is automatically generated by using occurrence frequencies of the keywords in the set of documents. The fuzzy retrieval uses two fuzzy relations in addition, that is, a fuzzy indexing and a fuzzy inverted file: the latter is the inverse relation of the former. They are, however, related to different algorithms for indexing and retrieval, respectively. An algorithm of ordering retrieved documents according to the values of the fuzzy thesaurus is proposed. This method of the ordering is optimal in the sense that one can obtain documents of maximum relevance in a fixed time interval. An example of the fuzzy retrieval is shown on a prototype database. This method shows one of the simplest way to realize fuzzy retrieval in practical database systems.
46 citations
TL;DR: An extension of the conventional dynamic programming model introduced by Bellman to the fuzzy case is considered and two fuzzy dynamic programming models are developed and converted into algo r performance of these algorithms is compared to two others based on heuristics.
43 citations
TL;DR: A fuzzy multiplication is constructed which is jointly fuzzy continuous and which is the unique, piecewise consistent extension of ordinary multiplication to R (L) distributing over the fuzzy addition constructed by the author in [47]; the fuzzy integers are specified and an extensive analysis of fuzzy contractions and expansions are given.
29 citations
17 citations
Proceedings Article•
08 Dec 1986
17 citations
TL;DR: The resolution of composite fuzzy relational inequations for these adjoint fuzzy systems can be skillfully treated by the Gentzen-type sequent calculus as well as by the lattice-theoretical way, owing to the adjointness of - and -compositions.
05 Feb 1986
TL;DR: A set of sound and complete inference rules for fuzzy functional dependencies and associated inference rules are proposed to solve the problem of lossless join decomposition of fuzzy relations for a given set of fuzzyfunctional dependencies.
Abstract: The paper deals with fuzzy functional dependencies and associated inference rules. A set of sound and complete inference rules are proposed. The problem of lossless join decomposition of fuzzy relations for a given set of fuzzy functional dependencies are examined.
TL;DR: Some properties of PL (Probability Logic) and FL (Fuzzy Logic) are dealt with and some basic tools are created for Bayesian-like decision making in a fuzzy environment.
01 Jan 1986
TL;DR: Some concepts of efficiency can be covered by an unified approach with a substitute parametric optimization problem with a classical Pareto concept (e.g. set of extremals, weakly efficient set).
Abstract: Some concepts of efficiency can be covered by an unified approach with a substitute parametric optimization problem. This was already shown by Gearhart (1983) for properly efficient solutions in the sense of Henig (1982). In the paper presented here other definitions of solutions are included based on the classical Pareto concept (e.g. set of extremals, weakly efficient set).
30 Jun 1986
TL;DR: The generalized modus ponens is a fuzzy logic pattern of reasoning that permits to make inferences with rules having imprecision both in their antecedent and consequent parts but may result in unacceptably slow executions if inappropriately implemented.
Abstract: The generalized modus ponens is a fuzzy logic pattern of reasoning that permits to make inferences with rules having imprecision both in their antecedent and consequent parts. Though it is a very powerful approximate reasoning tool (from a theoretical point of view), this technique may result in unacceptably slow executions if inappropriately implemented. There are several ways to avoid the inefficiency bottleneck. One of them, that is the object of this paper, consists in introducing an approximation technique focussing only of what is semantically important. This approximation technique is conceived so as to be used in situations where the dependency between two given variables is described via a collection of rules. Moreover, this paper addresses the problem in the setting having the main features that follow:
-
the possibility distributions involved in facts and rules are continuous (the referential is the real line), normalized, unimodal and expressed by parametrized functions;
-
only single antecedent rules are considered;
-
the rules are consistent and it is assumed that their antecedents and consequents do not overlap too much;
-
the deduction process is based on the ‘min’ conjunction and Godel implication operators.
TL;DR: In the latter case a ‘wider’ fuzzy environment in which ‘old’ and ‘new’ elements could be considered together is constructed, and a new evaluation of possibility which allows to evaluate the elements of such new environment is defined.
26 Mar 1986
TL;DR: Most of the systems encountered by decision makers are dependent on fuzzy variables and are called Variable Fuzzy Systems (VFS), which are studied in this paper.
Abstract: Most of the systems encountered by decision makers are dependent on fuzzy variables. In this paper a few of these systems are studied. These systems are called Variable Fuzzy Systems (VFS). The necessary details about operations on fuzzy sub-sets are reviewed. The deductive processes involved in reaching decisions about fuzzy systems are examined. The implementation of these processes in Prolog is discussed. Prolog programs (assistant) used for decision support in some of these variable fuzzy systems is listed.
TL;DR: An introduction to the use of fuzzy set theory for analysing thermodynamic modelling error and a method for evaluating the magnitude of model errors and for performing a fuzzy propagation of errors to estimate the uncertainty in predicted results is presented.