Paternain Dallo, DanielMiguel Turullols, Laura deOchoa Lezaun, GustavoLizasoain Iriso, María InmaculadaMesiar, RadkoBustince Sola, Humberto2019-10-222020-08-0120181063-670610.1109/TFUZZ.2018.2886157https://academica-e.unavarra.es/handle/2454/35275Aggregation or fusion of interval data is not a trivial task, since the necessity of arranging data arises in many aggregation functions, such as OWA operators or the Choquet integral. Some arranging procedures have been given to solve this problem, but they need certain parameters to be set. In order to solve this problem, in this work we propose the concept of an admissible permutation of intervals. Based on this concept, which avoids any parameter selection, we propose a new approach for the interval-valued Choquet integral that takes into account every possible permutation fitting to the considered ordinal structure of data. Finally, a consensus among all the permutations is constructed.10 p.application/pdfeng© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other work.Admissible orderAdmissible permutationChoquet integralInformation fusionInterval-valued Choquet integralinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/openAccess