DSpace Collection:
http://hdl.handle.net/10261/1195
20160525T01:35:08Z

Aggregation operators
http://hdl.handle.net/10261/132431
Title: Aggregation operators
Authors: Torra, Vicenç
Abstract: It was in 1990, when I was still studying my degree in Computer Science, when I met Prof. Lotfi Zadeh for the first time, if I do not remember wrongly. It was in a conference I was participating in Barcelona where he gave one of the plenary talks. I remember clearly that he mentioned fuzzy systems and the successful Japanese applications of the late 80es. I have always used the applications of fuzzy systems in class as an example of successful applications of artificial intelligence and related technologies. © 2013 SpringerVerlag Berlin Heidelberg.
20160519T17:35:01Z

Assistive Awareness in Smart Grids
http://hdl.handle.net/10261/131946
Title: Assistive Awareness in Smart Grids
Authors: Bourazeri, Aikaterini; Almajano, Pablo; Rodriguez, Inmaculada; LópezSánchez, Maite
20160510T17:17:38Z

GeneralizationBased kAnonymization
http://hdl.handle.net/10261/131114
Title: GeneralizationBased kAnonymization
Authors: Armengol, Eva; Torra, Vicenç
Abstract: Microaggregation is an anonymization technique consisting on partitioning the data into clusters no smaller than k elements and then replacing the whole cluster by its prototypical representant. Most of microaggregation techniques work on numerical attributes. However, many data sets are described by heterogeneous types of data, i.e., nu merical and categorical attributes. In this paper we propose a new mi croaggregation method for achieving a compliant kanonymous masked file for categorical microdata based on generalization. The goal is to build a generalized description satisfied by at least k domain objects and to replace these domain objects by the description. The way to construct that generalization is similar that the one used in growing decision trees. Records that cannot be generalized satisfactorily are discarded, therefore some information is lost. In the experiments we performed we prove that the new approach gives good results. © Springer International Publishing Switzerland 2015.
20160414T16:30:44Z

The Complexity of 3Valued Lukasiewicz Rules
http://hdl.handle.net/10261/130972
Title: The Complexity of 3Valued Lukasiewicz Rules
Authors: Bofill, Miquel; Manyà, Felip; Vidal, Amanda; Villaret, Mateu
Abstract: It is known that determining the satisfiability of nvalued Łukasiewicz rules is NPcomplete for n ≥ 4, as well as that it can be solved in time linear in the length of the formula in the Boolean case (when n = 2). However, the complexity for n = 3 is an open problem. In this paper we formally prove that the satisfiability problem for 3valued Łukasiewicz rules is NPcomplete. Moreover, we also prove that when the consequent of the rule has at most one element, the problem is polynomially solvable. © Springer International Publishing Switzerland 2015.
20160411T16:05:48Z