Transfer learning using the online Fuzzy Min-Max neural network

In this paper, we present an empirical analysis on transfer learning using the Fuzzy Min–Max (FMM) neural network with an online learning strategy. Three transfer learning benchmark data sets, i.e., 20 Newsgroups, WiFi Time, and Botswana, are used for evaluation. In addition, the data samples are corrupted with white Gaussian noise up to 50 %, in order to assess the robustness of the online FMM network in handling noisy transfer learning tasks. The results are analyzed and compared with those from other methods. The outcomes indicate that the online FMM network is effective for undertaking transfer learning tasks in noisy environments.

A hybrid approach to fuzzy risk analysis in stock market

The analysis and prediction of stock market has always been well recognized as a difficult problem due to the level of uncertainty and the factors that affect the price. To tackle this challenge problem, this paper proposed a hybrid approach which mines the useful information utilizing grey system and fuzzy risk analysis in stock prices prediction. In this approach, we firstly provide a model which contains the fuzzy function, k-mean algorithm and grey system (shorted for FKG), then provide the model of fuzzy risk analysis (FRA). A practical example to describe the development of FKG and FRA in stock market is given, and the analytical results provide an evaluation of the method which shows promote results. © 2013 IEEE.

Vector valued similarity measures for Atanassov's intuitionistic fuzzy sets

We present a new approach for defining similarity measures for Atanassov's intuitionistic fuzzy sets (AIFS), in which a similarity measure has two components indicating the similarity and hesitancy aspects. We justify that there are at least two facets of uncertainty of an AIFS, one of which is related to fuzziness while other is related to lack of knowledge or non-specificity. We propose a set of axioms and build families of similarity measures that avoid counterintuitive examples that are used to justify one similarity measure over another. We also investigate a relation to entropies of AIFS, and outline possible application of our method in decision making and image segmentation. © 2014 Elsevier Inc. All rights reserved.

Strong fuzzy subsethood measures and strong equalities via implication functions

In this work we present the definition of strong fuzzy subsethood measure as a unifiying concept for the different notions of fuzzy subsethood that can be found in the literature. We analyze the relations of our new concept with the definitions by Kitainik ( [20]), Young ( [26]) and Sinha and Dougherty ( [23]) and we prove that the most relevant properties of the latter are preserved. We show also several construction methods. © 2014 Old City Publishing, Inc.

Averaging aggregation functions for preferences expressed as Pythagorean membership grades and fuzzy orthopairs

Rather than denoting fuzzy membership with a single value, orthopairs such as Atanassov's intuitionistic membership and non-membership pairs allow the incorporation of uncertainty, as well as positive and negative aspects when providing evaluations in fuzzy decision making problems. Such representations, along with interval-valued fuzzy values and the recently introduced Pythagorean membership grades, present particular challenges when it comes to defining orders and constructing aggregation functions that behave consistently when summarizing evaluations over multiple criteria or experts. In this paper we consider the aggregation of pairwise preferences denoted by membership and non-membership pairs. We look at how mappings from the space of Atanassov orthopairs to more general classes of fuzzy orthopairs can be used to help define averaging aggregation functions in these new settings. In particular, we focus on how the notion of 'averaging' should be treated in the case of Yager's Pythagorean membership grades and how to ensure that such functions produce outputs consistent with the case of ordinary fuzzy membership degrees.

Fuzzy measures of pixel cluster compactness

Pixel-scale fine details are often lost during image processing tasks such as image reduction and filtering. Block or region based algorithms typically rely on averaging functions to implement the required operation and traditional function choices struggle to preserve small, spatially cohesive clusters of pixels which may be corrupted by noise. This article proposes the construction of fuzzy measures of cluster compactness to account for the spatial organisation of pixels. We present two construction methods (minimum spannning trees and fuzzy measure decomposition) to generate measures with specific properties: monotonicity with respect to cluster size; invariance with respect to translation, reflection and rotation; and, discrimination between pixel sets of fixed cardinality with different spatial arrangements. We apply these measures within a non-monotonic mode-like averaging function used for image reduction and we show that this new function preserves pixel-scale structures better than existing monotonie averages.

Patient admission prediction using a pruned fuzzy min–max neural network with rule extraction

A useful patient admission prediction model that helps the emergency department of a hospital admit patients efficiently is of great importance. It not only improves the care quality provided by the emergency department but also reduces waiting time of patients. This paper proposes an automatic prediction method for patient admission based on a fuzzy min–max neural network (FMM) with rules extraction. The FMM neural network forms a set of hyperboxes by learning through data samples, and the learned knowledge is used for prediction. In addition to providing predictions, decision rules are extracted from the FMM hyperboxes to provide an explanation for each prediction. In order to simplify the structure of FMM and the decision rules, an optimization method that simultaneously maximizes prediction accuracy and minimizes the number of FMM hyperboxes is proposed. Specifically, a genetic algorithm is formulated to find the optimal configuration of the decision rules. The experimental results using a large data set consisting of 450740 real patient records reveal that the proposed method achieves comparable or even better prediction accuracy than state-of-the-art classifiers with the additional ability to extract a set of explanatory rules to justify its predictions.

Structural classification of proteins through amino acid sequence using interval type-2 fuzzy logic system

This paper introduces a new multi-output interval type-2 fuzzy logic system (MOIT2FLS) that is automatically constructed from unsupervised data clustering method and trained using heuristic genetic algorithm for a protein secondary structure classification. Three structure classes are distinguished including helix, strand (sheet) and coil which correspond to three outputs of the MOIT2FLS. Quantitative properties of amino acids are used to characterize the twenty amino acids rather than the widely used computationally expensive binary encoding scheme. Amino acid sequences are parsed into learnable patterns using a local moving window strategy. Three clustering tasks are performed using the adaptive vector quantization method to derive an equal number of initial rules for each type of secondary structure. Genetic algorithm is applied to optimally adjust parameters of the MOIT2FLS with the purpose of maximizing the Q3 measure. Comprehensive experimental results demonstrate the strong superiority of the proposed approach over the traditional methods including Chou-Fasman method, Garnier-Osguthorpe-Robson method, and artificial neural network models.

An interval type-2 fuzzy logic system-based method for prediction interval construction

This paper introduces a new non-parametric method for uncertainty quantification through construction of prediction intervals (PIs). The method takes the left and right end points of the type-reduced set of an interval type-2 fuzzy logic system (IT2FLS) model as the lower and upper bounds of a PI. No assumption is made in regard to the data distribution, behaviour, and patterns when developing intervals. A training method is proposed to link the confidence level (CL) concept of PIs to the intervals generated by IT2FLS models. The new PI-based training algorithm not only ensures that PIs constructed using IT2FLS models satisfy the CL requirements, but also reduces widths of PIs and generates practically informative PIs. Proper adjustment of parameters of IT2FLSs is performed through the minimization of a PI-based objective function. A metaheuristic method is applied for minimization of the non-linear non-differentiable cost function. Performance of the proposed method is examined for seven synthetic and real world benchmark case studies with homogenous and heterogeneous noise. The demonstrated results indicate that the proposed method is capable of generating high quality PIs. Comparative studies also show that the performance of the proposed method is equal to or better than traditional neural network-based methods for construction of PIs in more than 90% of cases. The superiority is more evident for the case of data with a heterogeneous noise. © 2014 Elsevier B.V.

A new method for deriving priority weights by extracting consistent numerical-valued matrices from interval-valued fuzzy judgement matrix

It is important to derive priority weights from interval-valued fuzzy preferences when a pairwise comparative mechanism is used. By focusing on the significance of consistency in the pairwise comparison matrix, two numerical-valued consistent comparison matrices are extracted from an interval fuzzy judgement matrix. Both consistent matrices are derived by solving the linear or nonlinear programming models with the aid of assessments from Decision Makers (DMs). An interval priority weight vector from the extracted consistent matrices is generated. In order to retain more information hidden in the intervals, a new probability-based method for comparison of the interval priority weights is introduced. An algorithm for deriving the final priority interval weights for both consistent and inconsistent interval matrices is proposed. The algorithm is also generalized to handle the pairwise comparison matrix with fuzzy numbers. The comparative results from the five examples reveal that the proposed method, as compared with eight existing methods, exhibits a smaller degree of uncertainty pertaining to the priority weights, and is also more reliable based on the similarity measure. © 2014 Elsevier Inc. All rights reserved.