Fuzzification of crisp domains

summary:The present paper is devoted to the transition from crisp domains of probability to fuzzy domains of probability. First, we start with a simple transportation problem and present its solution. The solution has a probabilistic interpretation and it illustrates the transition from classical random variables to fuzzy random variables in the sense of Gudder and Bugajski. Second, we analyse the process of fuzzification of classical crisp domains of probability within the category $ID$ of $D$-posets of fuzzy sets and put into perspective our earlier results concerning categorical aspects of fuzzification. For example, we show that (within $ID$) all nontrivial probability measures have genuine fuzzy quality and we extend the corresponding fuzzification functor to an epireflector. Third, we extend the results to simplex-valued probability domains. In particular, we describe the transition from crisp simplex-valued domains to fuzzy simplex-valued domains via a “simplex” modification of the fuzzification functor. Both, the fuzzy probability and the simplex-valued fuzzy probability is in a sense minimal extension of the corresponding crisp probability theory which covers some quantum phenomenon

Eigenlogic: a Quantum View for Multiple-Valued and Fuzzy Systems

We propose a matrix model for two- and many-valued logic using families of observables in Hilbert space, the eigenvalues give the truth values of logical propositions where the atomic input proposition cases are represented by the respective eigenvectors. For binary logic using the truth values {0,1} logical observables are pairwise commuting projectors. For the truth values {+1,-1} the operator system is formally equivalent to that of a composite spin 1/2 system, the logical observables being isometries belonging to the Pauli group. Also in this approach fuzzy logic arises naturally when considering non-eigenvectors. The fuzzy membership function is obtained by the quantum mean value of the logical projector observable and turns out to be a probability measure in agreement with recent quantum cognition models. The analogy of many-valued logic with quantum angular momentum is then established. Logical observables for three-value logic are formulated as functions of the Lz observable of the orbital angular momentum l=1. The representative 3-valued 2-argument logical observables for the Min and Max connectives are explicitly obtained.Comment: 11 pages, 2 table

Statistical Genetic Interval-Valued Type-2 Fuzzy System and its Application

In recent years, the type-2 fuzzy sets theory has been used to model and minimize the effects of uncertainties in rule-base fuzzy logic system. In order to make the type-2 fuzzy logic system reasonable and reliable, a new simple and novel statistical method to decide interval-valued fuzzy membership functions and a new probability type reduced reasoning method for the interval-valued fuzzy logic system are proposed in this thesis. In order to optimize this particle system’s performance, we adopt genetic algorithm (GA) to adjust parameters. The applications for the new system are performed and results have shown that the developed method is more accurate and robust to design a reliable fuzzy logic system than type-1 method and the computation of our proposed method is more efficient

Fuzzy Bayesian inference

Bayesian methods provide formalism for reasoning about partial beliefs under conditions of uncertainty. Given a set of exhaustive and mutually exclusive hypotheses, one can compute the probability of a hypothesis for a given evidence using the Bayesian inversion formula. In Bayesian's inference, the evidence could be a single atomic proposition or multi-valued one. For the multi-valued evidence, these values could be discrete, continuous, or fuzzy. For the continuous-valued evidence, the density functions used in the Bayesian inference are difficult to be determined in many practical situations. Complicated laboratory testing and advance statistical techniques are required to estimate the parameters of the assumed type of distribution. Using the proposed fuzzy Bayesian approach, a formulation is derived to estimate the density function from the conditional probabilities of the fuzzy-supported values. It avoids the complicated testing and analysis, and it does not require the assumption of a particular type of distribution. The estimated density function in our approach is proved to conform to two axioms in the theorem of probability. Example is provided in the paper.published_or_final_versio

A penalty-based aggregation operator for non-convex intervals

In the case of real-valued inputs, averaging aggregation functions have been studied extensively with results arising in fields including probability and statistics, fuzzy decision-making, and various sciences. Although much of the behavior of aggregation functions when combining standard fuzzy membership values is well established, extensions to interval-valued fuzzy sets, hesitant fuzzy sets, and other new domains pose a number of difficulties. The aggregation of non-convex or discontinuous intervals is usually approached in line with the extension principle, i.e. by aggregating all real-valued input vectors lying within the interval boundaries and taking the union as the final output. Although this is consistent with the aggregation of convex interval inputs, in the non-convex case such operators are not idempotent and may result in outputs which do not faithfully summarize or represent the set of inputs. After giving an overview of the treatment of non-convex intervals and their associated interpretations, we propose a novel extension of the arithmetic mean based on penalty functions that provides a representative output and satisfies idempotency

Binary Biometrics: An Analytic Framework to Estimate the Bit Error Probability under Gaussian Assumption

In recent years the protection of biometric data has gained increased interest from the scientific community. Methods such as the helper data system, fuzzy extractors, fuzzy vault and cancellable biometrics have been proposed for protecting biometric data. Most of these methods use cryptographic primitives and require a binary representation from the real-valued biometric data. Hence, the similarity of biometric samples is measured in terms of the Hamming distance between the binary vector obtained at the enrolment and verification phase. The number of errors depends on the expected error probability Pe of each bit between two biometric samples of the same subject. In this paper we introduce a framework for analytically estimating Pe under the assumption that the within-and between-class distribution can be modeled by a Gaussian distribution. We present the analytic expression of Pe as a function of the number of samples used at the enrolment (Ne) and verification (Nv) phases. The analytic expressions are validated using the FRGC v2 and FVC2000 biometric databases

Possibility/Necessity-Based Probabilistic Expectation Models for Linear Programming Problems with Discrete Fuzzy Random Variables

This paper considers linear programming problems (LPPs) where the objective functions involve discrete fuzzy random variables (fuzzy set-valued discrete random variables). New decision making models, which are useful in fuzzy stochastic environments, are proposed based on both possibility theory and probability theory. In multi-objective cases, Pareto optimal solutions of the proposed models are newly defined. Computational algorithms for obtaining the Pareto optimal solutions of the proposed models are provided. It is shown that problems involving discrete fuzzy random variables can be transformed into deterministic nonlinear mathematical programming problems which can be solved through a conventional mathematical programming solver under practically reasonable assumptions. A numerical example of agriculture production problems is given to demonstrate the applicability of the proposed models to real-world problems in fuzzy stochastic environments

A Geometric Interpretation of the Neutrosophic Set - A Generalization of the Intuitionistic Fuzzy Set

In this paper we generalize the intuitionistic fuzzy set (IFS), paraconsistent set, and intuitionistic set to the neutrosophic set (NS). Several examples are presented. Also, a geometric interpretation of the Neutrosophic Set is given using a Neutrosophic Cube. Many distinctions between NS and IFS are underlined.Comment: 9 pages. Presented at the 2003 BISC FLINT-CIBI International Workshop on Soft Computing for Internet and Bioinformatics, University of Berkeley, California, December 15-19, 2003, under the title "Generalization of the Intuitionistic Fuzzy Set to the Neutrosophic Set

Commutative POVMs and Fuzzy Observables

In this paper we review some properties of fuzzy observables, mainly as realized by commutative positive operator valued measures. In this context we discuss two representation theorems for commutative positive operator valued measures in terms of projection valued measures and describe, in some detail, the general notion of fuzzification. We also make some related observations on joint measurements.Comment: Contribution to the Pekka Lahti Festschrif