Bustince Sola, Humberto

Loading...
Profile Picture

Email Address

Birth Date

Job Title

Last Name

Bustince Sola

First Name

Humberto

person.page.departamento

Estadística, Informática y Matemáticas

person.page.instituteName

ISC. Institute of Smart Cities

person.page.observainves

person.page.upna

Name

Search Results

Now showing 1 - 2 of 2
  • PublicationOpen Access
    Directions of directional, ordered directional and strengthened ordered directional increasingness of linear and ordered linear fusion operators
    (IEEE, 2019) Sesma Sara, Mikel; Marco Detchart, Cedric; Lafuente López, Julio; Roldán López de Hierro, Antonio Francisco; Mesiar, Radko; Bustince Sola, Humberto; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISC; Estadística, Informática y Matemáticas; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
    In this work we discuss the forms of monotonicity that have been recently introduced to relax the monotonicity condition in the definition of aggregation functions. We focus on directional, ordered directional and strengthened ordered directional monotonicity, study their main properties and provide some results about their links and relations among them. We also present two families of functions, the so-called linear fusion functions and ordered linear fusion functions and we study the set of directions for which these types of functions are directionally, ordered directionally and strengthened ordered directionally increasing. In particular, OWA operators are an example of ordered linear fusion functions.
  • PublicationOpen Access
    OWA operators based on admissible permutations
    (IEEE, 2019) Paternain Dallo, Daniel; Jin, LeSheng; Mesiar, Radko; Vavríková, Lucia; Bustince Sola, Humberto; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa, PJUPNA13
    In this work we propose a new OWA operator defined on bounded convex posets of a vector-lattice. In order to overcome the non-existence of a total order, which is necessary to obtain a non-decreasing arrangement of the input data, we use the concept of admissible permutation. Based on it, our proposal calculates the different ways in which the input vector could be arranged, always respecting the partial order. For each admissible arrangement, we calculate an intermediate value which is finally collected and averaged by means of the arithmetic mean. We analyze several properties of this operator and we give some counterexamples of those properties of aggregation functions which are not satisfied.