A perspective on the extension of stochastic orderings to fuzzy random variables

International audienceIn this paper we study how to make joint extensions of stochastic orderings and interval orderings so as to extend methods for comparing random variables, from the point of view of their respective location or magnitude, to fuzzy random variables. The main idea is that the way fuzzy random variables are interpreted affects the choice of the comparison methods. We distinguish three views of fuzzy random variables, according to which various comparison methods seem to make sense. This paper offers an approach toward a systematic classification of combinations of stochastic and interval or fuzzy interval comparison methods

The legacy of 50 years of fuzzy sets: A discussion

International audienceThis note provides a brief overview of the main ideas and notions underlying fifty years of research in fuzzy set and possibility theory, two important settings introduced by L.A. Zadeh for representing sets with unsharp boundaries and uncertainty induced by granules of information expressed with words. The discussion is organized on the basis of three potential understanding of the grades of membership to a fuzzy set, depending on what the fuzzy set intends to represent: a group of elements with borderline members, a plausibility distribution, or a preference profile. It also questions the motivations for some existing generalized fuzzy sets. This note clearly reflects the shared personal views of its authors

CIXL2: A Crossover Operator for Evolutionary Algorithms Based on Population Features

In this paper we propose a crossover operator for evolutionary algorithms with real values that is based on the statistical theory of population distributions. The operator is based on the theoretical distribution of the values of the genes of the best individuals in the population. The proposed operator takes into account the localization and dispersion features of the best individuals of the population with the objective that these features would be inherited by the offspring. Our aim is the optimization of the balance between exploration and exploitation in the search process. In order to test the efficiency and robustness of this crossover, we have used a set of functions to be optimized with regard to different criteria, such as, multimodality, separability, regularity and epistasis. With this set of functions we can extract conclusions in function of the problem at hand. We analyze the results using ANOVA and multiple comparison statistical tests. As an example of how our crossover can be used to solve artificial intelligence problems, we have applied the proposed model to the problem of obtaining the weight of each network in a ensemble of neural networks. The results obtained are above the performance of standard methods

Dequantization via quantum channels

For a unital completely positive map $\Phi$ ("quantum channel") governing the time propagation of a quantum system, the Stinespring representation gives an enlarged system evolving unitarily. We argue that the Stinespring representations of each power $\Phi^m$ of the single map together encode the structure of the original quantum channel and provides an interaction-dependent model for the bath. The same bath model gives a "classical limit" at infinite time $m\to\infty$ in the form of a noncommutative "manifold" determined by the channel. In this way a simplified analysis of the system can be performed by making the large-$m$ approximation. These constructions are based on a noncommutative generalization of Berezin quantization. The latter is shown to involve very fundamental aspects of quantum-information theory, which are thereby put in a completely new light

Let your maps be fuzzy!—Class probabilities and floristic gradients as alternatives to crisp mapping for remote sensing of vegetation

Mapping vegetation as hard classes based on remote sensing data is a frequently applied approach, even though this crisp, categorical representation is not in line with nature\u27s fuzziness. Gradual transitions in plant species composition in ecotones and faint compositional differences across different patches are thus poorly described in the resulting maps. Several concepts promise to provide better vegetation maps. These include (1) fuzzy classification (a.k.a. soft classification) that takes the probability of an image pixel\u27s class membership into account and (2) gradient mapping based on ordination, which describes plant species composition as a floristic continuum and avoids a categorical description of vegetation patterns. A systematic and comprehensive comparison of these approaches is missing to date. This paper hence gives an overview of the state of the art in fuzzy classification and gradient mapping and compares the approaches in a case study. The advantages and disadvantages of the approaches are discussed and their performance is compared to hard classification (a.k.a. crisp or boolean classification). Gradient mapping best conserves the information in the original data and does not require an a priori categorization. Fuzzy classification comes close in terms of information loss and likewise preserves the continuous nature of vegetation, however, still relying on a priori classification. The need for a priori classification may be a disadvantage or, in other cases, an advantage because it allows using categorical input data instead of the detailed vegetation records required for ordination. Both approaches support spatially explicit accuracy analyses, which further improves the usefulness of the output maps. Gradient mapping and fuzzy classification offer various advantages over hard classification, can always be transformed into a crisp map and are generally applicable to various data structures. We thus recommend the use of these approaches over hard classification for applications in ecological research

Statistical depth for fuzzy sets

Statistical depth functions provide a way to order the elements of a space by their centrality in a probability distribution. That has been very successful for generalizing non-parametric order-based statistical procedures from univariate to multivariate and (more recently) to functional spaces. We introduce two general definitions of statistical depth which are adapted to fuzzy data. For that purpose, two concepts of symmetric fuzzy random variables are introduced and studied. Furthermore, a generalization of Tukey's halfspace depth to the fuzzy setting is presented and proved to satisfy the above notions, through a detailed study of its properties.A. Nieto-Reyes and L. Gonzalez are supported by the Spanish Ministerio de Economía, Industria y Competitividad grant MTM2017-86061-C2-2-P. P. Terán is supported by the Ministerio de Economía y Competitividad grant MTM2015-63971-P, the Ministerio de Ciencia, Innovación y Universidades grant PID2019-104486GB-I00 and the Consejería de Empleo, Industria y Turismo del Principado de Asturias grant GRUPIN-IDI2018-000132

ISIPTA'07: Proceedings of the Fifth International Symposium on Imprecise Probability: Theories and Applications

B

A nature-inspired multi-objective optimisation strategy based on a new reduced space searching algorithm for the design of alloy steels

In this paper, a salient search and optimisation algorithm based on a new reduced space searching strategy, is presented. This algorithm originates from an idea which relates to a simple experience when humans search for an optimal solution to a ‘real-life’ problem, i.e. when humans search for a candidate solution given a certain objective, a large area tends to be scanned first; should one succeed in finding clues in relation to the predefined objective, then the search space is greatly reduced for a more detailed search. Furthermore, this new algorithm is extended to the multi-objective optimisation case. Simulation results of optimising some challenging benchmark problems suggest that both the proposed single objective and multi-objective optimisation algorithms outperform some of the other well-known Evolutionary Algorithms (EAs). The proposed algorithms are further applied successfully to the optimal design problem of alloy steels, which aims at determining the optimal heat treatment regime and the required weight percentages for chemical composites to obtain the desired mechanical properties of steel hence minimising production costs and achieving the overarching aim of ‘right-first-time production’ of metals