Identification of general and double aggregation operators using monotone smoothing

Aggregation operators model various operations on fuzzy sets, such as conjunction, disjunction and averaging. Recently double aggregation operators have been introduced; they model multistep aggregation process. The choice of aggregation operators depends on the particular problem, and can be done by fitting the operator to empirical data. We examine fitting general aggregation operators by using a new method of monotone Lipschitz smoothing. We study various boundary conditions and constraints which determine specific types of aggregation.<br /

Constraint-wish and satisfied-dissatisfied: an overview of two approaches for dealing with bipolar querying

In recent years, there has been an increasing interest in dealing with user preferences in flexible database querying, expressing both positive and negative information in a heterogeneous way. This is what is usually referred to as bipolar database querying. Different frameworks have been introduced to deal with such bipolarity. In this chapter, an overview of two approaches is given. The first approach is based on mandatory and desired requirements. Hereby the complement of a mandatory requirement can be considered as a specification of what is not desired at all. So, mandatory requirements indirectly contribute to negative information (expressing what the user does not want to retrieve), whereas desired requirements can be seen as positive information (expressing what the user prefers to retrieve). The second approach is directly based on positive requirements (expressing what the user wants to retrieve), and negative requirements (expressing what the user does not want to retrieve). Both approaches use pairs of satisfaction degrees as the underlying framework but have different semantics, and thus also different operators for criteria evaluation, ranking, aggregation, etc

Some results on Lipschitz quasi-arithmetic means

We present in this paper some properties of k-Lipschitz quasi-arithmetic means. The Lipschitz aggregation operations are stable with respect to input inaccuracies, what is a very important property for applications. Moreover, we provide sufficient conditions to determine when a quasi&ndash;arithemetic mean holds the k-Lipschitz property and allow us to calculate the Lipschitz constant k.<br /

Multi-criteria Performance Assessment of Adaptive Radar Resources Management: Application to Naval Scenario

International audienceMultifunction radars (MFR) must achieve their capability requirements in an increasingly complex environment, populated with diverse and hostile targets (e.g. low Radar Cross-Section, low speed targets in clutter or high speed, ballistic targets) in saturating scenarios (due to e.g. RF interference or threats). These radar systems are increasingly exploiting active electronically scanned array (AESA) technology to dynamically schedule the use of multiple functions in a short duration. However, the increasing complexity and adaptive nature of MFR radar makes it very difficult to specify their performance in a way which can both deliver the required capability and which can be verified in a cost-effective manner. Due to their multi-function feature, the operational scenarios have a strong impact on MFR radars; their performances should be specified accordingly. Addressing the challenges in this area will benefit via better understood requirements which can be more easily interpreted. After definition of FoM (Figures of Merit) for phased array radar operation and performance, we have computed them on benchmark test scenarios of varying complexity. We describe a new methodology to aggregate these metrics to provide a global notation of MFR radar performances

The generalized index of maximum and minimum level and its application in decision making

The index of maximum and minimum level is a very useful technique, especially for decision making, which uses the Hamming distance and the adequacy coefficient in the same problem. In this paper, we suggest a generalization by using generalized and quasi-arithmetic means. As a result, we will get the generalized ordered weighted averaging index of maximum and minimum level (GOWAIMAM) and the Quasi-OWAIMAAM operator. These new aggregation operators generalize a wide range of particular cases such as the generalized index of maximum and minimum level (GIMAM), the OWAIMAM, the ordered weighted quadratic averaging IMAM (OWQAIMAM), and others. We also develop an application of the new approach in a decision making problem about selection of products.generalized mean, index of maximum and minimum level, quasi-arithmetic mean, decision making, owa operator

Defuzzification of the Discretised Generalised Type-2 Fuzzy Set: Experimental Evaluation

CCI - Centre for Computational Intelligence NOTICE: this is the author’s version of a work that was accepted for publication in Information Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version can be found by following the DOIThe work reported in this paper addresses the challenge of the efficient and accurate defuzzification of discretised generalised type-2 fuzzy sets as created by the inference stage of a Mamdani Fuzzy Inferencing System. The exhaustive method of defuzzification for type-2 fuzzy sets is extremely slow, owing to its enormous computational complexity. Several approximate methods have been devised in response to this defuzzification bottleneck. In this paper we begin by surveying the main alternative strategies for defuzzifying a generalised type-2 fuzzy set: (1) Vertical Slice Centroid Type-Reduction; (2) the sampling method; (3) the elite sampling method; and (4) the $\alpha$-planes method. We then evaluate the different methods experimentally for accuracy and efficiency. For accuracy the exhaustive method is used as the standard. The test results are analysed statistically by means of the Wilcoxon Nonparametric Test and the elite sampling method shown to be the most accurate. In regards to efficiency, Vertical Slice Centroid Type-Reduction is demonstrated to be the fastest technique

Mapa de la recerca del Campus de Vilanova i la Geltrú

Postprint (author’s final draft

Type-2 Fuzzy Logic: Circumventing the Defuzzification Bottleneck

Type-2 fuzzy inferencing for generalised, discretised type-2 fuzzy sets has been impeded by the computational complexity of the defuzzification stage of the fuzzy inferencing system. Indeed this stage is so complex computationally that it has come to be known as the defuzzification bottleneck. The computational complexity derives from the enormous number of embedded sets that have to be individually processed in order to effect defuzzification. Two new approaches to type-2 defuzzification are presented, the sampling method and the Greenfield-Chiclana Collapsing Defuzzifier. The sampling method and its variant, elite sampling, are techniques for the defuzzification of generalised type-2 fuzzy sets. In these methods a relatively small sample of the totality of embedded sets is randomly selected and processed. The small sample size drastically reduces the computational complexity of the defuzzification process, so that it may be speedily accomplished. The Greenfield-Chiclana Collapsing Defuzzifier relies upon the concept of the representative embedded set, which is an embedded set having the same defuzzified value as the type-2 fuzzy set that is to be defuzzified. By a process termed collapsing the type-2 fuzzy set is converted into a type-1 fuzzy set which, as an approximation to the representative embedded set, is known as the representative embedded set approximation. This type-1 fuzzy set is easily defuzzified to give the defuzzified value of the original type-2 fuzzy set. By this method the computational complexity of type-2 defuzzification is reduced enormously, since the representative embedded set approximation replaces the entire collection of embedded sets. The strategy was conceived as a generalised method, but so far only the interval version has been derived mathematically. The grid method of discretisation for type-2 fuzzy sets is also introduced in this thesis. Work on the defuzzification of type-2 fuzzy sets began around the turn of the millennium. Since that time a number of investigators have contributed methods in this area. These different approaches are surveyed, and the major methods implemented in code prior to their experimental evaluation. In these comparative experiments the grid method of defuzzification is employed. The experimental results show beyond doubt that the collapsing method performs the best of the interval alternatives. However, though the sampling method performs well experimentally, the results do not demonstrate it to be the best performing generalised technique