On the Aggregation of n-distances

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This work deals with the aggregation of n-distances and S-generalized n-distances. The necessary conditions that a function has to satisfy to aggregate a collection of n-distances (respectively, S-generalized n-distances) into a new n-distance (respectively, S-generalized n-distance) are given. The last distances are introduced and discussed, in this work, as a generalization of the first ones. We also provide some relationship between both classes of distances. Moreover, we present several equivalent relations between an S-generalized n-distance and a new type of n-T-indisguishability operator.

Cite

CITATION STYLE

APA

Calvo Sánchez, T., & Fuster-Parra, P. (2022). On the Aggregation of n-distances. In Communications in Computer and Information Science (Vol. 1601 CCIS, pp. 47–59). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-08971-8_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free