232 research outputs found
Aggregating fuzzy subgroups and T-vague groups
Fuzzy subgroups and T-vague groups are interesting fuzzy algebraic structures that have been widely studied. While fuzzy subgroups fuzzify the concept of crisp subgroup, T-vague groups can be identified with quotient groups of a group by a normal fuzzy subgroup and there is a close relation between both structures and T-indistinguishability operators (fuzzy equivalence relations).
In this paper the functions that aggregate fuzzy subgroups and T-vague groups will be studied. The functions aggregating T-indistinguishability operators have been characterized [9] and the main result of this paper is that the functions aggregating T-indistinguishability operators coincide with the ones that aggregate fuzzy subgroups and T-vague groups. In particular, quasi-arithmetic means and some OWA operators aggregate them if the t-norm is continuous Archimedean.Peer ReviewedPostprint (author's final draft
Approximation of proximities by aggregating T-indistinguishability operators
For a continuous Archimedean t-norm T a method to approximate a proximity relation R (i.e. a reflexive and symmetric fuzzy relation) by a T-transitive one is provided.
It consists of aggregating the transitive closure R of R with a (maximal) T-transitive relation B contained in R using a suitable weighted quasi-arithmetic mean to maximize the similarity or minimize the distance to R.Peer Reviewe
Aggregating T-equivalence relations
This contribution deals with the problem of aggregating Tequivalence relations, in the sense that we are looking for functions that preserve reflexivity, symmetry, and transitivity with respect to a given t-norm T. We obtain a complete description of those functions in terms of that we call T-triangular triplets. Any extra condition on the t-norm is assumed.Postprint (published version
Finding close T-indistinguishability operators to a given proximity
Two ways to approximate a proximity relation R (i.e. a reflexive and symmetric fuzzy relation) by a T-transitive one where T is a continuous archimedean t-norm are given. The first one aggregates the transitive closure R of R with a (maximal) T-transitive relation B contained in R. The second one modifies the values of R or B to better fit them with the ones of R.Peer ReviewedPostprint (published version
T-generable indistinguishability operators and their use for feature selection and classification.
Peer ReviewedPostprint (author's final draft
Reduction of attributes in averaged similarities
Similarity Relations may be constructed from a set of fuzzy attributes. Each fuzzy attribute generates a simple similarity, and these simple similarities are combined into a complex similarity afterwards. The Representation Theorem establishes one such way of combining similarities, while averaging them is a different and more realistic approach in applied domains. In this paper, given an averaged similarity by a family of attributes, we propose a method to find families of new attributes having fewer elements that generate the same similarity. More generally, the paper studies the structure of this important class of fuzzy relations.Peer ReviewedPostprint (author's final draft
XYZ Privacy
Future autonomous vehicles will generate, collect, aggregate and consume
significant volumes of data as key gateway devices in emerging Internet of
Things scenarios. While vehicles are widely accepted as one of the most
challenging mobility contexts in which to achieve effective data
communications, less attention has been paid to the privacy of data emerging
from these vehicles. The quality and usability of such privatized data will lie
at the heart of future safe and efficient transportation solutions.
In this paper, we present the XYZ Privacy mechanism. XYZ Privacy is to our
knowledge the first such mechanism that enables data creators to submit
multiple contradictory responses to a query, whilst preserving utility measured
as the absolute error from the actual original data. The functionalities are
achieved in both a scalable and secure fashion. For instance, individual
location data can be obfuscated while preserving utility, thereby enabling the
scheme to transparently integrate with existing systems (e.g. Waze). A new
cryptographic primitive Function Secret Sharing is used to achieve
non-attributable writes and we show an order of magnitude improvement from the
default implementation.Comment: arXiv admin note: text overlap with arXiv:1708.0188
On the relationship between fuzzy subgroups and indistinguishability operators
Fuzzy subgroups are revisited considering their close relationship with indistinguishability operators (fuzzy equivalences) invariant under translations. Different ways to obtain new fuzzy subgroups from a given one are provided and different ways to characterize normal fuzzy subgroups are obtained. The idea of double coset of two (crisp) subgroups allow us to relate them via their equivalence classes. This is generalized to the fuzzy framework. The conditions in which a fuzzy relation R on a group G can be considered a fuzzy subgroup of G Ă— G are obtained.Peer ReviewedPostprint (author's final draft
Aggregation of L-probabilistic quasi-uniformities
[EN] The problem of aggregating fuzzy structures, mainly fuzzy binary relations, has deserved a lot of attention in the last years due to its application in several fields. Here, we face the problem of studying which properties must satisfy a function in order to merge an arbitrary family of (bases of) L-probabilistic quasi-uniformities into a single one. These fuzzy structures are special filters of fuzzy binary relations. Hence we first make a complete study of functions between partially-ordered sets that preserve some special sets, such as filters. Afterwards, a complete characterization of those functions aggregating bases of L-probabilistic quasi-uniformities is obtained. In particular, attention is paid to the case L={0,1}, which allows one to obtain results for functions which aggregate crisp quasi-uniformities. Moreover, we provide some examples of our results including one showing that Lowen's functor iota which transforms a probabilistic quasi-uniformity into a crisp quasi-uniformity can be constructed using this aggregation procedure.J. Rodriguez-Lopez acknowledges financial support from FEDER/Ministerio de Ciencia, Innovacion y Universidades-Agencia Estatal de Investigacion Proyecto PGC2018-095709-B-C21.Pedraza Aguilera, T.; RodrĂguez LĂłpez, J. (2020). Aggregation of L-probabilistic quasi-uniformities. Mathematics. 8(11):1-21. https://doi.org/10.3390/math8111980S12181
- …