{'fraction_non_alphanumeric': 0.03035878564857406, 'fraction_numerical': 0.0, 'mean_word_length': 4.666666666666667, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Weak Preservation of Multi-Valued Fusion

Fusion functions are important data integration tools that map a multiset of objects (i.e., the sources) onto a single object (i.e., the solution). Traditionally, it is assumed that the objects of interest are single-valued. In this paper, it will be assumed that each object has a multi-valued data structure, leading to a framework of second order fusion functions. An important class of such functions is called preservative and is characterized by the fact that one of the input objects is returned. A disadvantage of these functions is the a-priori limitation of the output space to the input objects. It is investigated here how this disadvantage can be mitigated by studying the principle of weak-preservation. The main idea is hereby that, instead of preserving one of the sources, a characteristic feature of one of the sources is preserved. Three such features will be studied: cardinality, k-cut and multiplicity distribution. It will then be shown how weak-preservation can be utilized in the design of second order fusion functions.