Félix Díaz-Hermida

AI
h-index10
5papers
38citations
Novelty20%
AI Score15

5 Papers

2.0AIFeb 6, 2019
The FA Quantifier Fuzzification Mechanism: analysis of convergence and efficient implementations

Félix Díaz-Hermida, Marcos Matabuena, Juan C. Vidal

The fuzzy quantification model FA has been identified as one of the best behaved quantification models in several revisions of the field of fuzzy quantification. This model is, to our knowledge, the unique one fulfilling the strict Determiner Fuzzification Scheme axiomatic framework that does not induce the standard min and max operators. The main contribution of this paper is the proof of a convergence result that links this quantification model with the Zadeh's model when the size of the input sets tends to infinite. The convergence proof is, in any case, more general than the convergence to the Zadeh's model, being applicable to any quantitative quantifier. In addition, recent revisions papers have presented some doubts about the existence of suitable computational implementations to evaluate the FA model in practical applications. In order to prove that this model is not only a theoretical approach, we show exact algorithmic solutions for the most common linguistic quantifiers as well as an approximate implementation by means of Monte Carlo. Additionally, we will also give a general overview of the main properties fulfilled by the FA model, as a single compendium integrating the whole set of properties fulfilled by it has not been previously published.

1.7AIJul 19, 2018
Fuzzy quantification for linguistic data analysis and data mining

F. Díaz-Hermida, Juan. C. Vidal

Fuzzy quantification is a subtopic of fuzzy logic which deals with the modelling of the quantified expressions we can find in natural language. Fuzzy quantifiers have been successfully applied in several fields like fuzzy, control, fuzzy databases, information retrieval, natural language generation, etc. Their ability to model and evaluate linguistic expressions in a mathematical way, makes fuzzy quantifiers very powerful for data analytics and data mining applications. In this paper we will give a general overview of the main applications of fuzzy quantifiers in this field as well as some ideas to use them in new application contexts.

9.1AIMay 11, 2016
Characterizing Quantifier Fuzzification Mechanisms: a behavioral guide for practical applications

F. Diaz-Hermida, M. Pereira-Fariña, Juan C. Vidal et al.

Important advances have been made in the fuzzy quantification field. Nevertheless, some problems remain when we face the decision of selecting the most convenient model for a specific application. In the literature, several desirable adequacy properties have been proposed, but theoretical limits impede quantification models from simultaneously fulfilling every adequacy property that has been defined. Besides, the complexity of model definitions and adequacy properties makes very difficult for real users to understand the particularities of the different models that have been presented. In this work we will present several criteria conceived to help in the process of selecting the most adequate Quantifier Fuzzification Mechanisms for specific practical applications. In addition, some of the best known well-behaved models will be compared against this list of criteria. Based on this analysis, some guidance to choose fuzzy quantification models for practical applications will be provided.

7.4AINov 27, 2014
On the analysis of set-based fuzzy quantified reasoning using classical syllogistics

M. Pereira-Fariña, F. Díaz-Hermida, A. Bugarín

Syllogism is a type of deductive reasoning involving quantified statements. The syllogistic reasoning scheme in the classical Aristotelian framework involves three crisp term sets and four linguistic quantifiers, for which the main support is the linguistic properties of the quantifiers. A number of fuzzy approaches for defining an approximate syllogism have been proposed for which the main support is cardinality calculus. In this paper we analyze fuzzy syllogistic models previously described by Zadeh and Dubois et al. and compare their behavior with that of the classical Aristotelian framework to check which of the 24 classical valid syllogistic reasoning patterns or moods are particular crisp cases of these fuzzy approaches. This allows us to assess to what extent these approaches can be considered as either plausible extensions of the classical crisp syllogism or a basis for a general approach to the problem of approximate syllogism.

9.1AIOct 27, 2014
The probatilistic Quantifier Fuzzification Mechanism FA: A theoretical analysis

Felix Diaz-Hermida, Alberto Bugarin, David E. Losada

The main goal of this work is to analyze the behaviour of the FA quantifier fuzzification mechanism. As we prove in the paper, this model has a very solid theorethical behaviour, superior to most of the models defined in the literature. Moreover, we show that the underlying probabilistic interpretation has very interesting consequences.