Skip to main content

Robustness of Multiset Merge Functions

  • Conference paper
Book cover Advances on Computational Intelligence (IPMU 2012)

Abstract

Database integration is the problem of combining information spread over several data sources into one source. The possible presence of duplicate and/or inconsistent information makes this problem extremely challenging. In an earlier contribution on this topic, a framework of merge functions has been defined and applied in the case of (multi)sets. As a result, f-optimal merge functions have been defined as a family of merge functions for multisets that maximize an adapted version of the well-known f-value. Although some properties of this family have been identified in previous work, the ongoing study of additional properties is important to gain insight in both the problem of multiset merging and the characteristics of the f-optimal family. This paper contributes by defining and investigating several notions of robustness.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bronselaer, A., Van Britsom, D., De Tré, G.: Multiset merging: the majority rule. In: Proceedings of the EUROFUSE Conference, Regua, Portugal, pp. 279–292 (2011)

    Google Scholar 

  2. Bronselaer, A., Van Britsom, D., De Tré, G.: A framework for multiset merging. Fuzzy Sets and Systems (in press)

    Google Scholar 

  3. Bronselaer, A., De Tré, G.: Aspects of object merging. In: Proceedings of the NAFIPS Conference, Toronto, Canada, pp. 27–32 (2010)

    Google Scholar 

  4. Rojas, K., Gómez, D., Rodríguez, T., Montero, J.: Some properties of consistency in the families of aggregation operators. In: Proceedings of the EUROFUSE Conference, Regua, Portugal, pp. 169–176 (2011)

    Google Scholar 

  5. Baeza-Yates, R., Ribeiro-Neto, B.: Modern information retrieval. ACM Press (1999)

    Google Scholar 

  6. Yager, R.: On the theory of bags. International Journal of General Systems 13(1), 23–27 (1986)

    Article  MathSciNet  Google Scholar 

  7. Calvo, T., Kolesárová, A., Komorníková, M., Mesiar, R.: Aggregation Operators, properties, classes and construction methods. In: Aggregation Operators New Trends and Applications, pp. 3–104. Physica-Verlag, Heidelberg (2002)

    Google Scholar 

  8. Calvo, T., Mesiar, R.: Stability of aggregation operators. In: Proceedings of the EUSFLAT Conference, Leicester, United Kingdom, pp. 475–478 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bronselaer, A., Van Britsom, D., De Tré, G. (2012). Robustness of Multiset Merge Functions. In: Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R.R. (eds) Advances on Computational Intelligence. IPMU 2012. Communications in Computer and Information Science, vol 297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31709-5_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31709-5_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31708-8

  • Online ISBN: 978-3-642-31709-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics