720 research outputs found
On the usage of the probability integral transform to reduce the complexity of multi-way fuzzy decision trees in Big Data classification problems
We present a new distributed fuzzy partitioning method to reduce the
complexity of multi-way fuzzy decision trees in Big Data classification
problems. The proposed algorithm builds a fixed number of fuzzy sets for all
variables and adjusts their shape and position to the real distribution of
training data. A two-step process is applied : 1) transformation of the
original distribution into a standard uniform distribution by means of the
probability integral transform. Since the original distribution is generally
unknown, the cumulative distribution function is approximated by computing the
q-quantiles of the training set; 2) construction of a Ruspini strong fuzzy
partition in the transformed attribute space using a fixed number of equally
distributed triangular membership functions. Despite the aforementioned
transformation, the definition of every fuzzy set in the original space can be
recovered by applying the inverse cumulative distribution function (also known
as quantile function). The experimental results reveal that the proposed
methodology allows the state-of-the-art multi-way fuzzy decision tree (FMDT)
induction algorithm to maintain classification accuracy with up to 6 million
fewer leaves.Comment: Appeared in 2018 IEEE International Congress on Big Data (BigData
Congress). arXiv admin note: text overlap with arXiv:1902.0935
Use of idempotent functions in the aggregation of different filters for noise removal
The majority of existing denoising algorithms obtain good results for a specific noise model, and when it is known previously. Nonetheless, there is a lack in denoising algorithms that can deal with any unknown noisy images. Therefore, in this paper, we study the use of aggregation functions for denoising purposes, where the noise model is not necessary known in advance; and how these functions affect the visual and quantitative results of the resultant images
Interval-valued contractive fuzzy negations
In this work we consider the concept of contractive interval-valued fuzzy negation, as a negation such that it does not increase the length or amplitude of an interval. We relate this to the concept of Lipschitz function. In particular, we prove that the only strict (strong) contractive interval-valued fuzzy negation is the one generated from the standard (Zadeh's) negation
Consensus image method for unknown noise removal
Noise removal has been, and it is nowadays, an important task in computer vision. Usually, it is a previous task preceding other tasks, as segmentation or reconstruction. However, for most existing denoising algorithms the noise model has to be known in advance. In this paper, we introduce a new approach based on consensus to deal with unknown noise models. To do this, different filtered images are obtained, then combined using multifuzzy sets and averaging aggregation functions. The final decision is made by using a penalty function to deliver the compromised image. Results show that this approach is consistent and provides a good compromise between filters.This work is supported by the European Commission under Contract No. 238819 (MIBISOC Marie Curie ITN). H. Bustince was supported by Project TIN 2010-15055 of the Spanish Ministry of Science
Automatic histogram threshold using fuzzy measures
In this paper, an automatic histogram threshold approach based on a fuzziness measure is presented. This work is an improvement of an existing method. Using fuzzy logic concepts, the problems involved in finding the minimum of a criterion function are avoided. Similarity between gray levels is the key to find an optimal threshold. Two initial regions of gray levels, located at the boundaries of the histogram, are defined. Then, using an index of fuzziness, a similarity process is started to find the threshold point. A significant contrast between objects and background is assumed. Previous histogram equalization is used in small contrast images. No prior knowledge of the image is required.info:eu-repo/semantics/publishedVersio
Construction of Capacities from Overlap Indexes
In many problems, it is crucial to find a relation between groups of data. Such relation can be expressed, for instance, in terms of an appropriate fuzzy measure or capacity([10, 21]) which reflects the way the different data are connected to each other [20]. In this chapter, taking into account this fact and following the developments in [8],we introduce a method to build capacities ([20, 21]) directly from the data (inputs) of a given problem. In order to do so, we make use of the notions of overlap function and overlap index ([5, 12, 13, 7, 4, 14, 16]) for constructing capacities which reflect how different data are related to each other.
This paper is organized as follows: after providing some preliminaries, we analyse, in Section 3, some properties of overlap functions and indexes. In Sections 4 we discuss a method for constructing capacities from overlap functions and overlap indexes. Finally, we present some conclusions and references
- …