Skip to main content
SpringerLink
Log in

Comparing f β -Optimal with Distance Based Merge Functions

  • Conference paper
Flexible Query Answering Systems (FQAS 2013)

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

Included in the following conference series:

  • 1336 Accesses

Abstract

Merge functions informally combine information from a certain universe into a solution over that same universe. This typically results in a, preferably optimal, summarization. In previous research, merge functions over sets have been looked into extensively. A specific case concerns sets that allow elements to appear more than once, multisets. In this paper we compare two types of merge functions over multisets against each other. We examine both general properties as practical usability in a real world application.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.: A framework for multiset merging. Fuzzy Sets and Systems 191, 1–20 (2012)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. Bronselaer, A., De Tré, G., Van Britsom, D.: Multiset merging: The majority rule. In: Melo-Pinto, P., Couto, P., Serôdio, C., Fodor, J., De Baets, B. (eds.) Eurofuse 2011. AISC, vol. 107, pp. 279–292. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

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

    Google Scholar 

  5. van Rijsbergen, C.J.: Information Retrieval. Butterworths, London (1979)

    Google Scholar 

  6. Bronselaer, A., Van Britsom, D., De Tré, G.: Robustness of multiset merge functions. In: Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R.R. (eds.) IPMU 2012, Part I. CCIS, vol. 297, pp. 481–490. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  7. Van Britsom, D., Bronselaer, A., De Tré, G.: Automatically generating multi-document summarizations. In: Proceedings of the 11th International Conference on Intelligent Systems Design and Applications, pp. 142–147. IEEE (2011)

    Google Scholar 

  8. Van Britsom, D., Bronselaer, A., De Tré, G.: Concept identification in constructing multi-document summarizations. In: Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R.R. (eds.) IPMU 2012, Part II. CCIS, vol. 298, pp. 276–284. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Telecommunications and Information Processing, Ghent University, Sint-Pietersnieuwstraat 41, B-9000, Ghent, Belgium

    Daan Van Britsom, Antoon Bronselaer & Guy De Tré

Authors
  1. Daan Van Britsom
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antoon Bronselaer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guy De Tré
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electronic Systems, Aalborg University, 6700, Esbjerg, Denmark

    Henrik Legind Larsen

  2. Department of Computer Science and Artificial Intelligence, University of Granada, 18071, Granada, Spain

    Maria J. Martin-Bautista

  3. Department of Computer Science and Arificial IntelIigence, University of Granada, 18071, Granada, Spain

    María Amparo Vila

  4. CBIT, Roskilde University, Universitetsvej 1, 4000, Roskilde, Denmark

    Troels Andreasen

  5. CBIT, Roskilde University, 4000, Roskilde, Denmark

    Henning Christiansen

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Van Britsom, D., Bronselaer, A., De Tré, G. (2013). Comparing f β -Optimal with Distance Based Merge Functions. In: Larsen, H.L., Martin-Bautista, M.J., Vila, M.A., Andreasen, T., Christiansen, H. (eds) Flexible Query Answering Systems. FQAS 2013. Lecture Notes in Computer Science(), vol 8132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40769-7_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40769-7_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40768-0

  • Online ISBN: 978-3-642-40769-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation