Skip to main content

Aggregation Operators on Shadowed Sets Deriving from Conditional Events and Consensus Operators

  • Conference paper
  • First Online:
Rough Sets (IJCRS 2023)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 14481))

Included in the following conference series:

  • 174 Accesses

Abstract

We introduce particular aggregation operators on shadowed sets, which derive from the operations between conditional events and from the consensus operator. Considering that shadowed sets arise as approximations of fuzzy sets, we also present and study special classes of aggregation functions that can be approximated by the considered operations on shadowed sets.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    We indicate such operations with the symbols \(*_{15}, \ldots , *_{21}\) since other operations \(*_1, \ldots , *_{14}\) are already defined on shadowed sets in [2].

  2. 2.

    The function \(f \otimes g \in [0,1]^X\) is defined as follows: \((f \otimes g)(x)=f(x) \otimes g(x)\) for each \(x \in X\). Similarly, the function \(\mathcal {S}_{(\alpha ,\beta )}(f) * \mathcal {S}_{(\alpha ,\beta )}(g) \in \{0,[0,1],1\}^X\) is defined as follows: \((\mathcal {S}_{(\alpha ,\beta )}(f) * \mathcal {S}_{(\alpha ,\beta )}(g))(x)=\mathcal {S}_{(\alpha ,\beta )}(f)(x) * \mathcal {S}_{(\alpha ,\beta )}(g)(x)\) for each \(x \in X\).

  3. 3.

    \(\otimes _M\) and \(\oplus _M\) are defined as follows: \(x \otimes _M y= \min (x,y)\) and \(x \oplus _M y=\max (x,y)\), for each \(x,y \in [0,1]\) [19].

References

  1. Bochvar, D.A., Bergmann, M.: On a three-valued logical calculus and its application to the analysis of the paradoxes of the classical extended functional calculus. Hist. Philos. Logic 2(1–2), 87–112 (1981)

    Article  MathSciNet  Google Scholar 

  2. Boffa, S., Campagner, A., Ciucci, D., Yao, Y.: Aggregation operators on shadowed sets. Inf. Sci. 595, 313–333 (2022)

    Article  Google Scholar 

  3. Campagner, A., Dorigatti, V., Ciucci, D.: Entropy-based shadowed set approximation of intuitionistic fuzzy sets. Int. J. Intell. Syst. 35(12), 2117–2139 (2020)

    Article  Google Scholar 

  4. Casillas, J., Cordón, O., Triguero, F.H., Magdalena, L. (eds.): Interpretability Issues in Fuzzy Modeling. Studies in Fuzziness and Soft Computing, vol. 128. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-540-37057-4

  5. Ciucci, D.: Orthopairs: a simple and widely usedway to model uncertainty. Fund. Inf. 108(3–4), 287–304 (2011)

    MathSciNet  Google Scholar 

  6. Ciucci, D.: Orthopairs and granular computing. Granular Comput. 1(3), 159–170 (2016)

    Article  Google Scholar 

  7. Ciucci, D., Dubois, D., Lawry, J.: Borderline vs. unknown: comparing three-valued representations of imperfect information. Int. J. Approx. Reason. 55(9), 1866–1889 (2014)

    Google Scholar 

  8. Deng, X., Yao, Y.: Mean-value-based decision-theoretic shadowed sets. In: 2013 Joint IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS), pp. 1382–1387. IEEE (2013)

    Google Scholar 

  9. Fodor, J.: Aggregation functions in fuzzy systems. In: Aspects of Soft Computing, Intelligent Robotics and Control, pp. 25–50. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03633-0_2

  10. Gao, M., Zhang, Q., Zhao, F., Wang, G.: Mean-entropy-based shadowed sets: a novel three-way approximation of fuzzy sets. Int. J. Approx. Reason. 120, 102–124 (2020)

    Article  MathSciNet  Google Scholar 

  11. He, S., Pan, X., Wang, Y.: A shadowed set-based todim method and its application to large-scale group decision making. Inf. Sci. 544, 135–154 (2021)

    Article  MathSciNet  Google Scholar 

  12. Ibrahim, M., William-West, T., Kana, A., Singh, D.: Shadowed sets with higher approximation regions. Soft. Comput. 24, 17009–17033 (2020)

    Article  Google Scholar 

  13. Kleene, S.C., De Bruijn, N., de Groot, J., Zaanen, A.C.: Introduction to metamathematics, vol. 483. van Nostrand New York (1952)

    Google Scholar 

  14. Lawry, J., Dubois, D.: A bipolar framework for combining beliefs about vague propositions. In: Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning, pp. 530–540 (2012)

    Google Scholar 

  15. Mitra, S., Pedrycz, W., Barman, B.: Shadowed c-means: integrating fuzzy and rough clustering. Pattern Recogn. 43(4), 1282–1291 (2010)

    Article  Google Scholar 

  16. Pedrycz, W.: Shadowed sets: representing and processing fuzzy sets. IEEE Trans. Syst. Man Cybern. - PART B: Cybern. 28(1), 103–109 (1998)

    Article  Google Scholar 

  17. Pedrycz, W.: From fuzzy sets to shadowed sets: interpretation and computing. Int. J. Intell. Syst. 24(1), 48–61 (2009)

    Article  Google Scholar 

  18. Pedrycz, W., Vukovich, G.: Granular computing with shadowed sets. Int. J. Intell. Syst. 17(2), 173–197 (2002)

    Article  Google Scholar 

  19. Schweizer, B., Sklar, A.: Espaces métriques aléatories. Comptes Rendus Hebdomadaires des Seances de l’Academie des Sciences 247(23), 2092–2094 (1958)

    Google Scholar 

  20. Sobociński, B.: Axiomatization of a partial system of three-value calculus of propositions. Institute of Applied Logic (1952)

    Google Scholar 

  21. Tahayori, H., Sadeghian, A., Pedrycz, W.: Induction of shadowed sets based on the gradual grade of fuzziness. IEEE Trans. Fuzzy Syst. 21(5), 937–949 (2013)

    Article  Google Scholar 

  22. Torra, V., Narukawa, Y.: Modeling Decisions: Information Fusion and Aggregation Operators. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-68791-7

    Book  Google Scholar 

  23. Walker, E.A.: Stone algebras, conditional events, and three valued logic. IEEE Trans. Syst. Man Cybern. 24(12), 1699–1707 (1994)

    Article  MathSciNet  Google Scholar 

  24. William-West, T., Ibrahim, A., Kana, A.: Shadowed set approximation of fuzzy sets based on nearest quota of fuzziness. Ann. Fuzzy Math. Inf. 4(1), 27–38 (2019)

    MathSciNet  Google Scholar 

  25. Yager, R.R., Rybalov, A.: Uninorm aggregation operators. Fuzzy Sets Syst. 80(1), 111–120 (1996)

    Article  MathSciNet  Google Scholar 

  26. Yao, Y., Wang, S., Deng, X.: Constructing shadowed sets and three-way approximations of fuzzy sets. Inf. Sci. 412, 132–153 (2017)

    Article  MathSciNet  Google Scholar 

  27. Zhou, J., Pedrycz, W., Gao, C., Lai, Z., Yue, X.: Principles for constructing three-way approximations of fuzzy sets: a comparative evaluation based on unsupervised learning. Fuzzy Sets Syst. 413, 74–98 (2020)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stefania Boffa .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Boffa, S., Campagner, A., Ciucci, D., Yao, Y. (2023). Aggregation Operators on Shadowed Sets Deriving from Conditional Events and Consensus Operators. In: Campagner, A., Urs Lenz, O., Xia, S., Ślęzak, D., Wąs, J., Yao, J. (eds) Rough Sets. IJCRS 2023. Lecture Notes in Computer Science(), vol 14481. Springer, Cham. https://doi.org/10.1007/978-3-031-50959-9_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-50959-9_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-50958-2

  • Online ISBN: 978-3-031-50959-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics