Fuzzy preorders and generalized distances: The aggregation problem revisited

González-Hedström, J.D.D.; Miñana, J.J.; Valero, O.

doi:10.1016/j.fss.2023.108760

Fuzzy Sets and Systems

2024

DOI: 10.1016/j.fss.2023.108760

|View full text |Cite

Fuzzy preorders and generalized distances: The aggregation problem revisited

J.D.D. González-Hedström,

J.J. Miñana,

O. Valero

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 51 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Modular relaxed indistinguishability and the aggregation problem

Bibiloni-Femenias,

Valero

2024

MATH

View full text Add to dashboard Cite

<p>The notion of indistinguishability operator plays a central role in a large number of problems that arise naturally in decision-making, artificial intelligence, and computer science. Among the different issues studied for these operators, the aggregation problem has been thoroughly explored. In some cases, the notion of indistinguishability operator can be too narrow and, for this reason, we can find two different extensions of such notion in the literature. On the one hand, modular indistinguishability operators make it possible to measure the degree of similarity or indistinguishability with respect to a parameter. On the other hand, relaxed indistinguishability operators delete the reflexivity condition of classical indistinguishability operators. In this paper, we introduced the notion of modular relaxed indistinguishability operator unifying under the same framework all previous notions. We focused our efforts on the study of the associated aggregation problem. Thus, we introduced the notion of modular relaxed indistinguishability operator aggregation function for a family of t-norms extending the counterpart formulated for classical non-modular relaxed indistinguishability operators. We provided characterizations of such functions in terms of triangle triplets with respect to a family of t-norms. Moreover, we addressed special cases where the operators fulfill a kind of monotony and a condition called small-self indistinguishability. The differences between the modular and the non-modular aggregation problem were specified and illustrated by means of suitable examples.</p>

show abstract

Modular relaxed indistinguishability and the aggregation problem

Bibiloni-Femenias,

Valero

2024

MATH

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Fuzzy preorders and generalized distances: The aggregation problem revisited

Cited by 1 publication

References 51 publications

Modular relaxed indistinguishability and the aggregation problem

Modular relaxed indistinguishability and the aggregation problem

Contact Info

Product

Resources

About