[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

On Two Generalizations for k-Additivity

  • Conference paper
  • First Online:
Modeling Decisions for Artificial Intelligence (MDAI 2021)

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

Abstract

There are two generalizations for k-additive set functions: constructive k-additivity and formulaic k-additivity. We study some properties around these concepts and their relations. A constructively k-additive set function is always formulaic k-additive. For a distorted measure, these two concepts are equivalent. Under certain conditions of “bounded variation” and “continuity at the \(\emptyset \),” we prove the constructive k-additivity for a formulaic k-additive set function.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 59.99
Price includes VAT (United Kingdom)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 74.99
Price includes VAT (United Kingdom)
  • 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

Similar content being viewed by others

References

  1. Grabisch, M.: \(k\)-order additive discrete fuzzy measures and their representation. Fuzzy Sets Syst. 92, 167–189 (1997)

    Article  MathSciNet  Google Scholar 

  2. Combarro, E.F., Miranda, P.: On the structure of the k-additive fuzzy measures. Fuzzy Sets Syst. 161(17), 2314–2327 (2010)

    Article  MathSciNet  Google Scholar 

  3. Kolesarova, A., Li, J., Mesiar, R.: k-additive aggregation functions and their characterization. Eur. J. Oper. Res. 265, 985–992 (2018)

    Article  MathSciNet  Google Scholar 

  4. Mesiar, R.: Generalizations of k-order additive discrete fuzzy measures. Fuzzy Sets Syst. 102, 423–428 (1999)

    Article  MathSciNet  Google Scholar 

  5. Fukuda, R., Honda, A., Okazaki, Y.: Constructive k-additive measure and decreasing convergence theorems. In: Torra, V., Narukawa, Y., Nin, J., Agell, N. (eds.) MDAI 2020. LNCS (LNAI), vol. 12256, pp. 104–116. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-57524-3_9

    Chapter  Google Scholar 

  6. Honda, A., Fukuda, R., Okazaki, Y.: Non-discrete \(k\)-order additivity of a set function and distorted measure. Fuzzy Sets Syst. (to appear)

    Google Scholar 

  7. Tao, T.: An Introduction to Measure Theory. Graduate Studies in Mathematics, American Mathematical Society, Providence (2011)

    Book  Google Scholar 

  8. Neveu, J.: Mathematical Foundations of the Calculus of Probability. Holden-Day Series in Probability and Statistics, Holden-Day, San Francisco (1965)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ryoji Fukuda .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Fukuda, R., Honda, A., Okazaki, Y. (2021). On Two Generalizations for k-Additivity. In: Torra, V., Narukawa, Y. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2021. Lecture Notes in Computer Science(), vol 12898. Springer, Cham. https://doi.org/10.1007/978-3-030-85529-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-85529-1_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-85528-4

  • Online ISBN: 978-3-030-85529-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics