Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 15
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Capítulo o parte de un libro (BookPart)

On the problem of relaxed indistinguishability operators aggregation

  • Calvo Sánchez, T.
  • Fuster Parra, Pilar
  • Valero, O.
[EN] In this paper we focus our attention on exploring the aggregation of relaxed indistinguishability operators. Concretely we characterize, in terms of triangular triplets with respect to a t-norm, those functions that allow to merge a collection of relaxed indistinguishability operators into a single one., This research was funded by the Spanish Ministry of Economy and Competitiveness under Grants TIN2014-56381-REDT (LODISCO), TIN2016-81731-REDT (LODISCO II) and AEI/FEDER, UE funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Capítulo o parte de un libro (BookPart)

Relaxed metrics and indistinguishability operators: the relationship

  • Fuster-Parra, P.
  • Martín, Javier
  • Miñana, J.J.
  • Valero, O.
[EN] In 1982, the notion of indistinguishability operator was introduced by E. Trillas in order to fuzzify the crisp notion of equivalence relation (\cite{Trillas}). In the study of such a class of operators, an outstanding property must be pointed out. Concretely, there exists a duality relationship between indistinguishability operators and metrics. The aforesaid relationship was deeply studied by several authors that introduced a few techniques to generate metrics from indistinguishability operators and vice-versa (see, for instance, \cite{BaetsMesiar,BaetsMesiar2}). In the last years a new generalization of the metric notion has been introduced in the literature with the purpose of developing mathematical tools for quantitative models in Computer Science and Artificial Intelligence (\cite{BKMatthews,Ma}). The aforementioned generalized metrics are known as relaxed metrics. The main target of this talk is to present a study of the duality relationship between indistinguishability operators and relaxed metrics in such a way that the aforementioned classical techniques to generate both concepts, one from the other, can be extended to the new framework., This research was funded by the Spanish Ministry of Economy and Competitiveness under Grants TIN2014-56381-REDT (LODISCO), TIN2016-81731-REDT (LODISCO II) and AEI/FEDER, UE funds
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

On completeness in metric spaces and fixed point theorems

  • Gregori Gregori, Valentín|||0000-0002-5983-6182
  • Miñana, Juan-José|||0000-0001-9835-0700
  • Roig, Bernardino|||0000-0002-9599-572X
  • Sapena Piera, Almanzor|||0000-0001-8473-6063
[EN] Complete ultrametric spaces constitute a particular class of the so called, recently, G-complete metric spaces. In this paper we characterize a more general class called weak G-complete metric spaces, by means of nested sequences of closed sets. Then, we also state a general fixed point theorem for a self-mapping of a weak G-complete metric space. As a corollary, every asymptotically regular self-mapping of a weak G-Complete metric space has a fixed point., V. Gregori acknowledges the support of the Ministry of Economy and Competitiveness of Spain under Grant MTM2015-64373-P (MINECO/Feder, UE). J.J. Minana acknowledges financial support from the Spanish Ministry of Economy and Competitiveness under Grants TIN2016-81731-REDT (LODISCO II) and AEI/FEDER, UE funds, by Programa Operatiu FEDER 2014-2020 de les Illes Balears, by Project Ref. PROCOE/4/2017 (Direccio General d'Innovacio i Recerca, Govern de les Illes Balears), and by project ROBINS. The latter has received research funding from the EU H2020 framework under GA 779776. This publication reflects only the authors views and the European Union is not liable for any use that may be made of the information contained therein.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Capítulo o parte de un libro (BookPart)

Quasi-metrics, midpoints and applications

  • Valero, Oscar
[EN] In this short note we want to explicitly state that there is a growing research activity in the field of information aggregation via midpoint theory and its applications to decision making., This research was funded by the Spanish Ministry of Economy and Competitiveness under Grants TIN2014-56381-REDT (LODISCO), TIN2016-81731-REDT (LODISCO II) and AEI/FEDER, UE funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A technique for fuzzifying metric spaces via metric preserving mappings

  • Gregori Gregori, Valentín|||0000-0002-5983-6182
  • Miñana, Juan-José|||0000-0001-9835-0700
  • Valero Sierra, Óscar
[EN] In this paper we develop a new technique for constructing fuzzy metric spaces, in the sense of George and Veeramani, from metric spaces and by means of the Lukasievicz t-norm. In particular such a technique is based on the use of metric preserving functions in the sense of J. Dobos. Besides, the new generated fuzzy metric spaces are strong and completable, and if we add an extra condition, they are principal. Appropriate examples of such fuzzy metric spaces are given in order to illustrate the exposed technique., Valentín Gregori acknowledges the support of the Spanish Ministry of Economy and Competitiveness under Grant MTM2015-64373-P (MINECO/FEDER, UE). Oscar Valero acknowledges the support of the Spanish Ministry of Economy and Competitiveness under Grants TIN2014-56381-REDT (LODISCO), TIN2016-81731-REDT (LODISCO II) and AEI/FEDER, UE funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Capítulo o parte de un libro (BookPart)

A proposal toward a possibilistic multi-robot task allocation

  • Guerrero, José
[EN] One of the main problems to solve in a multi-robot systems is to select the best robot to execute each task (task allocation). Several ways to address this problem have been proposed in the literature. This paper focuses on one of them, the so-called response threshold methods. In a recent previous work, it was proved that the possibilistic Markov chains outperform the classical probabilistic approaches when they are used to implement response threshold methods. The aim of this paper is to summarize the advances given by or research group toward a new possibilistic swarm multi-robot task allocation framework., This research was funded by the Spanish Ministry of Economy and Competitiveness under Grants DPI2014-57746-C03-2-R, TIN2014-53772-R, TIN2014-56381-REDT, TIN2016-81731- REDT and AEI/FEDER, UE funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Fuzzy Partial Metric Spaces

  • Gregori Gregori, Valentín|||0000-0002-5983-6182
  • Miñana, Juan-José|||0000-0001-9835-0700
  • Miravet-Fortuño, David
[EN] In this paper we provide a concept of fuzzy partial metric space (X, P, ¿) as an extension to fuzzy setting in the sense of Kramosil and Michalek, of the concept of partial metric due to Matthews. This extension has been defined using the residuum operator ¿¿ associated to a continuous t-norm ¿ and without any extra condition on ¿. Similarly, it is defined the stronger concept of GV -fuzzy partial metric (fuzzy partial metric in the sense of George and Veeramani). After defining a concept of open ball in (X, P, ¿), a topology TP on X deduced from P is constructed, and it is showed that (X, TP) is a T0-space., Valentin Gregori acknowledges the support of the Ministry of Economy and Competitiveness of Spain under Grant MTM2015-64373-P (MINECO/Feder, UE). Juan Jose Minana acknowledges the partially support of the Ministry of Economy and Competitiveness of Spain under Grant TIN2016-81731-REDT (LODISCO II) and AEI/FEDER, UE funds, by the Programa Operatiu FEDER 2014-2020 de les Illes Balears, by project ref. PROCOE/4/2017 (Direccio General d'Innovacio i Recerca, Govern de les Illes Balears), and by project ROBINS. The latter has received research funding from the European Union framework under GA 779776. This publication reflects only the authors views and the European Union is not liable for any use that may be made of the information contained therein.
Repositori Institucional UIB
Publicación Artículo científico (JournalArticle)

Toward a Possibilistic Swarm Multi-Robot Task Allocation: Theoretical and Experimental Results

  • Guerrero, J.
  • Oliver, B.
  • Valero, O.
[eng] Selecting the best task to execute (task allocation problem) is one of the main problems in multi-robot systems. Typical ways to address this problem are based on swarm intelligence and very especially using the so-called response threshold method. In the aforementioned method a robot has a certain probability of executing a task which depends on a task threshold response and a task stimulus. Nevertheless, response threshold method cannot be extended in a natural way to allocate more than two tasks when the theoretical basis is provided by probability theory. Motivated by this fact, this paper leaves the probabilistic approach to the problem and provides a first theoretical framework towards a possibilistic approach. Thus, task allocation problem is addressed using fuzzy Markov chains instead of probabilistic processes. This paper demonstrates that fuzzy Markov chains associated to a task allocation problem can converge to a stationary stage in a finite number of steps. In contrast, the probabilistic processes only can converge asymptotically, i.e. the number of steps is not bounded in general. Moreover, fuzzy Markov chains predicts in a better way the future behavior of the system in the presence of vagueness when measuring distances. The simulations performed confirm the theoretical results and show how the number of steps needed to get a stable state with fuzzy Markov chains is reduced more than 10 times and the system’s behavior prediction can be improved more than a 60% compared to probabilistic approaches.
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Artículo científico (JournalArticle)

On admissible orders over closed subintervals of [0,1]

  • Santana, Fagner
  • Bedregal, Benjamin
  • Viana, Petrucio
  • Bustince Sola, Humberto
In this paper, we make some considerations about admissible orders on the set of closed subintervals of the unit interval I[0,1], i.e. linear orders that refine the product order on intervals. We propose a new way to generate admissible orders on I[0,1] which is more general than those we find in the current literature. Also, we deal with the possibility of an admissible order on I[0,1] to be isomorphic to the usual order on [0,1]. We prove that some orders constructed by our method are not isomorphic to the usual one and we make some considerations about the following question: is there some admissible order on I[0,1] isomorphic to the usual order on [0,1]?, This work was partially supported by the Brazilian funding agency CNPq (Conselho Nacional de Desenvolvimento Científico e Tecnológico), under Proc. No. 307781/2016-0 , and by research projects TIN2016-77356-P (AEI/FEDER,UE) and TIN2016-81731-REDT (AEI/FEDER,UE) of the Spanish Government.
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Artículo científico (JournalArticle)

Weightable quasi-metrics related to fuzzy sets

  • Campión Arrastia, María Jesús
  • García Catalán, Olga Raquel
  • Induráin Eraso, Esteban
  • Valero, Óscar
We show that the definition of a fuzzy set is directly related to the existence of a weightable quasi-metric on a universe. This relationship is also explored in terms of functional equations coming either from the membership function of a fuzzy set or from the disymmetry function of a quasi-metric., This work has been partially supported by the research projects TIN2013-47605-P, TIN2014-56381-REDT, ECO2015-65031-R, MTM2015-63608-P (MINECO/ AEI-FEDER, UE), TIN2016-81731-REDT, TIN2016-77356-P (MINECO/ AEI-FEDER, UE) and the Research Services of the Public University of Navarre (Spain).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Artículo científico (JournalArticle)

Geometrical aggregation of finite fuzzy sets

  • Campión Arrastia, María Jesús
  • García Catalán, Olga Raquel
  • Induráin Eraso, Esteban
  • Lizasoain Iriso, María Inmaculada
  • Raventós Pujol, Armajac
  • Valero, Óscar
A fuzzy set on a finite universe can be interpreted as a vector in a unit cube. This gives rise to a huge variety of approaches in order to aggregate finite fuzzy sets or to modify a given one. We analyze several geometrical methods and discuss possible applications in a multidisciplinary setting., This work has been partially supported by the research projects TIN2013-47605-P, ECO2015-65031-R, MTM2015-63608-P (MINECO/AEI-FEDER, UE), TIN2016-77356-P (MINECO/AEI-FEDER, UE) and TIN2016-81731-REDT (LO-DISCO II and MINECO/AEI-FEDER, UE).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

General grouping functions

  • Santos, Helida
  • Pereira Dimuro, Graçaliz
  • Da Cruz Asmus, Tiago
  • Sanz Delgado, José Antonio
  • Fernández Fernández, Francisco Javier
  • Bustince Sola, Humberto
Trabajo presentado a la 18th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2020. Lisboa, junio de 2020, Some aggregation functions that are not necessarily associative, namely overlap and grouping functions, have called the attention of many researchers in the recent past. This is probably due to the fact that they are a richer class of operators whenever one compares with other classes of aggregation functions, such as t-norms and t-conorms, respectively. In the present work we introduce a more general proposal for disjunctive n-ary aggregation functions entitled general grouping functions, in order to be used in problems that admit n dimensional inputs in a more flexible manner, allowing their application in different contexts. We present some new interesting results, like the characterization of that operator and also provide different construction methods., Supported by CNPq (233950/2014-1, 307781/2016-0, 301618/2019-4), FAPERGS (17/2551 - 0000872-3, 19/2551 - 0001279-9, 19/ 2551 - 0001660-3), PNPD/CAPES (464880 /2019-00) and the Spanish Ministry of Science and Technology (PC093 - 094TFIPDL, TIN2016-81731-REDT, TIN2016-77356-P (AEI/FEDER, UE)).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

General admissibly ordered interval-valued overlap functions

  • Da Cruz Asmus, Tiago
  • Pereira Dimuro, Graçaliz
  • Sanz Delgado, José Antonio
  • Wieczynski, Jonata
  • Lucca, Giancarlo
  • Bustince Sola, Humberto
Overlap functions are a class of aggregation functions that measure the verlapping degree between two values. They have been successfully applied in several problems in which associativity is not required, such as classification and image processing. Some generalizations of overlap functions were proposed for them to be applied in problems with more than two classes, such as 𝑛- dimensional and general overlap functions. To measure the overlapping of interval data, interval-valued overlap functions were defined, and, later, they were also generalized in the form of 𝑛-dimensional and general interval-valued overlap functions. In order to apply some of those concepts in problems with interval data considering the use of admissible orders, which are total orders that refine the most used partial order for intervals, 𝑛-dimensional admissibly ordered interval-valued overlap functions were recently introduced, proving to be suitable to be applied in classification problems. However, the sole construction method presented for this kind of function do not allow the use of the well known lexicographical orders. So, in this work we combine previous developments to introduce general admissibly ordered interval-valued overlap functions, while also presenting different construction methods and the possibility to combine such methods, showcasing the flexibility and adaptability of this approach, while also being compatible with the lexicographical orders., Supported by the Spanish Ministry of Science and Technology (PC093-094 TFIPDL, TIN2016-81731-REDT, TIN2016-77356-P (AEI/FEDER, UE)), Spanish Ministry of Economy and Competitiveness through the Spanish National Research (project PID2019-108392GB-I00 / AEI / 10.13039/501100011033), UPNA (PJUPNA1926), CNPq (311429/2020-3, 301618/2019-4) and FAPERGS (19/2551-0001660).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

Application and comparison of CC-integrals in business group decision making

  • Wieczynski, Jonata
  • Lucca, Giancarlo
  • Borges, Eduardo N.
  • Pereira Dimuro, Graçaliz
  • Lourenzutti, Rodolfo
  • Bustince Sola, Humberto
Optimized decisions is required by businesses (analysts) if they want to stay open. Even thought some of these are from the knowhow of the managers/executives, most of them can be described mathematically and solved (semi)-optimally by computers. The Group Modular Choquet Random Technique for Order of Preference by Similarity to Ideal Solution (GMC-RTOPSIS) is a Multi-Criteria Decision Making (MCDM) that was developed as a method to optimize the later types of problems, by being able to work with multiple heterogeneous data types and interaction among different criteria. On the other hand the Choquet integral is widely used in various fields, such as brain-computer interfaces and classification problems. With the introduction of the CC-integrals, this study presents the GMC-RTOPSIS method with CC-integrals. We applied 30 different CC-integrals in the method and analyzed its results using 3 different methods. We found that by modifying the decisionmaking method we allow for more flexibility and certainty in the choosing process., This study was supported by Navarra de Servicios y Tecnologías, S.A. (NASER-TIC), PNPD/CAPES (464880/2019-00) and CAPES Financial Code 001, CNPq (301618/2019-4), FAPERGS (19/2551-0001279-9, 19/ 2551-0001660) and, the Spanish Ministry of Science and Technology (PC093-094TFIPDL, TIN2016-81731-REDT, TIN2016-77356-P (AEI/FEDER, UE)).
Academica-e. Repositorio Institucional de la Universidad Pública de Navarra
Publicación Contribución de congreso (ConferenceOutput)

CC-separation measure applied in business group decision making

  • Wieczynski, Jonata
  • Lucca, Giancarlo
  • Borges, Eduardo N.
  • Pereira Dimuro, Graçaliz
  • Lourenzutti, Rodolfo
  • Bustince Sola, Humberto
In business, one of the most important management functions is decision making The Group Modular Choquet Random TOPSIS (GMC-RTOPSIS) is a Multi-Criteria Decision Making (MCDM) method that can work with multiple heterogeneous data types. This method uses the Choquet integral to deal with the interaction between different criteria. The Choquet integral has been generalized and applied in various fields of study, such as imaging processing, brain-computer interface, and classification problems. By generalizing the so-called extended Choquet integral by copulas, the concept of CC-integrals has been introduced, presenting satisfactory results when used to aggregate the information in Fuzzy Rule-Based Classification Systems. Taking this into consideration, in this paper. we applied 11 different CC-integrals in the GMC-RTOPSIS. The results demonstrated that this approach has the advantage of allowing more flexibility and certainty in the choosing process by giving a higher separation between the first and second-ranked alternatives., This study was supported by PNPD/CAPES (464880/2019-00) and CAPES Financial Code 001, CNPq (301618/2019-4), FAPERGS (19/2551-0001279-9, 19/ 2551-0001660) and, the Spanish Ministry of Science and Technology (PC093-094TFIPDL, TIN2016-81731-REDT, TIN2016-77356-P (AEI/FEDER, UE)).