1,169 research outputs found

    The Combination of Paradoxical, Uncertain, and Imprecise Sources of Information based on DSmT and Neutro-Fuzzy Inference

    Full text link
    The management and combination of uncertain, imprecise, fuzzy and even paradoxical or high conflicting sources of information has always been, and still remains today, of primal importance for the development of reliable modern information systems involving artificial reasoning. In this chapter, we present a survey of our recent theory of plausible and paradoxical reasoning, known as Dezert-Smarandache Theory (DSmT) in the literature, developed for dealing with imprecise, uncertain and paradoxical sources of information. We focus our presentation here rather on the foundations of DSmT, and on the two important new rules of combination, than on browsing specific applications of DSmT available in literature. Several simple examples are given throughout the presentation to show the efficiency and the generality of this new approach. The last part of this chapter concerns the presentation of the neutrosophic logic, the neutro-fuzzy inference and its connection with DSmT. Fuzzy logic and neutrosophic logic are useful tools in decision making after fusioning the information using the DSm hybrid rule of combination of masses.Comment: 20 page

    An introduction to DSmT

    Get PDF
    The management and combination of uncertain, imprecise, fuzzy and even paradoxical or high conflicting sources of information has always been, and still remains today, of primal importance for the development of reliable modern information systems involving artificial reasoning. In this introduction, we present a survey of our recent theory of plausible and paradoxical reasoning, known as Dezert-Smarandache Theory (DSmT), developed for dealing with imprecise, uncertain and conflicting sources of information. We focus our presentation on the foundations of DSmT and on its most important rules of combination, rather than on browsing specific applications of DSmT available in literature. Several simple examples are given throughout this presentation to show the efficiency and the generality of this new approach

    Interval-valued and intuitionistic fuzzy mathematical morphologies as special cases of L-fuzzy mathematical morphology

    Get PDF
    Mathematical morphology (MM) offers a wide range of tools for image processing and computer vision. MM was originally conceived for the processing of binary images and later extended to gray-scale morphology. Extensions of classical binary morphology to gray-scale morphology include approaches based on fuzzy set theory that give rise to fuzzy mathematical morphology (FMM). From a mathematical point of view, FMM relies on the fact that the class of all fuzzy sets over a certain universe forms a complete lattice. Recall that complete lattices provide for the most general framework in which MM can be conducted. The concept of L-fuzzy set generalizes not only the concept of fuzzy set but also the concepts of interval-valued fuzzy set and Atanassov’s intuitionistic fuzzy set. In addition, the class of L-fuzzy sets forms a complete lattice whenever the underlying set L constitutes a complete lattice. Based on these observations, we develop a general approach towards L-fuzzy mathematical morphology in this paper. Our focus is in particular on the construction of connectives for interval-valued and intuitionistic fuzzy mathematical morphologies that arise as special, isomorphic cases of L-fuzzy MM. As an application of these ideas, we generate a combination of some well-known medical image reconstruction techniques in terms of interval-valued fuzzy image processing

    Constrained interval type-2 fuzzy sets

    Get PDF
    In many contexts, type-2 fuzzy sets are obtained from a type-1 fuzzy set to which we wish to add uncertainty. However, in the current type-2 representation there is no restriction on the shape of the footprint of uncertainty and the embedded sets that can be considered acceptable. This leads, usually, to the loss of the semantic relationship between the type-2 fuzzy set and the concept it models. As a consequence, the interpretability of some of the embedded sets and the explainability of the uncertainty measures obtained from them can decrease. To overcome these issues, constrained type-2 fuzzy sets have been proposed. However, no formal definitions for some of their key components (e.g. acceptable embedded sets) and constrained operations have been given. The goal of this paper is to provide some theoretical underpinning for the definition of constrained type-2 sets, their inferencing and defuzzification method. To conclude, the constrained inference framework is presented, applied to two real world cases and briefly compared to the standard interval type-2 inference and defuzzification method

    A general unified framework for pairwise comparison matrices in multicriterial methods

    Get PDF
    In a Multicriteria Decision Making context, a pairwise comparison matrix A=(aij)A=(a_{ij}) is a helpful tool to determine the weighted ranking on a set XX of alternatives or criteria. The entry aija_{ij} of the matrix can assume different meanings: aija_{ij} can be a preference ratio (multiplicative case) or a preference difference (additive case) or aija_{ij} belongs to [0,1][0,1] and measures the distance from the indifference that is expressed by 0.5 (fuzzy case). For the multiplicative case, a consistency index for the matrix AA has been provided by T.L. Saaty in terms of maximum eigenvalue. We consider pairwise comparison matrices over an abelian linearly ordered group and, in this way, we provide a general framework including the mentioned cases. By introducing a more general notion of metric, we provide a consistency index that has a natural meaning and it is easy to compute in the additive and multiplicative cases; in the other cases, it can be computed easily starting from a suitable additive or multiplicative matrix

    REVIEW OF MODELING PREFERENCES FOR DECISION MODELS

    Get PDF
    A group decision problem is set in environments where there is a common issue to solve, a set of possible options to choose, and a set of individuals who are experts and express their opinions about the set of possible alternatives with the intention to reach a collective decision as the unique solution of the problem in question. The modeling of the preferences of the decision-maker is an essential stage in the construction of models used in the theory of decision, operations research, economics, etc. On decision problems experts use models of representation of preferences that are close to their disciplines or fields of work. The structures of information most commonly used for the representation of the preferences of experts are vectors of utility, orders of preference and preference relations. In decision problems, the expression of preferences domain is the domain of information used by the experts to express their preferences, the main are numerical, linguistic, and intervalar stressing the multi-granular linguistic. This paper is a review of these concepts. Its purpose is to provide a guide of bibliographic references for these concepts, which are briefly discussed in this document

    Conceptual Based Hidden Data Analytics and Reduction Method for System Interface Enhancement Through Handheld devices

    Get PDF
    With the increasing demand placed on online systems by users, many organizations and companies are seeking to enhance their online interfaces to facilitate the search process on their hidden databases. Usually, users issue queries to a hidden database by using the search template provided by the system. In this thesis, a new approach based mainly on hidden database reduction preserving functional dependencies is developed for enhancing the online system interface through a small screen device. The developed approach is applied to online market systems like eBay. Offline hidden data analysis is used to discover attributes and their domains and different functional dependencies. In this thesis, a comparative study between several methods for mining functional dependencies shows the advantage of conceptual methods for data reduction. In addition, by using online consecutive reductions on search results, we adopted a method of displaying results in order of decreasing relevance. The validation of the proposed designed and developed methods prove their generality and suitability for system interfacing through continuous data reductions.NPRP-07-794-1-145 grant from the Qatar National Research Fund (a member of Qatar foundation
    corecore