Dpto. Automática y Computación - Automatika eta Konputazioa Saila

Permanent URI for this community

http://hdl.handle.net/2454/10443

Browse

Now showing 1 - 18 of 18

Open Access
An algorithm for group decision making using n -dimensional fuzzy sets, admissible orders and OWA operators
(Elsevier, 2017) Miguel Turullols, Laura de; Sesma Sara, Mikel; Elkano Ilintxeta, Mikel; Asiain Ollo, María José; Bustince Sola, Humberto; Automatika eta Konputazioa; Matematika; Institute of Smart Cities - ISC; Automática y Computación; Matemáticas; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
In this paper we propose an algorithm to solve group decision making problems using n-dimensional fuzzy sets, namely, sets in which the membership degree of each element to the set is given by an in- creasing tuple of n elements. The use of these sets has naturally led us to define admissible orders for n-dimensional fuzzy sets, to present a construction method for those orders and to study OWA operators for aggregating the tuples used to represent the membership degrees of the elements. In these condi- tions, we present an algorithm and apply it to a case study, in which we show that the exploitation phase which appears in many decision making methods can be omitted by just considering linear orders between tuples.
Open Access
Application of two different methods for extending lattice-valued restricted equivalence functions used for constructing similarity measures on L-fuzzy sets
(Elsevier, 2018) Palmeira, Eduardo S.; Bedregal, Benjamin; Bustince Sola, Humberto; Paternain Dallo, Daniel; Miguel Turullols, Laura de; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
Based on previous investigations, we have proposed two different methods to extend lattice-valued fuzzy connectives (t-norms, t-conorms, negations and implications) and other related operators, considering a generalized notion of sublattices. Taking into account the results obtained and seeking to analyze the behavior of both extension methods in face of fuzzy operators related to image processing, we have applied these methods so as to extend restricted equivalence functions, restricted dissimilarity functions and Ee,N-normal functions. We also generalize the concepts of similarity measure, distance measure and entropy measure for L-fuzzy sets constructing them via restricted equivalence functions, restricted dissimilarity functions and Ee,N-normal functions
Embargo
Binary relations coming from solutions of functional equations: orderings and fuzzy subsets
(World Scientific Publishing Company, 2017) Campión Arrastia, María Jesús; Miguel Turullols, Laura de; García Catalán, Olga Raquel; Induráin Eraso, Esteban; Abrísqueta Usaola, Francisco Javier; Automatika eta Konputazioa; Matematika; Institute of Smart Cities - ISC; Institute for Advanced Research in Business and Economics - INARBE; Institute for Advanced Materials and Mathematics - INAMAT2; Automática y Computación; Matemáticas; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
We analyze the main properties of binary relations, defined on a nonempty set, that arise in a natural way when dealing with real-valued functions that satisfy certain classical functional equations on two variables. We also consider the converse setting, namely, given binary relations that accomplish some typical properties, we study whether or not they come from solutions of some functional equation. Applications to the numerical representability theory of ordered structures are also furnished as a by-product. Further interpretations of this approach as well as possible generalizations to the fuzzy setting are also commented. In particular, we discuss how the values taken for bivariate functions that are bounded solutions of some classical functional equations define, in a natural way, fuzzy binary relations on a set.
Open Access
Construction of capacities from overlap indexes
(Springer, 2017) Sanz Delgado, José Antonio; Galar Idoate, Mikel; Mesiar, Radko; Bustince Sola, Humberto; Fernández Fernández, Francisco Javier; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación
In this chapter, we show how the concepts of overlap function and overlap index can be used to define fuzzy measures which depend on the specific data of each considered problem.
Open Access
Convolution lattices
(Elsevier, 2018) Miguel Turullols, Laura de; Bustince Sola, Humberto; Baets, Bernard de; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación
We propose two convolution operations on the set of functions between two bounded lattices and investigate the algebraic structure they constitute, in particular the lattice laws they satisfy. Each of these laws requires the restriction to a specific subset of functions, such as normal, idempotent or convex functions. Combining all individual results, we identify the maximal subsets of functions resulting in a bounded lattice, and show this result to be equivalent to the distributivity of the lattice acting as domain of the functions. Furthermore, these lattices turn out to be distributive as well. Additionally, we show that for the larger subset of idempotent functions, although not satisfying the absorption laws, the convolution operations satisfy the Birkhoff equation.
Open Access
A decision tree based approach with sampling techniques to predict the survival status of poly-trauma patients
(Atlantis Press, 2017) Sanz Delgado, José Antonio; Fernández Fernández, Francisco Javier; Bustince Sola, Humberto; Gradín Purroy, Carlos; Belzunegui Otano, Tomás; Automatika eta Konputazioa; Osasun Zientziak; Institute of Smart Cities - ISC; Automática y Computación; Ciencias de la Salud; Gobierno de Navarra / Nafarroako Gobernua, PI-019/11
Survival prediction of poly-trauma patients measure the quality of emergency services by comparing their predictions with the real outcomes. The aim of this paper is to tackle this problem applying C4.5 since it achieves accurate results and it provides interpretable models. Furthermore, we use sampling techniques because, among the 378 patients treated at the Hospital of Navarre, the number of survivals excels that of deaths. Logistic regressions are used in the comparison, since they are an standard in this domain.
Open Access
Evolution in time of L-fuzzy context sequences
(Elsevier, 2016) Alcalde, Cristina; Burusco Juandeaburre, Ana; Bustince Sola, Humberto; Jurío Munárriz, Aránzazu; Sanz Delgado, José Antonio; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
In this work, we consider a complete lattice L and we study L-fuzzy context sequences which represent the evolution in time of an L-fuzzy context. To carry out this study, in the first part of the paper, we consider n-ary OWA operators in complete lattices, which enable us to make a general analysis and a temporal analysis at any moment in time of L-fuzzy context sequences. After that, evolution in time of the relationship between the objects and the attributes is considered. In particular, we analyze the concepts of Trend and Persistent formal contexts. Finally, we illustrate our results with an example where we consider the particular lattice L = J ([0, 1]).
Open Access
A framework for radial data comparison and its application to fingerprint analysis
(Elsevier, 2016) Marco Detchart, Cedric; Cerrón González, Juan; Miguel Turullols, Laura de; López Molina, Carlos; Bustince Sola, Humberto; Galar Idoate, Mikel; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
This work tackles the comparison of radial data, and proposes comparison measures that are further applied to fingerprint analysis. First, we study the similarity of scalar and non-scalar radial data, elaborated on previous works in fuzzy set theory. This study leads to the concepts of restricted radial equivalence function and Radial Similarity Measure, which model the perceived similarity between scalar and vectorial pieces of radial data, respectively. Second, the utility of these functions is tested in the context of fingerprint analysis, and more specifically, in the singular point detection. With this aim, a novel Template-based Singular Point Detection method is proposed, which takes advantage of these functions. Finally, their suitability is tested in different fingerprint databases. Different Similarity Measures are considered to show the flexibility offered by these measures and the behaviour of the new method is compared with well-known singular point detection methods.
Open Access
Fuzzy rule-based classification systems for multi-class problems using binary decomposition strategies: on the influence of n-dimensional overlap functions in the fuzzy reasoning method
(Elsevier, 2016) Elkano Ilintxeta, Mikel; Galar Idoate, Mikel; Sanz Delgado, José Antonio; Bustince Sola, Humberto; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación
Multi-class classification problems appear in a broad variety of real-world problems, e.g., medicine, genomics, bioinformatics, or computer vision. In this context, decomposition strategies are useful to increase the classification performance of classifiers. For this reason, in a previous work we proposed to improve the performance of FARC-HD (Fuzzy Association Rule-based Classification model for High-Dimensional problems) fuzzy classifier using One-vs-One (OVO) and One-vs-All (OVA) decomposition strategies. As a result of an exhaustive experimental analysis, we concluded that even though the usage of decomposition strategies was worth to be considered, further improvements could be achieved by introducing n-dimensional overlap functions instead of the product t-norm in the Fuzzy Reasoning Method (FRM). In this way, we can improve confidences for the subsequent processing performed in both OVO and OVA. In this paper, we want to conduct a broader study of the influence of the usage of n-dimensional overlap functions to model the conjunction in several Fuzzy Rule-Based Classification Systems (FRBCSs) in order to enhance their performance in multi-class classification problems applying decomposition techniques. To do so, we adapt the FRM of four well-known FRBCSs (CHI, SLAVE, FURIA, and FARC-HD itself). We will show that the benefits of the usage of n-dimensional overlap functions strongly depend on both the learning algorithm and the rule structure of each classifier, which explains why FARC-HD is the most suitable one for the usage of these functions.
Open Access
General overlap functions
(Elsevier, 2019) Miguel Turullols, Laura de; Gómez, Daniel; Tinguaro, Javier; Montero, Javier; Bustince Sola, Humberto; Pereira Dimuro, Graçaliz; Sanz, Jose Antonio; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa.
As a generalization of bivariate overlap functions, which measure the degree of overlapping (intersection for non-crisp sets) of n different classes, in this paper we introduce the concept of general overlap functions. We characterize the class of general overlap functions and include some construction methods by means of different aggregation and bivariate overlap functions. Finally, we apply general overlap functions to define a new matching degree in a classification problem. We deduce that the global behavior of these functions is slightly better than some other methods in the literature.
Open Access
A historical account of types of fuzzy sets and their relationships
(IEEE, 2016) Bustince Sola, Humberto; Barrenechea Tartas, Edurne; Pagola Barrio, Miguel; Fernández Fernández, Francisco Javier; Xu, Zeshui; Bedregal, Benjamin; Montero, Javier; Hagras, Hani; Herrera, Francisco; Baets, Bernard de; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación
In this work we review the definition and basic properties of the different types of fuzzy sets that have appeared up to now in the literature. We also analyze the relationships between them and enumerate some of the applications in which they have been used.
Open Access
Interval-valued Atanassov intuitionistic OWA aggregations using admissible linear orders and their application to decision making
(IEEE, 2016) Miguel Turullols, Laura de; Bustince Sola, Humberto; Pekala, Barbara; Bentkowska, Urszula; Silva, Ivanoska da; Bedregal, Benjamin; Mesiar, Radko; Ochoa Lezaun, Gustavo; Automatika eta Konputazioa; Matematika; Institute of Smart Cities - ISC; Automática y Computación; Matemáticas
Based on the definition of admissible order for interval-valued Atanassov intuitionistic fuzzy sets, we study OWA operators in these sets distinguishing between the weights associated to the membership and those associated to the nonmembership degree which may differ from the latter. We also study Choquet integrals for aggregating information which is represented using interval-valued Atanassov intuitionistic fuzzy sets. We conclude with two algorithms to choose the best alternative in a decision making problem when we use this kind of sets to represent information.
Open Access
Linking mathematical morphology and L-fuzzy concepts
(World Scientific, 2017) Alcalde, Cristina; Burusco Juandeaburre, Ana; Bustince Sola, Humberto; Fuentes González, Ramón; Sesma Sara, Mikel; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación
In this paper we study the relation between L-fuzzy morphology and L-fuzzy concepts over complete lattices. In particular, we show how the erosion and dilation operators of the former can be understood in terms of the derivation operators of the latter, even when the set of objects is different from the set of attributes.
Open Access
Multivalued contexts associated with criteria
(Taylor & Francis, 2018) Alcalde, Cristina; Burusco Juandeaburre, Ana; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
We are interested in the study of L-fuzzy contexts taking into account different criteria. These contexts arise when we want to analyze the relationship between objects and attributes from different points of view. Furthermore, in some occasions, these L-fuzzy contexts have several values for every pair object attribute. We will see how both the WOWA operators and the Choquet integrals will be interesting tools for the aggregation processes that we are going to carry out.
Open Access
New measures for comparing matrices and their application to image processing
(Elsevier, 2018) Sesma Sara, Mikel; Miguel Turullols, Laura de; Pagola Barrio, Miguel; Burusco Juandeaburre, Ana; Mesiar, Radko; Bustince Sola, Humberto; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
In this work we present the class of matrix resemblance functions, i.e., functions that measure the difference between two matrices. We present two construction methods and study the properties that matrix resemblance functions satisfy, which suggest that this class of functions is an appropriate tool for comparing images. Hence, we present a comparison method for grayscale images whose result is a new image, which enables to locate the areas where both images are equally similar or dissimilar. Additionally, we propose some applications in which this comparison method can be used, such as defect detection in industrial manufacturing processes and video motion detection and object tracking.
Open Access
Penalty function in optimization problems: a review of recent developments
(Springer, 2018) Bustince Sola, Humberto; Fernández Fernández, Francisco Javier; Burillo López, Pedro; Automática y Computación; Automatika eta Konputazioa; Institute of Smart Cities - ISC
In this chapter we make a brief revision of some recent developments on the notion of penalty function as a tool for the fusion of information, including the most recently published definition as well as the extension of the concept to the lattice setting.
Open Access
TBDClust: time-based density clustering to enable free browsing of sites in pay-per-use mobile Internet providers
(Elsevier, 2017) Torres García, Luis Miguel; Magaña Lizarrondo, Eduardo; Morató Osés, Daniel; García-Jiménez, Santiago; Izal Azcárate, Mikel; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación
The World Wide Web has evolved rapidly, incorporating new content types and becoming more dynamic. The contents from a website can be distributed between several servers, and as a consequence, web traffic has become increasingly complex. From a network traffic perspective, it can be difficult to ascertain which websites are being visited by a user, let alone which part of the user's traffic each website is responsible for. In this paper we present a method for identifying the TCP connections involved in the same full webpage download without the need of deep packet inspection. This identification is needed for example to enable free browsing of specific websites in a pay per use mobile Internet access. It could be not only for third party promoted websites but also portals to gubernamental or medical emergency websites. The proposal is based on a modification of the DBSCAN clustering algorithm to work online and over one-dimensional sorted data. In order to validate our results we use both real traffic and packet captures from a controlled environment. The proposal achieves excellent results in consistency (99%) and completeness (92%), meaning that its error margin identifying the webpage downloads is minimal.
Open Access
Unbalanced interval-valued OWA operators
(Springer Berlin Heidelberg, 2016) Miguel Turullols, Laura de; Bustince Sola, Humberto; Barrenechea Tartas, Edurne; Pagola Barrio, Miguel; Fernández Fernández, Francisco Javier; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación
In this work, we introduce a new class of functions defned on the interval-valued setting. These functions extend classical OWA operators but allow for diferent weighting vectors to handle the lower bounds and the upper bounds of the considered intervals. As a consequence, the resulting functions need not be an interval-valued aggregation function, so we study, in the case of the lexicographical order, when these operators give an interval as output and are monotone. We also discuss an illustrative example on a decision making problem in order to show the usefulness of our developments.

Browse

Browsing Dpto. Automática y Computación - Automatika eta Konputazioa Saila by Department/Institute "Institute of Smart Cities - ISC"

Results Per Page

Sort Options