# OMFM: A Framework of Object Merging Based on Fuzzy Multisets

Authors: Lin Yue; Wanli Zuo; Lizhou Feng; Lin Guo
Journal: Mathematical Problems in Engineering
 (2014)

---

## Abstract

Information fusion is a process of merging information from multiple sources into a new set of information. Existing work on information fusion is applicable in various scenarios such as multiagent system, group decision making, and multidocument summarization. This paper intends to develop an effective framework to solve object merging problem based on fuzzy multisets. The objects defined in this paper are data segments in document fusion task, referring to the concepts with semantic-related terms of different semantic relations embedded. The fundamental operation is the merge function mapping data segments in multiple fuzzy multisets onto one object, which is a solution. Under this framework, we define quality measures of purity and entropy to quantify the quality of the solutions, balancing accurateness, and completeness of the results. Merge function that yields this kind of solutions is VI-optimal merge function and a series of theoretical properties concerning it are studied. Finally, we investigate the proposed framework in a special application scenario (i.e., document fusion) which is related to the task of multidocument summarization and show how the framework works with illustrative example.


---

## Body

## 1. Introduction

As an important research area, information fusion is a process of merging information from multiple sources into a new set of information. There are many applications in this research area such as heterogeneous database, multiagent system, group decision making, and multidocument summarization. Under different application scenarios, different principles and procedures are utilized to solve the problems. Many classical mathematical theories of aggregation operators [1–5] have been developed for multiagent system and group decision making system, and the information that aggregation operators try to fuse typically expresses facts of opinion or score of an agent. Besides these researches, a fair amount of work focused on the situation where the source is regarded as a propositional belief [6–8]. The existence of nonfactual knowledge like integrity constraints and inference rules makes the difference between these two theories. As a result, a lot of work has been done in the heterogeneous database area on first-order theory. Another type of fusion is that each source presents knowledge by means of a possibility distribution [9], in this case, the imperfection of incorrectness, uncertainty, and incompleteness in the data should be coped with. The main challenge is how to deal with conflicting information provided by different sources.To address the issues in the third type of fusion, a framework of object merging has been investigated by using multiset theory currently, which could be utilized to solve the problem of multidocument summarization (MDS) [10]. Also, object merging is a hot spot of research in many domains with good prospect for application. The framework of multiset merging for MDS has defined the merge function which maps the objects in multisets onto a single object and has got some foregoing results which cannot be considered as a final summarization yet [11, 12], owing to the fact that these foregoing results are just some keywords without any relation among them, not mention to context of co-text, context of culture, context of situation, and so forth. The essential reason for this result is that the framework defined the quality measures with the multiplicity of element as the measure of important element. In other words, the multiplicity is equal to term frequency which is just shallow text feature. When performing source selection in MDS, the traditional method transformed one document into the representation of a vector of words or a multiset of words, which are just simple settings. Other progressive approaches should be proposed, which are semantically richer than using words as source representation. In short, the problem of processing coreferent objects has not been deeply investigated at present. On one hand, merging of nonquantitative objects, especially the objects with semantic information, has not been proposed. On the other hand, object merging functions and the rationality of merging still need to be further investigated.Within the scope of our paper, we also focus on the problem of object merging in information fusion, and our work should be treated as an extension of the framework mentioned hereinbefore. There are many differences between these two works. The basic difference concerning the definition of coreferent objects: coreferent objects in paper [11] are the objects describing the same entity in the real world, while in our paper the object we’re discussing is a piece of data or information, which could be used to denote the same concept with semantic-related terms of different semantic relations embedded. Then, fuzzy multiset theory is investigated in our paper, in which membership degree function and length function are used to describe both uncertainty and repeatability of the natural language. When performing fusion in practical situations, the object merging process has considered deep text features of semantic relations such as hypernym, synonym, and antonym. Moreover, two quality measures (purity [13] and entropy [14, 15]) widely used in the text mining literature are adopted to quantify the result of a merge function. Thus, the behavior of the merge functions we defined in this paper can be characterized by the behavior of the quality measures. With this strategy, we can get an optimal merge result. The possible application of this work is document fusion [16], where a collection of textual documents is used to produce the shortest description containing all information found within the document set, but without repetition. Existing solutions for this problem normally focused on statistical methods or heuristics methods used in multidocument summarization [17, 18]. In this paper, object merging based on fuzzy multisets (OMFM) is definitely a meaningful attempt, where a source set of multiple documents is denoted as a multiset and each document is denoted as a fuzzy multiset of multiple concepts.This paper is organized as follows. In Section2, we review mathematical preliminaries. Furthermore, the general framework of objects and object merging are proposed in Section 3, and definition of the quality measures and construction of merge functions are introduced in Section 4. Next, demonstration about how our framework works on practical problem (i.e., document fusion) with illustrative example is presented in Section 5. Finally, in Section 6, we give the conclusion and future work to the proposed framework OMFM.


## 2. Preliminaries

In mathematics, fuzzy set introduced by Zadeh in 1965 is set whose elements have degrees of membership which is an extension of the classical notion of set [19, 20]. Fuzzy set theory is very useful to deal with problems that are not easily handled by classical computing techniques. On the other hand, the use of membership degrees instead of real numbers to represent memberships also provides a mean to measure the possible uncertainty in languages computational theory. The notion of multiset is a generalization of the classical notion of set in which members are allowed to appear more than once. As a data structure, multiset stands in between strings where a linear ordering of symbols is presented and sets where no ordering is considered. Combined with the notion of fuzzy set, multiset is generalized to fuzzy multiset [21], which could describe both uncertainty and repeatability of the natural language. Consider one language modeling problem: given some sentences, identify the concepts and words which are similar or identical, and merge these objects to get a condensed description. This task is a challenging natural language problem with large amounts of diverse and compositional data. To solve this problem, we extend fuzzy multiset to produce a language model which maps data segments in multiple fuzzy multisets onto one object, where different semantic relations for one concept are treated as repeated elements with different membership degree in fuzzy multisets. In this section, mathematical theories of fuzzy set, multiset, and fuzzy multiset will be briefly reviewed.Definition 1 (membership function).
The membership functionμ
A
:
U
→
[
0,1
] indicates the degree of u belonging to A. μ
A
(
u
)
=
1 indicates that element u completely belongs to set A; that is, u
∈
A is the concept of traditional set.Definition 2 (fuzzy set).
The membership function overU
=
u
1
,
u
2
,
…
,
u
n defines a fuzzy set, which is represented as A. Fuzzy set A with elements u
1
,
u
2
,
…
,
u
n can be denoted as A
=
u
i
,
μ
A
u
i
∣
u
i
∈
U.
According to the definition of fuzzy set, to what extent an object belongs to a set is not fixed any more, and the membership of each object falls in the range of interval[
0
,
1
].


### 2.1. Multiset

Definition 3 (multiset).
A multisetM over the universe U
=
{
u
1
,
u
2
,
…
,
u
n
} is defined as M
=
{
k
1
/
u
1
,
k
2
/
u
2
,
…
,
k
n
/
u
n
}, where k
i
=
Count
M
(
u
i
)
,
u
i
∈
U. For u
i
∈
U, Count
M
(
u
i
) denotes the multiplicity of u
i in M.
The cardinality of a multisetM is given by M
=
∑
u
i
∈
U
Count
M
(
u
i
) [22].
A multisetM also could be denoted as M
=
u
1
,
u
1
,
…
,
u
1
︷
k
1
,
u
2
,
u
2
,
…
,
u
2
︷
k
2
,
…
,
u
n
,
u
n
,
…
,
u
n
︷
k
n. The set of all multisets drawn from a universe U is denoted as M
(
U
).There are some basic operators and relations of multiset below:Inclusion:(1)
M
(
P
)
⊆
M
(
Q
)
⟺
Count
M
(
P
)
(
u
)
≤
Count
M
(
Q
)
(
u
)
,
lllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllll
∀
u
∈
U
.
Equality:(2)
M
(
P
)
=
M
(
Q
)
⟺
Count
M
(
P
)
(
u
)
=
Count
M
(
Q
)
(
u
)
,
lllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllll
∀
u
∈
U
.
Intersection:(3)
Count
(
M
(
P
)
∩
M
(
Q
)
)
(
u
)
=
min
⁡
{
Count
M
(
P
)
(
u
)
,
Count
M
(
Q
)
(
u
)
}
,
lllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllll
∀
u
∈
U
.
Union:(4)
Count
(
M
(
P
)
∪
M
(
Q
)
)
(
u
)
=
max
⁡
{
Count
M
(
P
)
(
u
)
,
Count
M
(
Q
)
(
u
)
}
,
lllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllll
∀
u
∈
U
.
Addition:(5)
Count
(
M
(
P
)
⊕
M
(
Q
)
)
(
u
)
=
Count
M
(
P
)
(
u
)
+
Count
M
(
Q
)
(
u
)
,
lllllllllllllllllllllllllllllllllllllllllllllllllllllllllllillllllllll
∀
u
∈
U
.Definition 4 (k-cut set of multiset).
Thek-cut set of a multiset M is denoted as M
k and given by M
k
=
{
u
∣
u
∈
U
∧
Count
M
(
u
)
≥
k
}.
Note that the difference between the notationM
(
k
) and M
k is that the former one means assigning an index k to the multiset M and the latter one means the k-cut set of the multiset M [23].


### 2.2. Fuzzy Multiset

Combined with the concept of fuzzy set, the traditional concept of multiset could be denoted as(6)
M
~
=
μ
M
~
1
u
1
u
1
,
μ
M
~
2
u
1
u
1
,
…
,
μ
M
~
k
1
u
1
u
1
︷
k
1
,
llllllll
μ
M
~
1
u
2
u
2
,
μ
M
~
2
u
2
u
2
,
…
,
μ
M
~
k
2
u
2
u
2
︷
,
k
2
…
,
llllllll
μ
M
~
1
u
n
u
n
,
μ
M
~
2
u
n
u
n
,
…
,
μ
M
~
k
n
u
n
u
n
︷
k
n
,
where μ
M
~
j
u
i
∈
0,1
,
j
=
1,2
,
…, represents the membership degree of element u
i recurring in multiset for the jth time. According to the traditional concept of set, the membership degree of all elements in a multiset is 1. For μ
M
~
j
(
u
i
)
∈
[
0,1
], the traditional sense of multiset is generalized to fuzzy multiset.Definition 5 (fuzzy multiset).
A fuzzy multisetM over the universe U
=
{
u
1
,
u
2
,
…
,
u
n
} is defined as
(7)
M
~
=
μ
M
~
1
(
u
1
)
,
μ
M
~
2
(
u
1
)
,
…
,
μ
M
~
k
1
(
u
1
)
u
1
,
lllllll
μ
M
~
1
(
u
2
)
,
μ
M
~
2
(
u
2
)
,
…
,
μ
M
~
k
2
(
u
2
)
u
2
,
…
,
lllllll
μ
M
~
1
u
n
,
μ
M
~
2
u
n
,
…
,
μ
M
~
k
n
u
n
u
n
,
where {
μ
M
~
1
(
u
i
)
,
μ
M
~
2
(
u
i
)
,
…
,
μ
M
~
k
i
(
u
i
)
} is the degree of membership of element u
i (μ
M
~
j
(
u
i
)
∈
[
0,1
]).Definition 6 (length function).
The concept of multiplicityCount
M
(
u
i
) in multiset generalized to fuzzy multiset is length function, which is denoted as L
(
u
i
,
M
~
)
=
max
⁡
{
j
:
μ
M
~
j
(
u
i
)
≠
0
} [24].The number of occurrence or cardinality of a fuzzy multisetM
~ is given by M
~
=
∑
u
i
∈
U
∑
j
=
1
L
(
u
i
,
M
~
)
μ
M
~
j
(
u
i
) [22].There are some basic operators and relations of fuzzy multiset below:Inclusion:(8)
M
~
(
P
)
⊆
M
~
(
Q
)
⟺
μ
M
~
(
P
)
j
(
u
i
)
≤
μ
M
~
(
Q
)
j
(
u
i
)
,
lllllll
j
=
1,2
,
…
,
L
(
u
i
)
,
∀
u
i
∈
U
.
Equality:(9)
M
~
(
p
)
=
M
~
(
Q
)
⟺
μ
M
~
(
p
)
j
(
u
i
)
=
μ
M
~
(
Q
)
j
(
u
i
)
,
lllllll
j
=
1,2
,
…
,
L
(
u
i
)
,
∀
u
i
∈
U
.
Addition: ForM
~
(
p
)
=
u
i
,
μ
i
,
…
,
u
k
,
μ
k, M
~
Q
=
u
S
,
μ
S
,
…
,
u
r
,
μ
r,M
~
(
p
)
⊕
M
~
(
Q
)  =  {
(
u
i
,
μ
i
)
,
…
,
(
u
k
,
μ
k
)
,
(
u
S
,
μ
S
)
,
…
,
(
u
r
,
μ
r
)
}.
Intersection:(10)
μ
M
~
p
∩
M
~
Q
j
u
i
=
min
⁡
{
μ
M
~
(
p
)
j
(
u
i
)
,
μ
M
~
(
Q
)
j
(
u
i
)
}
,
j
=
1,2
,
…
,
L
(
u
i
)
,
∀
u
i
∈
U
.
Union:(11)
μ
M
~
p
∪
M
~
Q
j
u
i
=
max
⁡
{
μ
M
~
(
p
)
j
(
u
i
)
,
μ
M
~
(
Q
)
j
(
u
i
)
}
,
l
j
=
1,2
,
…
,
L
(
u
i
)
,
∀
u
i
∈
U
.Note that when performing any operator for two fuzzy multisets, the length of the membership degree sequences μ
M
~
(
p
)
1
(
u
i
)
,
μ
M
~
(
p
)
2
(
u
i
)
,
…
,
μ
M
~
(
p
)
j
(
u
i
) and μ
M
~
(
Q
)
1
(
u
i
)
,
μ
M
~
(
Q
)
2
(
u
i
)
,
…
,
μ
M
~
(
Q
)
j
(
u
i
), will be set up to be similar. For this reason, adequate number of zeros is affixed. For u
i
∈
U, the membership degree is arranged by the decreasing order of the elements in the sequence, where μ
M
~
(
p
)
1
(
u
i
)
≥
μ
M
~
(
p
)
2
(
u
i
)
≥
⋯
≥
μ
M
~
(
p
)
j
(
u
i
) and μ
M
~
(
Q
)
1
(
u
i
)
≥
μ
M
~
(
Q
)
2
(
u
i
)
≥
⋯
≥
μ
M
~
(
Q
)
j
(
u
i
).Example 7.
A fuzzy multisetM
~
=
{
(
0.4,0.2
)
/
a
,
(
1,0.7,0.7
)
/
b
,
(
0.7,0.2
)
/
c
,
(
0.4
)
/
d
} over U; the membership degree of element a is {
0.2,0.4
}; the membership degree of element b is {
1,0.7,0.7
}; the membership degree of element c is {
0.7,0.2
}; the membership degree of element d is {
0.4
}, where L
(
a
,
M
~
)
=
2, L
(
b
,
M
~
)
=
3, L
(
c
,
M
~
)
=
2, and L
(
d
,
M
~
)
=
1.
The set of all fuzzy multisets drawn from a universeU is denoted as M
~
(
U
).Definition 8 (λ-cut set of fuzzy multiset).
Theλ-cut set of a fuzzy multiset M
~ is denoted as M
~
λ and given by
(12)
M
~
λ
=
{
u
∣
u
∈
U
∧
μ
M
~
(
u
)
≥
λ
}
.
Note that the difference between the notation M
~
(
λ
) and notation M
~
λ is that M
~
λ is preserved for the λ-cut set of the fuzzy multiset M
~, while M
~
(
λ
) means assigning an index λ to the fuzzy multiset M
~.


## 2.1. Multiset

Definition 3 (multiset).
A multisetM over the universe U
=
{
u
1
,
u
2
,
…
,
u
n
} is defined as M
=
{
k
1
/
u
1
,
k
2
/
u
2
,
…
,
k
n
/
u
n
}, where k
i
=
Count
M
(
u
i
)
,
u
i
∈
U. For u
i
∈
U, Count
M
(
u
i
) denotes the multiplicity of u
i in M.
The cardinality of a multisetM is given by M
=
∑
u
i
∈
U
Count
M
(
u
i
) [22].
A multisetM also could be denoted as M
=
u
1
,
u
1
,
…
,
u
1
︷
k
1
,
u
2
,
u
2
,
…
,
u
2
︷
k
2
,
…
,
u
n
,
u
n
,
…
,
u
n
︷
k
n. The set of all multisets drawn from a universe U is denoted as M
(
U
).There are some basic operators and relations of multiset below:Inclusion:(1)
M
(
P
)
⊆
M
(
Q
)
⟺
Count
M
(
P
)
(
u
)
≤
Count
M
(
Q
)
(
u
)
,
lllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllll
∀
u
∈
U
.
Equality:(2)
M
(
P
)
=
M
(
Q
)
⟺
Count
M
(
P
)
(
u
)
=
Count
M
(
Q
)
(
u
)
,
lllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllll
∀
u
∈
U
.
Intersection:(3)
Count
(
M
(
P
)
∩
M
(
Q
)
)
(
u
)
=
min
⁡
{
Count
M
(
P
)
(
u
)
,
Count
M
(
Q
)
(
u
)
}
,
lllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllll
∀
u
∈
U
.
Union:(4)
Count
(
M
(
P
)
∪
M
(
Q
)
)
(
u
)
=
max
⁡
{
Count
M
(
P
)
(
u
)
,
Count
M
(
Q
)
(
u
)
}
,
lllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllll
∀
u
∈
U
.
Addition:(5)
Count
(
M
(
P
)
⊕
M
(
Q
)
)
(
u
)
=
Count
M
(
P
)
(
u
)
+
Count
M
(
Q
)
(
u
)
,
lllllllllllllllllllllllllllllllllllllllllllllllllllllllllllillllllllll
∀
u
∈
U
.Definition 4 (k-cut set of multiset).
Thek-cut set of a multiset M is denoted as M
k and given by M
k
=
{
u
∣
u
∈
U
∧
Count
M
(
u
)
≥
k
}.
Note that the difference between the notationM
(
k
) and M
k is that the former one means assigning an index k to the multiset M and the latter one means the k-cut set of the multiset M [23].


## 2.2. Fuzzy Multiset

Combined with the concept of fuzzy set, the traditional concept of multiset could be denoted as(6)
M
~
=
μ
M
~
1
u
1
u
1
,
μ
M
~
2
u
1
u
1
,
…
,
μ
M
~
k
1
u
1
u
1
︷
k
1
,
llllllll
μ
M
~
1
u
2
u
2
,
μ
M
~
2
u
2
u
2
,
…
,
μ
M
~
k
2
u
2
u
2
︷
,
k
2
…
,
llllllll
μ
M
~
1
u
n
u
n
,
μ
M
~
2
u
n
u
n
,
…
,
μ
M
~
k
n
u
n
u
n
︷
k
n
,
where μ
M
~
j
u
i
∈
0,1
,
j
=
1,2
,
…, represents the membership degree of element u
i recurring in multiset for the jth time. According to the traditional concept of set, the membership degree of all elements in a multiset is 1. For μ
M
~
j
(
u
i
)
∈
[
0,1
], the traditional sense of multiset is generalized to fuzzy multiset.Definition 5 (fuzzy multiset).
A fuzzy multisetM over the universe U
=
{
u
1
,
u
2
,
…
,
u
n
} is defined as
(7)
M
~
=
μ
M
~
1
(
u
1
)
,
μ
M
~
2
(
u
1
)
,
…
,
μ
M
~
k
1
(
u
1
)
u
1
,
lllllll
μ
M
~
1
(
u
2
)
,
μ
M
~
2
(
u
2
)
,
…
,
μ
M
~
k
2
(
u
2
)
u
2
,
…
,
lllllll
μ
M
~
1
u
n
,
μ
M
~
2
u
n
,
…
,
μ
M
~
k
n
u
n
u
n
,
where {
μ
M
~
1
(
u
i
)
,
μ
M
~
2
(
u
i
)
,
…
,
μ
M
~
k
i
(
u
i
)
} is the degree of membership of element u
i (μ
M
~
j
(
u
i
)
∈
[
0,1
]).Definition 6 (length function).
The concept of multiplicityCount
M
(
u
i
) in multiset generalized to fuzzy multiset is length function, which is denoted as L
(
u
i
,
M
~
)
=
max
⁡
{
j
:
μ
M
~
j
(
u
i
)
≠
0
} [24].The number of occurrence or cardinality of a fuzzy multisetM
~ is given by M
~
=
∑
u
i
∈
U
∑
j
=
1
L
(
u
i
,
M
~
)
μ
M
~
j
(
u
i
) [22].There are some basic operators and relations of fuzzy multiset below:Inclusion:(8)
M
~
(
P
)
⊆
M
~
(
Q
)
⟺
μ
M
~
(
P
)
j
(
u
i
)
≤
μ
M
~
(
Q
)
j
(
u
i
)
,
lllllll
j
=
1,2
,
…
,
L
(
u
i
)
,
∀
u
i
∈
U
.
Equality:(9)
M
~
(
p
)
=
M
~
(
Q
)
⟺
μ
M
~
(
p
)
j
(
u
i
)
=
μ
M
~
(
Q
)
j
(
u
i
)
,
lllllll
j
=
1,2
,
…
,
L
(
u
i
)
,
∀
u
i
∈
U
.
Addition: ForM
~
(
p
)
=
u
i
,
μ
i
,
…
,
u
k
,
μ
k, M
~
Q
=
u
S
,
μ
S
,
…
,
u
r
,
μ
r,M
~
(
p
)
⊕
M
~
(
Q
)  =  {
(
u
i
,
μ
i
)
,
…
,
(
u
k
,
μ
k
)
,
(
u
S
,
μ
S
)
,
…
,
(
u
r
,
μ
r
)
}.
Intersection:(10)
μ
M
~
p
∩
M
~
Q
j
u
i
=
min
⁡
{
μ
M
~
(
p
)
j
(
u
i
)
,
μ
M
~
(
Q
)
j
(
u
i
)
}
,
j
=
1,2
,
…
,
L
(
u
i
)
,
∀
u
i
∈
U
.
Union:(11)
μ
M
~
p
∪
M
~
Q
j
u
i
=
max
⁡
{
μ
M
~
(
p
)
j
(
u
i
)
,
μ
M
~
(
Q
)
j
(
u
i
)
}
,
l
j
=
1,2
,
…
,
L
(
u
i
)
,
∀
u
i
∈
U
.Note that when performing any operator for two fuzzy multisets, the length of the membership degree sequences μ
M
~
(
p
)
1
(
u
i
)
,
μ
M
~
(
p
)
2
(
u
i
)
,
…
,
μ
M
~
(
p
)
j
(
u
i
) and μ
M
~
(
Q
)
1
(
u
i
)
,
μ
M
~
(
Q
)
2
(
u
i
)
,
…
,
μ
M
~
(
Q
)
j
(
u
i
), will be set up to be similar. For this reason, adequate number of zeros is affixed. For u
i
∈
U, the membership degree is arranged by the decreasing order of the elements in the sequence, where μ
M
~
(
p
)
1
(
u
i
)
≥
μ
M
~
(
p
)
2
(
u
i
)
≥
⋯
≥
μ
M
~
(
p
)
j
(
u
i
) and μ
M
~
(
Q
)
1
(
u
i
)
≥
μ
M
~
(
Q
)
2
(
u
i
)
≥
⋯
≥
μ
M
~
(
Q
)
j
(
u
i
).Example 7.
A fuzzy multisetM
~
=
{
(
0.4,0.2
)
/
a
,
(
1,0.7,0.7
)
/
b
,
(
0.7,0.2
)
/
c
,
(
0.4
)
/
d
} over U; the membership degree of element a is {
0.2,0.4
}; the membership degree of element b is {
1,0.7,0.7
}; the membership degree of element c is {
0.7,0.2
}; the membership degree of element d is {
0.4
}, where L
(
a
,
M
~
)
=
2, L
(
b
,
M
~
)
=
3, L
(
c
,
M
~
)
=
2, and L
(
d
,
M
~
)
=
1.
The set of all fuzzy multisets drawn from a universeU is denoted as M
~
(
U
).Definition 8 (λ-cut set of fuzzy multiset).
Theλ-cut set of a fuzzy multiset M
~ is denoted as M
~
λ and given by
(12)
M
~
λ
=
{
u
∣
u
∈
U
∧
μ
M
~
(
u
)
≥
λ
}
.
Note that the difference between the notation M
~
(
λ
) and notation M
~
λ is that M
~
λ is preserved for the λ-cut set of the fuzzy multiset M
~, while M
~
(
λ
) means assigning an index λ to the fuzzy multiset M
~.


## 3. Objects and Object Merging

### 3.1. The General Framework

We have reviewed the most relevant definitions in the previous section. As we’ve mentioned earlier, the framework in our paper extends the work in paper [11], so now we will introduce some work basis below. The bases involve the redefinitions of coreferent objects and merge function in OMFM, and a brief review of properties of preservation and majority rule in [11].The bases involve the redefinitions of coreferent objects and merge function in OMFM.Reference functionρ
:
U
→
ε is formalized to describe a concept in the real world, where ε symbolizes the real world. By definition, two concepts are called coreferent if they describe the same real world concept.Definition 9 (coreferent objects).
LetU be a universe set of concepts. Two concepts u
1 and u
2 are coreferent if and only if ρ
(
u
1
)
=
ρ
(
u
2
).By the definition above, two objects that describe the same real world concept with semantic-related terms of different semantic relations embedded are formalized axiomatically. Here, we consider the context as the baseline: when describing a theme in a document, some semantic-related terms relating to this concept will be used to extend the theme.Definition 10 (merge function).
The merge function in OMFM is represented by functionϖ
:
M
~
(
U
)
→
U.
Mapping the fuzzy multisets of objects onto a single object is the job of merge function in our work, and these functions are often idempotent; that is,ϖ
(
u
~
,
u
~
,
…
,
u
~
)
=
u
~
,
∀
u
~
∈
U. This conclusion is also suitable in this paper and corresponding proof will be given in the following section.A brief review of two important properties.Property 1 (preservation).
A merge function is preservative when merge function only selects one of the elements from the source set, the property of preservation in OMFM is denoted as(13)
∀
M
~
∈
M
~
U
:
ϖ
M
~
∈
M
~
.Property 2 (majority rule).
If the multiplicity value of an element is larger than the half of cardinality value of the source set then this element must be selected by the merge function, which is denoted as(14)
∀
M
∈
M
(
U
)
:
Count
M
u
>
M
2
,
∃
u
∈
U
⟹
ϖ
M
=
u
.The majority rule above is an important property for merge function in multiset that was further studied in [25] and a weaker version has been proved in [26]. By now, the majority rule is not extended deeply in fuzzy multiset as it does not apply in general, but the preservation rule will be elaborated in our paper.


### 3.2. Merging of Fuzzy Multisets

Within the scope of OMFM, we focus on the case of object merging of compound a multiset and multiple fuzzy multisets with the function of the type below:(15)
ϖ
:
M
M
~
U
⟶
M
~
U
,
where the elements of M
~
(
U
) are denoted as M
~
(
p
), and the elements of M
M
~
U are M
(
Q
). Here, the multiset M
(
Q
) could be denoted as M
(
Q
)
=
{
M
~
(
p
1
)
,
M
~
(
p
2
)
,
…
,
M
~
(
p
n
)
}, where Count
M
(
Q
)
(
M
~
(
p
i
)
) denotes the multiplicity of M
~
(
p
i
) in M
(
Q
).The fundamental operator is mapping the data segments of fuzzy multisets onto one object, which is called a solution. In following sections the symbolφ is used to represent a random solution of a given merge function; that is, ϖ
(
M
)
=
φ.Example 11.
Given a fuzzy multiset overU
=
{
(
0.1,0.6
)
/
a
,
(
0.6,1
)
/
b
,
(
0.5,0.6,0.8
)
/
c
,
(
0.5,0.9
)
/
d
} and the multiset M
(
Q
)
=
{
M
~
(
p
1
)
,
M
~
(
p
1
)
,
M
~
(
p
2
)
,
M
~
(
p
3
)
}, such that
(16)
M
~
(
p
1
)
=
a
,
0.1
,
a
,
0.6
,
b
,
1
,
c
,
0.8
,
M
~
(
p
2
)
=
b
,
0.1
,
b
,
0.6
,
b
,
1
,
c
,
0.5
,
M
~
(
p
3
)
=
a
,
0.1
,
c
,
0.6
,
d
,
0.9
,
d
,
0.5
.
Here, consider two merge functions we have mentioned in Section 2, ϖ
1
=
∪
,
ϖ
2
=
∩. Then, we can obtain that
(17)
ϖ
1
M
Q
=
⋃
M
~
(
p
i
)
∈
M
~
(
Q
)
(
M
~
(
p
i
)
)
=
φ
(
1
)
llllllllllllllll
=
0.6,0.1
a
,
1,0.6,0.1
b
,
0.8
c
,
0.9,0.5
d
,
ϖ
2
(
M
Q
)
=
⋂
M
~
p
i
∈
M
~
Q
(
M
~
p
i
)
=
φ
2
=
0.5
c
.
Here, the fuzzy multiset M
~
(
p
i
) is referred to as source or source fuzzy multiset; the multiplicity of different source fuzzy multiset is not considered by merge function.The case is(
M
~
(
U
)
,
⊆
) is not an upper bounded lattice. The normalization criterion that is needed when performing merge functions is usually omitted by fuzzy multiset theory. Therefore, we show another property below.Property 3 (boundedness).
A bounded merge functionϖ over M
~
(
U
) should satisfy the following constraint:
(18)
∀
M
Q
∈
M
M
~
U
:
∀
u
∈
U
:
∀
M
~
(
P
)
∈
M
(
Q
)
:
μ
ϖ
M
Q
u
≤
μ
M
~
P
u
.
It indicates that the merge function selects one of the elements from all the source sets. A corresponding inference is that(19)
∀
M
Q
∈
M
M
~
U
:
∀
u
∈
U
:
∀
M
~
P
∈
M
Q
:
μ
u
∉
M
~
P
⟹
μ
u
∉
ϖ
M
Q
.
This inference explains that any element not belonging to any source set should not exist in the outcomes of a bounded merge function. We could easily get this natural property just from the observation, because elementu with membership degree μ
(
u
) should not be mixed into a solution arbitrarily. Also, it is a weaker notion of preservation. Besides, we also formulate the enforcing preservation:
(20)
∃
M
~
P
∈
M
Q
:
∀
u
∈
ϖ
M
Q
:
μ
ϖ
M
Q
u
=
μ
M
~
P
u
.
Then, Property 3 is equivalent to indicating
(21)
∃
M
~
P
∈
M
Q
:
∀
x
∈
ϖ
(
M
Q
)
:
μ
ϖ
M
Q
(
u
)
≠
0
.Paper [11] has pointed out that keeping the weaker version of Property 2 in the situation of multiset is advantageous. They take multidocument summarization (MDS) as an example to explain that keeping a strict preservation would lead to a bad result in practical situations, that is, one of the documents itself would be the summary of the entire document set. While the task of document fusion (DF) is to generate a text containing all the information in entire document set. So, a weaker version of Property 2 is also advantageous in our framework. The bounded merge function of fuzzy multiset will be further elaborated in subsequent sections.Theorem 12.
The functions∪, ∩, and ⊕ are bounded.Proof.
We can get the proof from the case that for anyM
(
Q
)
∈
M
(
M
~
u
)
(22)
min
⁡
M
~
P
∈
M
Q
μ
M
~
P
u
≤
max
⁡
M
~
P
∈
M
Q
μ
M
~
P
u
≤
∑
M
~
P
∈
M
Q
μ
M
~
P
u
≤
∑
M
~
P
∈
M
Q
Count
M
Q
M
~
P
·
μ
M
~
P
u
,
lllllllllllllllllllllllllllll
∀
u
∈
U
,
∀
M
~
P
∈
M
Q
.


## 3.1. The General Framework

We have reviewed the most relevant definitions in the previous section. As we’ve mentioned earlier, the framework in our paper extends the work in paper [11], so now we will introduce some work basis below. The bases involve the redefinitions of coreferent objects and merge function in OMFM, and a brief review of properties of preservation and majority rule in [11].The bases involve the redefinitions of coreferent objects and merge function in OMFM.Reference functionρ
:
U
→
ε is formalized to describe a concept in the real world, where ε symbolizes the real world. By definition, two concepts are called coreferent if they describe the same real world concept.Definition 9 (coreferent objects).
LetU be a universe set of concepts. Two concepts u
1 and u
2 are coreferent if and only if ρ
(
u
1
)
=
ρ
(
u
2
).By the definition above, two objects that describe the same real world concept with semantic-related terms of different semantic relations embedded are formalized axiomatically. Here, we consider the context as the baseline: when describing a theme in a document, some semantic-related terms relating to this concept will be used to extend the theme.Definition 10 (merge function).
The merge function in OMFM is represented by functionϖ
:
M
~
(
U
)
→
U.
Mapping the fuzzy multisets of objects onto a single object is the job of merge function in our work, and these functions are often idempotent; that is,ϖ
(
u
~
,
u
~
,
…
,
u
~
)
=
u
~
,
∀
u
~
∈
U. This conclusion is also suitable in this paper and corresponding proof will be given in the following section.A brief review of two important properties.Property 1 (preservation).
A merge function is preservative when merge function only selects one of the elements from the source set, the property of preservation in OMFM is denoted as(13)
∀
M
~
∈
M
~
U
:
ϖ
M
~
∈
M
~
.Property 2 (majority rule).
If the multiplicity value of an element is larger than the half of cardinality value of the source set then this element must be selected by the merge function, which is denoted as(14)
∀
M
∈
M
(
U
)
:
Count
M
u
>
M
2
,
∃
u
∈
U
⟹
ϖ
M
=
u
.The majority rule above is an important property for merge function in multiset that was further studied in [25] and a weaker version has been proved in [26]. By now, the majority rule is not extended deeply in fuzzy multiset as it does not apply in general, but the preservation rule will be elaborated in our paper.


## 3.2. Merging of Fuzzy Multisets

Within the scope of OMFM, we focus on the case of object merging of compound a multiset and multiple fuzzy multisets with the function of the type below:(15)
ϖ
:
M
M
~
U
⟶
M
~
U
,
where the elements of M
~
(
U
) are denoted as M
~
(
p
), and the elements of M
M
~
U are M
(
Q
). Here, the multiset M
(
Q
) could be denoted as M
(
Q
)
=
{
M
~
(
p
1
)
,
M
~
(
p
2
)
,
…
,
M
~
(
p
n
)
}, where Count
M
(
Q
)
(
M
~
(
p
i
)
) denotes the multiplicity of M
~
(
p
i
) in M
(
Q
).The fundamental operator is mapping the data segments of fuzzy multisets onto one object, which is called a solution. In following sections the symbolφ is used to represent a random solution of a given merge function; that is, ϖ
(
M
)
=
φ.Example 11.
Given a fuzzy multiset overU
=
{
(
0.1,0.6
)
/
a
,
(
0.6,1
)
/
b
,
(
0.5,0.6,0.8
)
/
c
,
(
0.5,0.9
)
/
d
} and the multiset M
(
Q
)
=
{
M
~
(
p
1
)
,
M
~
(
p
1
)
,
M
~
(
p
2
)
,
M
~
(
p
3
)
}, such that
(16)
M
~
(
p
1
)
=
a
,
0.1
,
a
,
0.6
,
b
,
1
,
c
,
0.8
,
M
~
(
p
2
)
=
b
,
0.1
,
b
,
0.6
,
b
,
1
,
c
,
0.5
,
M
~
(
p
3
)
=
a
,
0.1
,
c
,
0.6
,
d
,
0.9
,
d
,
0.5
.
Here, consider two merge functions we have mentioned in Section 2, ϖ
1
=
∪
,
ϖ
2
=
∩. Then, we can obtain that
(17)
ϖ
1
M
Q
=
⋃
M
~
(
p
i
)
∈
M
~
(
Q
)
(
M
~
(
p
i
)
)
=
φ
(
1
)
llllllllllllllll
=
0.6,0.1
a
,
1,0.6,0.1
b
,
0.8
c
,
0.9,0.5
d
,
ϖ
2
(
M
Q
)
=
⋂
M
~
p
i
∈
M
~
Q
(
M
~
p
i
)
=
φ
2
=
0.5
c
.
Here, the fuzzy multiset M
~
(
p
i
) is referred to as source or source fuzzy multiset; the multiplicity of different source fuzzy multiset is not considered by merge function.The case is(
M
~
(
U
)
,
⊆
) is not an upper bounded lattice. The normalization criterion that is needed when performing merge functions is usually omitted by fuzzy multiset theory. Therefore, we show another property below.Property 3 (boundedness).
A bounded merge functionϖ over M
~
(
U
) should satisfy the following constraint:
(18)
∀
M
Q
∈
M
M
~
U
:
∀
u
∈
U
:
∀
M
~
(
P
)
∈
M
(
Q
)
:
μ
ϖ
M
Q
u
≤
μ
M
~
P
u
.
It indicates that the merge function selects one of the elements from all the source sets. A corresponding inference is that(19)
∀
M
Q
∈
M
M
~
U
:
∀
u
∈
U
:
∀
M
~
P
∈
M
Q
:
μ
u
∉
M
~
P
⟹
μ
u
∉
ϖ
M
Q
.
This inference explains that any element not belonging to any source set should not exist in the outcomes of a bounded merge function. We could easily get this natural property just from the observation, because elementu with membership degree μ
(
u
) should not be mixed into a solution arbitrarily. Also, it is a weaker notion of preservation. Besides, we also formulate the enforcing preservation:
(20)
∃
M
~
P
∈
M
Q
:
∀
u
∈
ϖ
M
Q
:
μ
ϖ
M
Q
u
=
μ
M
~
P
u
.
Then, Property 3 is equivalent to indicating
(21)
∃
M
~
P
∈
M
Q
:
∀
x
∈
ϖ
(
M
Q
)
:
μ
ϖ
M
Q
(
u
)
≠
0
.Paper [11] has pointed out that keeping the weaker version of Property 2 in the situation of multiset is advantageous. They take multidocument summarization (MDS) as an example to explain that keeping a strict preservation would lead to a bad result in practical situations, that is, one of the documents itself would be the summary of the entire document set. While the task of document fusion (DF) is to generate a text containing all the information in entire document set. So, a weaker version of Property 2 is also advantageous in our framework. The bounded merge function of fuzzy multiset will be further elaborated in subsequent sections.Theorem 12.
The functions∪, ∩, and ⊕ are bounded.Proof.
We can get the proof from the case that for anyM
(
Q
)
∈
M
(
M
~
u
)
(22)
min
⁡
M
~
P
∈
M
Q
μ
M
~
P
u
≤
max
⁡
M
~
P
∈
M
Q
μ
M
~
P
u
≤
∑
M
~
P
∈
M
Q
μ
M
~
P
u
≤
∑
M
~
P
∈
M
Q
Count
M
Q
M
~
P
·
μ
M
~
P
u
,
lllllllllllllllllllllllllllll
∀
u
∈
U
,
∀
M
~
P
∈
M
Q
.


## 4. Optimal Merging of Fuzzy Multisets

### 4.1. Quality Measures

The purpose of defining quality measures is to construct the merge functions that could get good performance for object merging in multiple fuzzy multisets. On one hand, the behavior of the merge functions we defined could be characterized by the value of the quality measures. On the other hand, adjusting a merge function could also optimize a balance between accurateness and completeness of a given solution to get a higher value of quality measures. The relationship between the merge functions and quality measures can be shown in Figure1.Figure 1
The relationship between the merger functions and quality measures.Within the scope of our paper, we adopted two quality measures widely used in the text mining literature: the first one is purity [13], and the second one is entropy [14, 15]. Information entropy is a concept used to measure the amount of information in the information theory, which is often taken as a measure of “disorder;” that is, the higher the value of entropy, the higher the extent of disorder; information purity is a measure of correlation between a system and its environment, where a higher value of purity means that a system is more relevant to its environment. Both of the two measures fall into range interval [
0
,
1
]. Basically, the maximum purity and minimum entropy of results are the goals we try to achieve. Nevertheless, when we try to analyze the effect of a merge function, we should be able to analyze the effect at fundamental level of the elements. So, some local quality measures will be introduced first.Definition 13 (local precision).
Given a multisetM
(
Q
)
=
{
M
~
(
p
1
)
,
M
~
(
p
2
)
,
…
,
M
~
(
p
n
)
}, the local precision of the element u could be defined as
(23)
P
*
:
U
×
μ
⟶
0,1
:
u
,
λ
⟼
P
*
u
,
λ
∣
M
Q
,
such that
(24)
P
*
u
,
λ
∣
M
Q
=
1
M
Q
·
∑
M
~
P
∈
M
Q
∧
μ
M
~
P
u
=
λ
Count
M
Q
M
~
P
.
The local precision judges the accurateness of adding the element u with the membership degree λ into the solution. Here, M
(
Q
) is a multiset of sources. P
* judges the proportion of fuzzy multisets where the membership degree of element u is λ.Example 14.
Given the multisetM
(
Q
) in Example 11. The local precision of adding an element c into a solution with membership degree 0.5 is calculated. When (
M
~
P
∈
M
Q
)
∧
(
μ
M
~
P
u
=
0.5
), Count
M
Q
(
M
~
P
1
)
=
0, Count
M
Q
(
M
~
P
2
)
=
1, Count
M
(
Q
)
(
M
~
(
P
3
)
)
=
0, and M
(
Q
)
=
4:
(25)
P
*
(
c
,
0.5
∣
M
Q
)
=
1
4
·
1
=
0.25
.Property 4 (monotonity ofP
*).
Local precisionP
* is a decreasing function in accordance with the membership degree threshold λ:
(26)
∀
u
∈
U
:
∀
(
λ
1
,
λ
2
)
∈
0,1
2
:
λ
1
≥
λ
2
⟹
P
*
(
u
,
λ
1
∣
M
)
≤
P
*
u
,
λ
2
∣
M
.
The monotonity of P
* is a natural property. The lower membership degree means more sources will be added into the solution, owing to the fact that higher membership degree indicates relative simple relations related one concept (say the synonym of one word), and lower membership degree indicates more unspecific and more layered descriptions concerning one concept. As a result, we will get more complete information with higher precision.Definition 15 (purity).
Purity is computed using the maximal local precision value for each element in the solutionφ as follows:
(27)
Purity:
M
~
(
U
)
⟶
[
0,1
]
:
φ
⟼
Purity
(
φ
∣
M
(
Q
)
)
,
such that
(28)
Purity
(
φ
,
M
(
Q
)
)
=
∑
(
M
~
(
P
j
)
∈
M
(
Q
)
)
∧
(
μ
M
~
(
P
j
)
(
u
k
)
=
λ
)
×
M
(
Q
)
∑
M
~
(
P
j
)
∈
M
(
Q
)
∑
u
i
∈
M
~
(
P
j
)
L
u
i
;
M
~
P
j
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
·
Count
M
Q
M
~
P
j

∑
M
~
(
P
j
)
∈
M
(
Q
)
∑
u
i
∈
M
~
(
P
j
)
L
u
i
;
M
~
P
j
-
1
·
P
u
k
∈
φ
*
u
k
,
λ
∣
M
Q
.Example 16.
Given the multisetM
(
Q
) of Example 11 and solution φ
=
{
0.6
/
a
,
1
/
b
,
0.5
/
c
}, we could obtain the local precision of all elements in this solution
(29)
P
*
a
,
0.6
∣
M
Q
=
1
4
·
2
=
0.5
,
P
*
b
,
1
∣
M
Q
=
1
4
·
3
=
0.75
,
P
*
c
,
0.5
∣
M
Q
=
1
4
·
1
=
0.25
.
Note that we can also set λ of each element in solution a different value.
Then, we get the purity(30)
Purity
φ
∣
M
Q
=
0.375
.Definition 17 (local entropy).
The local entropy of each fuzzy multiset inM
(
Q
) is calculated as
(31)
E
*
:
U
×
μ
⟶
0,1
:
u
,
λ
⟼
E
*
u
,
λ
∣
M
Q
,
such that
(32)
E
*
(
u
,
λ
∣
M
Q
)
=
-
P
*
(
u
,
λ
∣
M
Q
)
·
log
⁡
P
*
(
u
,
λ
∣
M
(
Q
)
)
.Property 5 (monotonity ofE
*).
Local precisionE
* is an increasing function in accordance with the degree of membership threshold λ when 0.5
≤
P
*
≤
1, a decreasing function in accordance with the degree of membership threshold λ when 0
≤
P
*
≤
0.5:
(33)
∀
u
∈
U
:
∀
(
λ
1
,
λ
2
)
∈
0,1
2
:
0.5
≤
∀
P
1
*
,
P
2
*
≤
1
:
λ
1
≥
λ
2
⟹
E
*
u
,
λ
1
∣
M
≥
E
*
u
,
λ
2
∣
M
,
∀
u
∈
U
:
∀
(
λ
1
,
λ
2
)
∈
0,1
2
:
0
≤
∀
P
1
*
,
P
2
*
≤
0.5
:
λ
1
≥
λ
2
⟹
E
*
u
,
λ
1
∣
M
≤
E
*
u
,
λ
2
∣
M
.
Property5 implies that the variation trend of local entropy is impacted by both fuzziness and proportion of an element x in a solution; that is, neither excessively detailed or excessively brief information, nor more sources or less sources contained in the solution is appropriate to enrich the information of a fusion system. The proofs of these natural properties are omitted here. Back to our approach, the important connection exists between local precision and local entropy is also reflected by this property.Definition 18 (total entropy).
The total entropy ofM
(
Q
) is calculated as
(34)
Entropy:
M
~
(
U
)
⟶
[
0,1
]
:
φ
⟼
Entropy
(
φ
∣
M
(
Q
)
)
,
such that
(35)
Entropy
(
φ
∣
M
(
Q
)
)
=
∑
(
M
~
(
P
j
)
∈
M
(
Q
)
)
∧
(
μ
M
~
(
P
j
)
(
u
k
)
=
λ
)
×
M
(
Q
)
∑
M
~
P
j
∈
M
Q
∑
u
i
∈
M
~
P
j
L
u
i
;
M
~
P
j
lllllllllllllllllllllllllllll
·
Count
M
Q
M
~
P
j
∑
M
~
(
P
j
)
∈
M
(
Q
)
∑
u
i
∈
M
~
(
P
j
)
L
(
u
i
;
M
~
(
P
j
)
)

-
1
·
E
u
k
∈
φ
*
(
u
k
,
λ
∣
M
(
Q
)
)
.Example 19.
Given the multisetM
(
Q
) of Example 11 and φ
=
{
0.6
/
a
,
1
/
b
,
0.5
/
c
}, we obtain the local precision of all elements in this solution
(36)
E
*
a
,
0.6
∣
M
Q
=
0.3466
,
E
*
b
,
1
∣
M
Q
=
0.2158
,
E
*
c
,
0.5
∣
M
(
Q
)
=
0.3466
.
Then, we get the total entropy
(37)
Entropy
(
φ
∣
M
(
Q
)
)
=
0.2273
.The purity and entropy can, respectively, express the quality measures, but the variation scales between them may be unequal. As mentioned above, the maximum purity and minimum entropy of results are the goals we try to achieve. Therefore, we try to investigate an index with the similar variation scales.Definition 20 (validation index value).
Given a multiset of sourcesM
(
Q
)
=
{
M
~
(
p
1
)
,
M
~
(
p
2
)
,
…
,
M
~
(
p
n
)
}, the VI-value of the validation index is calculated as
(38)
VI:
M
~
U
⟶
0,1
:
φ
⟼
VI
⁡
(
φ
∣
M
Q
)
,
such that
(39)
VI
⁡
(
φ
∣
M
Q
)
=
Purity
(
φ
∣
M
Q
)
-
Entropy
(
φ
∣
M
Q
)
C
.Next, the rationality of this index will be shown. Generally, a brilliant result is generated by the higher value of the purity and the lower value of the entropy. That is to say, if the discrepancy between these two values is large, the value of the validation index is large and a good result can be determined by this validation index. That is to say, a balance between purity and entropy is expressed by validation index. In the case where the variation scales of these two values are similar, we propose a constant valueC which could change the similar variation scales of purity value and entropy value. In practice, we determine the most significant C singular values by selecting the best VI, and it is kind of an empirical value which could be achieved during the simulation and modified through iterated procedure. But how to determine the value of this constant is not the problem we really care about now, we have not discussed this problem deeply in this paper. In our future work, we will explore this problem deeply with experimental analysis.Note that for any solutionφ, VI
⁡
(
φ
∣
M
)
≠
0 if and only if the local precisions of all elements in this solution differ from zero.


### 4.2. Optimization of Quality

The effect of a merge function can be judged by quality measures introduced in previous phase. And then we try to investigate the solutions optimizing the values of the quality measures. This type of optimization problem also appears in other research fields, paper [27] utilized the transitive closure as the effective mechanism transforming a matrix into fuzzy equivalence relation, by this way, finding the approximate partitions of data sequences. It is a classic example in the field of fuzzy set theory. Another example involved searching approximate minimum-distance by transforming a fuzzy reciprocal relation with a transitive reciprocal relation [28]. That is to say, the optimization mechanism could not be one of a kind. At the next step, we will concentrate on maximum quality generated from VI-value (the maximization of the purity and the minimization of the entropy). The difficulty of this step is to find the solution φ which gets the best VI-value. Therefore, the main task here is to define and investigate a suitable merge function.Definition 21 (VI-value merge function).
A VI-value merge functionϖ over M
~
(
U
) should satisfy the following constraint:
(40)
∀
M
∈
M
M
~
U
:
ϖ
M
=
arg
max
⁡
φ
∈
M
~
U
VI
⁡
(
φ
∣
M
)
constrained by
(41)
max
⁡
φ
∈
M
~
U
VI
⁡
φ
∣
M
=
0
⟹
ϖ
M
=
ϕ
.
At this step, some properties of VI-optimal merge function will be studied further. A notable point is that there may appear several solutions sharing one maximum VI-value. With the definition of the merge function, how to select the unique solution is an important task here. Therefore, a selection criterion that selects one solution from the optimal solutions set is needed when performing these merge functions. With the special application area of OMFM, we will show the details in illustrative examples. Another problem is a solutionφthat has VI
⁡
(
φ
∣
M
)
≠
0 does not always exist. Hence, the notion of invalid solution is given below.Definition 22 (invalid solution).
Assume a VI-optimal merge functionϖ and a fuzzy multiset of sources M
∈
M
(
M
~
(
U
)
).
A multisetφ
∈
M
~
(
U
) is defined as an invalid solution of ϖ
(
M
) if
(42)
ϖ
(
M
)
=
φ
∧
VI
⁡
φ
∣
M
=
0
.
A solution φof a VI-optimal merge function ϖ that is not invalid is called avalid solution. Notice the differences between invalid solution and valid solution. Then, we will introduce another significant theorem.Theorem 23.
Any solution that is a real subset of the source intersection or a real superset of the source union has that(43)
∀
M
Q
∈
M
M
~
U
:
∀
φ
∈
M
~
U
:
φ
⊃
⋃
M
~
p
∈
M
Q
⁡
M
~
p
∨
φ
⊂
⋂
M
~
p
∈
M
Q
⁡
M
~
p
⟹
VI
⁡
φ
∣
M
Q
=
0
.Proof.
Assume a fuzzy multiset of sourceM
(
Q
)
=
{
M
~
(
p
1
)
,
M
~
(
p
2
)
,
…
,
M
~
(
p
n
)
}.(1)
A solutionφthat satisfies
(44)
φ
⊃
⋃
M
~
(
p
)
∈
M
(
Q
)
M
~
(
p
)
.
Also it satisfies(45)
Purity
(
φ
∣
M
Q
)
=
0
.
Owing to the case of all the elements of the solutionφ would generate a local precision equivalent to 0, then
(46)
VI
⁡
(
φ
∣
M
Q
)
=
0
.
(2)
A solutionφ that satisfies
(47)
φ
⊂
⋂
M
~
(
p
)
∈
M
(
Q
)
M
~
(
p
)
also satisfies(48)
Purity
(
φ
∣
M
Q
)
=
0
.
Owing to the case of all the elements of the solutionφ would generate a local precision equivalent to 0, then
(49)
VI
⁡
(
φ
∣
M
Q
)
=
0
.The conclusion here is that a valid solution of VI-optimal merge function should include the intersection of the sources and should be included by the union of the source. In view of this point, we define the intersection of the sources as the lower bound and the union of the sources as the upper bound. The formalized definition is shown as(50)
φ
-
=
⋃
M
~
p
∈
M
Q
M
~
p
,
φ
_
=
⋂
M
~
(
p
)
∈
M
(
Q
)
M
~
(
p
)
,
where the lower bound is denoted as φ
_ and the upper bound is denoted as φ
-. Hence, we shall only consider solution φ that satisfies φ
_
⊆
φ
⊆
φ
- in the following section.Theorem 24.
An VI-optimal merge function is idempotent.Proof.
Assume the fuzzy multisetM
(
Q
)
=
{
M
~
(
p
)
,
M
~
(
p
)
,
…
,
M
~
(
p
)
} satisfies φ
_
=
φ
-.
Thus, forφ
=
φ
_
=
φ
-, we have that
(51)
P
*
(
u
i
,
λ
∣
M
(
Q
)
)
=
Purity
(
φ
∣
M
(
Q
)
)
=
VI
⁡
(
φ
∣
M
(
Q
)
)
=
1
.
The corresponding proof is also shown when applying the previous theorem.Theorem 25.
A VI-optimalmerge functionϖ is bounded.Proof.
With Theorems12 and 23, we could get this conclusion.An important point is that VI-optimal merge functions do not satisfy the property of preservation. Nevertheless, due to the theorem we just proved above, they are bounded undoubtedly and boundedness offering a weaker version of preservation is shown in previous section. Besides the theorem of boundedness, several interesting theorems relevant to VI-optimal merge function need to be mentioned here. One of them is the theorem of VI-optimality invariance when scaling of multiplicity of the sources below.Theorem 26.
Assume a fuzzy multisetM
(
Q
)
=
{
M
~
(
p
1
)
,
M
~
(
p
2
)
,
…
,
M
~
(
p
n
)
} and a merge function ϖ. A conclusion could be got that
(52)
ϖ
(
M
(
Q
)
)
=
ϖ
(
k
·
M
(
Q
)
)
,
∀
k
∈
N
>
0
.Proof.
Several facts could be got that(53)
P
*
u
,
λ
∣
k
·
M
Q
=
1
k
·
M
Q
·
∑
M
~
P
∈
k
·
M
Q
∧
μ
P
u
=
λ
k
·
Count
M
Q
M
~
P
,
llllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllillllllllllllllll
∀
u
∈
φ
-
,
P
*
u
,
λ
∣
k
·
M
Q
=
1
k
·
M
Q
·
∑
M
~
P
∈
M
Q
∧
μ
P
u
=
λ
k
·
Count
M
Q
M
~
P
,
llllllllllllllllllllllllllllllllllllllllllllllllllllllllllillllllllllllllllll
∀
u
∈
φ
-
,
P
*
u
,
λ
∣
k
·
M
Q
=
1
M
Q
·
∑
M
~
P
∈
M
Q
∧
μ
P
u
=
λ
Count
M
Q
M
~
P
,
lllllllllllllllllllllllllllllllllllllllllllllllllllillllllllllllllll
∀
u
∈
φ
-
,
P
*
(
u
,
λ
∣
k
·
M
Q
)
=
P
*
u
,
λ
∣
M
(
Q
)
,
∀
u
∈
φ
-
.
And on the other hand,
(54)
E
*
(
u
,
λ
∣
k
·
M
(
Q
)
)
=
-
P
*
u
,
λ
∣
k
·
M
Q
·
log
⁡
P
*
u
,
λ
∣
k
·
M
Q
,
llllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllll
∀
u
∈
φ
-
,
E
*
(
u
,
λ
∣
k
·
M
(
Q
)
)
=
-
P
*
(
u
,
λ
∣
M
Q
)
·
log
⁡
P
*
u
,
λ
∣
M
Q
,
∀
u
∈
φ
-
,
E
*
(
u
,
λ
∣
k
·
M
Q
)
=
E
*
(
u
,
λ
∣
M
(
Q
)
)
,
∀
u
∈
φ
-
.Theorem 27.
Assume a fuzzy multisetM
(
Q
)
=
{
M
~
(
p
1
)
,
M
~
(
p
2
)
,
…
,
M
~
(
p
n
)
} is a VI-optimal merge function ϖ and a scaling parameter k
∈
N
>
1. If the solution φis VI-optimalwith regard to the sources M
(
Q
), then φ is VI-optimal in regard to the sources M
(
Q
)
=
{
k
·
M
~
(
p
1
)
,
…
,
k
·
M
~
(
p
n
)
}.Proof.
We could get the corollary in last theorem.


## 4.1. Quality Measures

The purpose of defining quality measures is to construct the merge functions that could get good performance for object merging in multiple fuzzy multisets. On one hand, the behavior of the merge functions we defined could be characterized by the value of the quality measures. On the other hand, adjusting a merge function could also optimize a balance between accurateness and completeness of a given solution to get a higher value of quality measures. The relationship between the merge functions and quality measures can be shown in Figure1.Figure 1
The relationship between the merger functions and quality measures.Within the scope of our paper, we adopted two quality measures widely used in the text mining literature: the first one is purity [13], and the second one is entropy [14, 15]. Information entropy is a concept used to measure the amount of information in the information theory, which is often taken as a measure of “disorder;” that is, the higher the value of entropy, the higher the extent of disorder; information purity is a measure of correlation between a system and its environment, where a higher value of purity means that a system is more relevant to its environment. Both of the two measures fall into range interval [
0
,
1
]. Basically, the maximum purity and minimum entropy of results are the goals we try to achieve. Nevertheless, when we try to analyze the effect of a merge function, we should be able to analyze the effect at fundamental level of the elements. So, some local quality measures will be introduced first.Definition 13 (local precision).
Given a multisetM
(
Q
)
=
{
M
~
(
p
1
)
,
M
~
(
p
2
)
,
…
,
M
~
(
p
n
)
}, the local precision of the element u could be defined as
(23)
P
*
:
U
×
μ
⟶
0,1
:
u
,
λ
⟼
P
*
u
,
λ
∣
M
Q
,
such that
(24)
P
*
u
,
λ
∣
M
Q
=
1
M
Q
·
∑
M
~
P
∈
M
Q
∧
μ
M
~
P
u
=
λ
Count
M
Q
M
~
P
.
The local precision judges the accurateness of adding the element u with the membership degree λ into the solution. Here, M
(
Q
) is a multiset of sources. P
* judges the proportion of fuzzy multisets where the membership degree of element u is λ.Example 14.
Given the multisetM
(
Q
) in Example 11. The local precision of adding an element c into a solution with membership degree 0.5 is calculated. When (
M
~
P
∈
M
Q
)
∧
(
μ
M
~
P
u
=
0.5
), Count
M
Q
(
M
~
P
1
)
=
0, Count
M
Q
(
M
~
P
2
)
=
1, Count
M
(
Q
)
(
M
~
(
P
3
)
)
=
0, and M
(
Q
)
=
4:
(25)
P
*
(
c
,
0.5
∣
M
Q
)
=
1
4
·
1
=
0.25
.Property 4 (monotonity ofP
*).
Local precisionP
* is a decreasing function in accordance with the membership degree threshold λ:
(26)
∀
u
∈
U
:
∀
(
λ
1
,
λ
2
)
∈
0,1
2
:
λ
1
≥
λ
2
⟹
P
*
(
u
,
λ
1
∣
M
)
≤
P
*
u
,
λ
2
∣
M
.
The monotonity of P
* is a natural property. The lower membership degree means more sources will be added into the solution, owing to the fact that higher membership degree indicates relative simple relations related one concept (say the synonym of one word), and lower membership degree indicates more unspecific and more layered descriptions concerning one concept. As a result, we will get more complete information with higher precision.Definition 15 (purity).
Purity is computed using the maximal local precision value for each element in the solutionφ as follows:
(27)
Purity:
M
~
(
U
)
⟶
[
0,1
]
:
φ
⟼
Purity
(
φ
∣
M
(
Q
)
)
,
such that
(28)
Purity
(
φ
,
M
(
Q
)
)
=
∑
(
M
~
(
P
j
)
∈
M
(
Q
)
)
∧
(
μ
M
~
(
P
j
)
(
u
k
)
=
λ
)
×
M
(
Q
)
∑
M
~
(
P
j
)
∈
M
(
Q
)
∑
u
i
∈
M
~
(
P
j
)
L
u
i
;
M
~
P
j
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
l
·
Count
M
Q
M
~
P
j

∑
M
~
(
P
j
)
∈
M
(
Q
)
∑
u
i
∈
M
~
(
P
j
)
L
u
i
;
M
~
P
j
-
1
·
P
u
k
∈
φ
*
u
k
,
λ
∣
M
Q
.Example 16.
Given the multisetM
(
Q
) of Example 11 and solution φ
=
{
0.6
/
a
,
1
/
b
,
0.5
/
c
}, we could obtain the local precision of all elements in this solution
(29)
P
*
a
,
0.6
∣
M
Q
=
1
4
·
2
=
0.5
,
P
*
b
,
1
∣
M
Q
=
1
4
·
3
=
0.75
,
P
*
c
,
0.5
∣
M
Q
=
1
4
·
1
=
0.25
.
Note that we can also set λ of each element in solution a different value.
Then, we get the purity(30)
Purity
φ
∣
M
Q
=
0.375
.Definition 17 (local entropy).
The local entropy of each fuzzy multiset inM
(
Q
) is calculated as
(31)
E
*
:
U
×
μ
⟶
0,1
:
u
,
λ
⟼
E
*
u
,
λ
∣
M
Q
,
such that
(32)
E
*
(
u
,
λ
∣
M
Q
)
=
-
P
*
(
u
,
λ
∣
M
Q
)
·
log
⁡
P
*
(
u
,
λ
∣
M
(
Q
)
)
.Property 5 (monotonity ofE
*).
Local precisionE
* is an increasing function in accordance with the degree of membership threshold λ when 0.5
≤
P
*
≤
1, a decreasing function in accordance with the degree of membership threshold λ when 0
≤
P
*
≤
0.5:
(33)
∀
u
∈
U
:
∀
(
λ
1
,
λ
2
)
∈
0,1
2
:
0.5
≤
∀
P
1
*
,
P
2
*
≤
1
:
λ
1
≥
λ
2
⟹
E
*
u
,
λ
1
∣
M
≥
E
*
u
,
λ
2
∣
M
,
∀
u
∈
U
:
∀
(
λ
1
,
λ
2
)
∈
0,1
2
:
0
≤
∀
P
1
*
,
P
2
*
≤
0.5
:
λ
1
≥
λ
2
⟹
E
*
u
,
λ
1
∣
M
≤
E
*
u
,
λ
2
∣
M
.
Property5 implies that the variation trend of local entropy is impacted by both fuzziness and proportion of an element x in a solution; that is, neither excessively detailed or excessively brief information, nor more sources or less sources contained in the solution is appropriate to enrich the information of a fusion system. The proofs of these natural properties are omitted here. Back to our approach, the important connection exists between local precision and local entropy is also reflected by this property.Definition 18 (total entropy).
The total entropy ofM
(
Q
) is calculated as
(34)
Entropy:
M
~
(
U
)
⟶
[
0,1
]
:
φ
⟼
Entropy
(
φ
∣
M
(
Q
)
)
,
such that
(35)
Entropy
(
φ
∣
M
(
Q
)
)
=
∑
(
M
~
(
P
j
)
∈
M
(
Q
)
)
∧
(
μ
M
~
(
P
j
)
(
u
k
)
=
λ
)
×
M
(
Q
)
∑
M
~
P
j
∈
M
Q
∑
u
i
∈
M
~
P
j
L
u
i
;
M
~
P
j
lllllllllllllllllllllllllllll
·
Count
M
Q
M
~
P
j
∑
M
~
(
P
j
)
∈
M
(
Q
)
∑
u
i
∈
M
~
(
P
j
)
L
(
u
i
;
M
~
(
P
j
)
)

-
1
·
E
u
k
∈
φ
*
(
u
k
,
λ
∣
M
(
Q
)
)
.Example 19.
Given the multisetM
(
Q
) of Example 11 and φ
=
{
0.6
/
a
,
1
/
b
,
0.5
/
c
}, we obtain the local precision of all elements in this solution
(36)
E
*
a
,
0.6
∣
M
Q
=
0.3466
,
E
*
b
,
1
∣
M
Q
=
0.2158
,
E
*
c
,
0.5
∣
M
(
Q
)
=
0.3466
.
Then, we get the total entropy
(37)
Entropy
(
φ
∣
M
(
Q
)
)
=
0.2273
.The purity and entropy can, respectively, express the quality measures, but the variation scales between them may be unequal. As mentioned above, the maximum purity and minimum entropy of results are the goals we try to achieve. Therefore, we try to investigate an index with the similar variation scales.Definition 20 (validation index value).
Given a multiset of sourcesM
(
Q
)
=
{
M
~
(
p
1
)
,
M
~
(
p
2
)
,
…
,
M
~
(
p
n
)
}, the VI-value of the validation index is calculated as
(38)
VI:
M
~
U
⟶
0,1
:
φ
⟼
VI
⁡
(
φ
∣
M
Q
)
,
such that
(39)
VI
⁡
(
φ
∣
M
Q
)
=
Purity
(
φ
∣
M
Q
)
-
Entropy
(
φ
∣
M
Q
)
C
.Next, the rationality of this index will be shown. Generally, a brilliant result is generated by the higher value of the purity and the lower value of the entropy. That is to say, if the discrepancy between these two values is large, the value of the validation index is large and a good result can be determined by this validation index. That is to say, a balance between purity and entropy is expressed by validation index. In the case where the variation scales of these two values are similar, we propose a constant valueC which could change the similar variation scales of purity value and entropy value. In practice, we determine the most significant C singular values by selecting the best VI, and it is kind of an empirical value which could be achieved during the simulation and modified through iterated procedure. But how to determine the value of this constant is not the problem we really care about now, we have not discussed this problem deeply in this paper. In our future work, we will explore this problem deeply with experimental analysis.Note that for any solutionφ, VI
⁡
(
φ
∣
M
)
≠
0 if and only if the local precisions of all elements in this solution differ from zero.


## 4.2. Optimization of Quality

The effect of a merge function can be judged by quality measures introduced in previous phase. And then we try to investigate the solutions optimizing the values of the quality measures. This type of optimization problem also appears in other research fields, paper [27] utilized the transitive closure as the effective mechanism transforming a matrix into fuzzy equivalence relation, by this way, finding the approximate partitions of data sequences. It is a classic example in the field of fuzzy set theory. Another example involved searching approximate minimum-distance by transforming a fuzzy reciprocal relation with a transitive reciprocal relation [28]. That is to say, the optimization mechanism could not be one of a kind. At the next step, we will concentrate on maximum quality generated from VI-value (the maximization of the purity and the minimization of the entropy). The difficulty of this step is to find the solution φ which gets the best VI-value. Therefore, the main task here is to define and investigate a suitable merge function.Definition 21 (VI-value merge function).
A VI-value merge functionϖ over M
~
(
U
) should satisfy the following constraint:
(40)
∀
M
∈
M
M
~
U
:
ϖ
M
=
arg
max
⁡
φ
∈
M
~
U
VI
⁡
(
φ
∣
M
)
constrained by
(41)
max
⁡
φ
∈
M
~
U
VI
⁡
φ
∣
M
=
0
⟹
ϖ
M
=
ϕ
.
At this step, some properties of VI-optimal merge function will be studied further. A notable point is that there may appear several solutions sharing one maximum VI-value. With the definition of the merge function, how to select the unique solution is an important task here. Therefore, a selection criterion that selects one solution from the optimal solutions set is needed when performing these merge functions. With the special application area of OMFM, we will show the details in illustrative examples. Another problem is a solutionφthat has VI
⁡
(
φ
∣
M
)
≠
0 does not always exist. Hence, the notion of invalid solution is given below.Definition 22 (invalid solution).
Assume a VI-optimal merge functionϖ and a fuzzy multiset of sources M
∈
M
(
M
~
(
U
)
).
A multisetφ
∈
M
~
(
U
) is defined as an invalid solution of ϖ
(
M
) if
(42)
ϖ
(
M
)
=
φ
∧
VI
⁡
φ
∣
M
=
0
.
A solution φof a VI-optimal merge function ϖ that is not invalid is called avalid solution. Notice the differences between invalid solution and valid solution. Then, we will introduce another significant theorem.Theorem 23.
Any solution that is a real subset of the source intersection or a real superset of the source union has that(43)
∀
M
Q
∈
M
M
~
U
:
∀
φ
∈
M
~
U
:
φ
⊃
⋃
M
~
p
∈
M
Q
⁡
M
~
p
∨
φ
⊂
⋂
M
~
p
∈
M
Q
⁡
M
~
p
⟹
VI
⁡
φ
∣
M
Q
=
0
.Proof.
Assume a fuzzy multiset of sourceM
(
Q
)
=
{
M
~
(
p
1
)
,
M
~
(
p
2
)
,
…
,
M
~
(
p
n
)
}.(1)
A solutionφthat satisfies
(44)
φ
⊃
⋃
M
~
(
p
)
∈
M
(
Q
)
M
~
(
p
)
.
Also it satisfies(45)
Purity
(
φ
∣
M
Q
)
=
0
.
Owing to the case of all the elements of the solutionφ would generate a local precision equivalent to 0, then
(46)
VI
⁡
(
φ
∣
M
Q
)
=
0
.
(2)
A solutionφ that satisfies
(47)
φ
⊂
⋂
M
~
(
p
)
∈
M
(
Q
)
M
~
(
p
)
also satisfies(48)
Purity
(
φ
∣
M
Q
)
=
0
.
Owing to the case of all the elements of the solutionφ would generate a local precision equivalent to 0, then
(49)
VI
⁡
(
φ
∣
M
Q
)
=
0
.The conclusion here is that a valid solution of VI-optimal merge function should include the intersection of the sources and should be included by the union of the source. In view of this point, we define the intersection of the sources as the lower bound and the union of the sources as the upper bound. The formalized definition is shown as(50)
φ
-
=
⋃
M
~
p
∈
M
Q
M
~
p
,
φ
_
=
⋂
M
~
(
p
)
∈
M
(
Q
)
M
~
(
p
)
,
where the lower bound is denoted as φ
_ and the upper bound is denoted as φ
-. Hence, we shall only consider solution φ that satisfies φ
_
⊆
φ
⊆
φ
- in the following section.Theorem 24.
An VI-optimal merge function is idempotent.Proof.
Assume the fuzzy multisetM
(
Q
)
=
{
M
~
(
p
)
,
M
~
(
p
)
,
…
,
M
~
(
p
)
} satisfies φ
_
=
φ
-.
Thus, forφ
=
φ
_
=
φ
-, we have that
(51)
P
*
(
u
i
,
λ
∣
M
(
Q
)
)
=
Purity
(
φ
∣
M
(
Q
)
)
=
VI
⁡
(
φ
∣
M
(
Q
)
)
=
1
.
The corresponding proof is also shown when applying the previous theorem.Theorem 25.
A VI-optimalmerge functionϖ is bounded.Proof.
With Theorems12 and 23, we could get this conclusion.An important point is that VI-optimal merge functions do not satisfy the property of preservation. Nevertheless, due to the theorem we just proved above, they are bounded undoubtedly and boundedness offering a weaker version of preservation is shown in previous section. Besides the theorem of boundedness, several interesting theorems relevant to VI-optimal merge function need to be mentioned here. One of them is the theorem of VI-optimality invariance when scaling of multiplicity of the sources below.Theorem 26.
Assume a fuzzy multisetM
(
Q
)
=
{
M
~
(
p
1
)
,
M
~
(
p
2
)
,
…
,
M
~
(
p
n
)
} and a merge function ϖ. A conclusion could be got that
(52)
ϖ
(
M
(
Q
)
)
=
ϖ
(
k
·
M
(
Q
)
)
,
∀
k
∈
N
>
0
.Proof.
Several facts could be got that(53)
P
*
u
,
λ
∣
k
·
M
Q
=
1
k
·
M
Q
·
∑
M
~
P
∈
k
·
M
Q
∧
μ
P
u
=
λ
k
·
Count
M
Q
M
~
P
,
llllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllillllllllllllllll
∀
u
∈
φ
-
,
P
*
u
,
λ
∣
k
·
M
Q
=
1
k
·
M
Q
·
∑
M
~
P
∈
M
Q
∧
μ
P
u
=
λ
k
·
Count
M
Q
M
~
P
,
llllllllllllllllllllllllllllllllllllllllllllllllllllllllllillllllllllllllllll
∀
u
∈
φ
-
,
P
*
u
,
λ
∣
k
·
M
Q
=
1
M
Q
·
∑
M
~
P
∈
M
Q
∧
μ
P
u
=
λ
Count
M
Q
M
~
P
,
lllllllllllllllllllllllllllllllllllllllllllllllllllillllllllllllllll
∀
u
∈
φ
-
,
P
*
(
u
,
λ
∣
k
·
M
Q
)
=
P
*
u
,
λ
∣
M
(
Q
)
,
∀
u
∈
φ
-
.
And on the other hand,
(54)
E
*
(
u
,
λ
∣
k
·
M
(
Q
)
)
=
-
P
*
u
,
λ
∣
k
·
M
Q
·
log
⁡
P
*
u
,
λ
∣
k
·
M
Q
,
llllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllll
∀
u
∈
φ
-
,
E
*
(
u
,
λ
∣
k
·
M
(
Q
)
)
=
-
P
*
(
u
,
λ
∣
M
Q
)
·
log
⁡
P
*
u
,
λ
∣
M
Q
,
∀
u
∈
φ
-
,
E
*
(
u
,
λ
∣
k
·
M
Q
)
=
E
*
(
u
,
λ
∣
M
(
Q
)
)
,
∀
u
∈
φ
-
.Theorem 27.
Assume a fuzzy multisetM
(
Q
)
=
{
M
~
(
p
1
)
,
M
~
(
p
2
)
,
…
,
M
~
(
p
n
)
} is a VI-optimal merge function ϖ and a scaling parameter k
∈
N
>
1. If the solution φis VI-optimalwith regard to the sources M
(
Q
), then φ is VI-optimal in regard to the sources M
(
Q
)
=
{
k
·
M
~
(
p
1
)
,
…
,
k
·
M
~
(
p
n
)
}.Proof.
We could get the corollary in last theorem.


## 5. An Application: Document Fusion with Illustrative Example

### 5.1. Document Fusion

One possible application for this fuzzy multiset framework is document fusion. It involves the merging of elements with the different relations embedded. When it comes to document fusion, we have to introduce multidocument summarization briefly. Document fusion and multidocument summarization are two relevant areas. The important difference between these two areas is that, for multidocument summarization, the main task is to generate the shortest description containing the most relevant information, while for document fusion, the focus is to generate the shortest description containing all information contained in the whole document set excluding the redundancy [15, 16]. It is like that multidocument summarization is the intersection of the documents and document fusion is the union of the documents. Unlike multidocument summarization system, there is no organization like DUC (Document Understand Conference) [29] providing “ideal” datasets for document fusion research yet, with which multiple documents under same subject and ideal summarization results for testing can be achieved. In addition, intrinsic and extrinsic evaluations in multidocument summarization system could not be suitable in fusion task: intrinsic evaluation where evaluation is done by human on accessing the quality of the fused documents itself makes the evaluation process subjective [30], and on the other hand, the difficulty in intrinsic evaluation of document fusion systems is that there is no existing collection of human written fusion results of multiple documents, serving as a gold standard for such evaluations by now; and extrinsic evaluation where the result of the document fused is evaluated by the completion of a specific task makes the evaluation process more complicated. Thus, there are no standard methods used to estimate the work in fusion task like in some document summarization tasks [31–33]. Given the problems we mentioned above, the evaluation that we performed is limited to date. To demonstrate our work, an example of an article cluster concerning the spoilage problem complaints of the dairy products on a particular brand has been selected from “315 consumption complaint” website to show the general fusion process and results by utilizing our framework. Although we use Chinese text for illustration, it is worth mentioning that there is not any fundamental difference between Chinese and English or other language under this framework.The work of our paper is to propose a framework for document fusion, so we are not only aiming to get keywords, but for comprehensive information. Here, we just try to consider the situation of fuzzy multiset. With such extensions, the membership degree could be used to show the importance and fuzziness of an element, which makes the document representation more granular and semantically richer than multiset merging model in paper [11]. Assigning different weights to the same element also makes sense, when considering the situation that semantic-related terms with different semantic relations are used to identify the concept, which is semantically richer than just using words. Under our framework, semantic methods and statistical methods could be combined and used in many domains.


### 5.2. Illustrative Example

The main processing that needs to be performed is to get the Extra Strong, Strong, and Medium Strong relations of every concept in each article by using HowNet [34]. As a common-sense knowledge base, HowNet unveils interconceptual and interattribute relations of concepts. In HowNet, every concept of a word or phrase and its description form one entry with relations such as hypernym, hyponym, synonym, antonym, meronym, and Holonym (descriptions for these relations could be seen in Table 1), existing in HowNet and presented in DEF (concept definition) as shown in Box 1.Table 1
Descriptions for different semantic relations.
Relations
Descriptions
Hypernym
Also known as a superordinate, which is a word referring to broad categories or general concepts. For example, “musical instrument” is a hypernym of “guitar” because a guitar is a musical instrument.
Hyponym
A word or phrase whose semantic field is included within that of another word, a hyponym shares a type-of relationship with its hypernym, for example, “pigeon,” “crow,” “eagle,” and “seagull” are all hyponyms of “bird.”
Synonym
A word with the same or similar meaning of another word.
Antonym
A word which has the opposite meaning as another word.
Meronym
Meronym denotes a constituent part of or a member of something. For example, “finger” is a meronym of “hand” because a finger is part of a hand. Similarly, “wheels” is a meronym of “automobile.”
Holonym
Holonym defines the relationship between a term denoting the whole and a term denoting a part of or a member of the whole. For example, “tree” is a holonym of “bark,” of “trunk” and of “limb.”Box 1:Examples for concept definition.
taste:   DEF = attribute, taste, & edible
shape:DEF = attribute, form, & physical
bearing:  DEF = attribute, behavior, & humanWhen performing English text, a large lexical database of English, WordNet, could be used to identify these relations instead of HowNet. Here, textual intention structure is determined by three relations of every concept. As an indicator in linguistic segments, three relation segments of every concept tend to indicate the theme segments. That is to say, once three relations of every concept have been confirmed, the corresponding linguistic segments will have determinate tendency. Each concept is defined as an element in fuzzy multisets and the three relation segments that are included in each concept determine the different membership degree of each element as shown in Table2.Table 2
Three relations for constructing concepts.
Composition of three relations
Membership degree
Extra Strong
Identity
1
Strong
① Synonym ② Hypernym, Hyponym, Antonym
0.5
Medium Strong
Meronym, Holonym
0.2In the following example, three semantic segments concerning different conceptsx, y, and z will be used in merge process. The corresponding fuzzy multisets obtained from the source set are shown below:
(55)
M
~
(
p
1
)
=
(
x
,
1.0
)
,
(
x
,
0.5
)
,
(
x
,
0.2
)
,
(
y
,
1.0
)
,
(
y
,
0.5
)
,
llllllllllllll
y
,
0.2
,
z
,
0.5
,
z
,
0.2
,
M
~
(
p
2
)
=
(
x
,
1.0
)
,
(
x
,
0.5
)
,
(
x
,
0.2
)
,
(
y
,
1.0
)
,
llllllllllllll
y
,
0.5
,
y
,
0.2
,
z
,
0.2
,
M
~
p
3
=
y
,
1.0
,
y
,
0.5
,
y
,
0.2
,
z
,
0.5
,
z
,
0.2
,
M
~
(
p
4
)
=
(
x
,
0.5
)
,
(
x
,
0.2
)
,
(
y
,
1.0
)
,
(
y
,
0.5
)
,
llllllllllllll
y
,
0.2
,
z
,
0.5
,
z
,
0.2
,
M
~
p
5
=
x
,
0.5
,
x
,
0.2
,
y
,
0.5
,
z
,
0.5
,
z
,
0.2
,
M
~
(
p
6
)
=
(
x
,
1.0
)
,
(
x
,
0.2
)
,
(
y
,
1.0
)
,
(
y
,
0.5
)
,
llllllllllllll
y
,
0.2
,
z
,
0.2
,
M
~
p
7
=
y
,
1.0
,
y
,
0.2
,
z
,
1.0
,
z
,
0.5
,
z
,
0.2
,
M
~
p
8
=
y
,
1.0
,
y
,
0.5
,
y
,
0.2
,
z
,
1.0
,
z
,
0.2
,
M
~
p
9
=
x
,
0.5
,
x
,
0.2
,
y
,
1.0
,
y
,
0.5
,
y
,
0.2
,
where (
x
,
1.0
) denotes there are Extra Strong semantic relations identified in concept x.As we’ve mentioned above, document fusion is to produce the shortest description containing all information found within the document set, but without repetition. The solution that we need is the solution concluding all the key concepts (x, y, and z in this example) and these concepts are constructed by three relations (Extra Strong, Strong, and Medium Strong relations). Let us consider the solution φ
=
{
(
x
,
1
)
,
(
y
,
0.5
)
,
(
z
,
0.2
)
}. We get the local precision of all elements in this solution
(56)
P
*
(
x
,
φ
(
x
)
∣
M
)
=
P
*
(
x
,
1
∣
M
)
=
0.333
,
P
*
(
y
,
φ
(
y
)
∣
M
)
=
P
*
(
y
,
0.5
∣
M
)
=
0.889
,
P
*
(
z
,
φ
(
z
)
∣
M
)
=
P
*
(
z
,
0.2
∣
M
)
=
0.889
,
such that
(57)
Purity
(
φ
∣
M
)
=
0.352
.
And we calculate the local entropy
(58)
E
*
(
x
,
φ
(
x
)
∣
M
)
=
E
*
(
x
,
1
∣
M
)
=
0.366
,
E
*
(
y
,
φ
(
y
)
∣
M
)
=
E
*
(
y
,
0.5
∣
M
)
=
0.105
,
E
*
(
z
,
φ
(
z
)
∣
M
)
=
E
*
(
z
,
0.2
∣
M
)
=
0.105
,
such that
(59)
Entropy
(
φ
∣
M
)
=
0.096
.
Then, we have got the validation index with setting the constant value C
=
1.5:
(60)
VI
⁡
(
φ
∣
M
)
=
0.352
-
0.096
C
=
0.352
-
0.096
1.5
=
0.288
.On the same principle, we present the local precision, purity, local entropy, entropy, and VI-value of the solutions with only one semantic relation embedded in each concept. If every concept is treated of equal importance with single relation embedded, in this case, we have got a maximal VI-value 0.355 (see Table3).Table 3
VI-values of  solutions (concept with single relation embedded).
φ
P
*
(
x
,
φ
(
x
)
|
M
)
P
*
(
y
,
φ
(
y
)
|
M
)
P
*
(
z
,
φ
(
z
)
|
M
)
Purity(φ
|
M)
(C
=
1.5)
E
*
(
x
,
φ
(
x
)
|
M
)
E
*
(
y
,
φ
(
y
)
|
M
)
E
*
(
z
,
φ
(
z
)
|
M
)
Entropy(φ
|
M)
VI(φ
|
M)
φ
1
=
{
0.2
/
x
,
0.5
/
y
,
0.5
/
z
}
0.667
0.889
0.556
0.352
0.274
0.270
0.105
0.326
0.117
φ
2
=
{
0.2
/
x
,
0.5
/
y
,
0.2
/
z
}
0.667
0.889
0.889
0.408
0.355
0.270
0.105
0.105
0.080
φ
3
=
{
0.2
/
x
,
0.5
/
y
,
1.0
/
z
}
0.667
0.889
0.222
0.296
0.217
0.270
0.105
0.334
0.118
φ
4
=
{
0.5
/
x
,
0.5
/
y
,
0.5
/
z
}
0.556
0.889
0.556
0.334
0.250
0.326
0.105
0.326
0.126
φ
5
=
{
0.5
/
x
,
0.5
/
y
,
0.2
/
z
}
0.556
0.889
0.889
0.389
0.330
0.326
0.105
0.105
0.089
φ
6
=
{
0.5
/
x
,
0.5
/
y
,
1.0
/
z
}
0.556
0.889
0.222
0.278
0.193
0.326
0.105
0.334
0.128
φ
7
=
{
1.0
/
x
,
0.5
/
y
,
0.5
/
z
}
0.333
0.889
0.556
0.296
0.207
0.366
0.105
0.326
0.133
φ
8
=
{
1.0
/
x
,
0.5
/
y
,
0.2
/
z
}
0.333
0.889
0.889
0.352
0.288
0.366
0.105
0.105
0.096
φ
9
=
{
1.0
/
x
,
0.5
/
y
,
1.0
/
z
}
0.333
0.889
0.222
0.241
0.152
0.366
0.105
0.334
0.134As mentioned in former section, a valid solutionφ of a VI-optimal merge function should follow the constraint below:
(61)
φ
-
=
∪
M
~
=
1.0,0.5,0.2
x
,
1.0,0.5,0.2
y
,
1.0,0.5,0.2
z
,
φ
_
=
∩
M
~
=
0.5
y
,
φ
_
⊆
φ
⊆
φ
-
.We should only consider solutionφ that satisfies the constraint mentioned above in practical application. So, more complicated solutions could also be considered. For example, when concept y is an important concept which needs to be described explicitly in the fusion result, more details as Medium Strong relation in Table 2 should be contained to construct the description. If the concept is not treated of equal importance with single relation embedded, in this case, we’ve got two maximal VI-value of 0.491 (see Table 4). Generally, for any solution φ, we can calculate the VI-values and choose the solution based on the observation of maximal VI-value.Within the scope of this paper, a tie-breaking criterion does not always exist, the accessorial choice criterion that helps selecting a solution from the set of optimal solutions is necessary. From the observations of φ
10 and φ
19, we need to decide the merging function by actual requirement or finding a new solution with more semantic relations embedded.Table 4
VI-values of  solutions (concepty with multiple relations embedded).
φ
P
*
(
x
,
φ
(
x
)
|
M
)
P
*
(
y
,
φ
(
y
)
|
M
)
P
*
(
z
,
φ
(
z
)
|
M
)
Purity(φ
|
M)
(C
=
1.5)
E
*
(
x
,
φ
(
x
)
|
M
)
E
*
(
y
,
φ
(
y
)
|
M
)
E
*
(
z
,
φ
(
z
)
|
M
)
Entropy(φ
|
M)
VI(φ
|
M)
φ
10
=
{
0.2
/
x
,
(
0.2
,
0.5
)
/
y
,
0.2
/
z
}
0.667
0.889
0.889
0.889
0.556
0.491
0.270
0.105
0.105
0.105
0.098
φ
1
1
=
{
0.2
/
x
,
(
0.2,0.5
)
/
y
,
0.5
/
z
}
0.667
0.889
0.889
0.556
0.500
0.411
0.270
0.105
0.105
0.326
0.134
φ
1
2
=
{
0.2
/
x
,
(
0.2,0.5
)
/
y
,
1.0
/
z
}
0.667
0.889
0.889
0.222
0.445
0.354
0.270
0.105
0.105
0.334
0.136
φ
1
3
=
{
0.5
/
x
,
(
0.2,0.5
)
/
y
,
0.2
/
z
}
0.556
0.889
0.889
0.889
0.537
0.466
0.326
0.105
0.105
0.105
0.107
φ
1
4
=
{
0.5
/
x
,
(
0.2,0.5
)
/
y
,
0.5
/
z
}
0.556
0.889
0.889
0.556
0.482
0.386
0.326
0.105
0.105
0.326
0.144
φ
1
5
=
{
0.5
/
x
,
(
0.2,0.5
)
/
y
,
1.0
/
z
}
0.556
0.889
0.889
0.222
0.426
0.329
0.326
0.105
0.105
0.334
0.145
φ
1
6
=
{
1.0
/
x
,
(
0.2,0.5
)
/
y
,
0.2
/
z
}
0.333
0.889
0.889
0.889
0.500
0.424
0.366
0.105
0.105
0.105
0.114
φ
1
7
=
{
1.0
/
x
,
(
0.2,0.5
)
/
y
,
0.5
/
z
}
0.333
0.889
0.889
0.556
0.445
0.345
0.366
0.105
0.105
0.326
0.150
φ
1
8
=
{
1.0
/
x
,
(
0.2,0.5
)
/
y
,
1.0
/
z
}
0.333
0.889
0.889
0.222
0.389
0.288
0.366
0.105
0.105
0.334
0.152
φ
1
9
=
{
0.2
/
x
,
(
1.0
,
0.5
)
/
y
,
0.2
/
z
}
0.667
0.889
0.889
0.889
0.556
0.491
0.270
0.105
0.105
0.105
0.098
φ
2
0
=
{
0.2
/
x
,
(
1.0,0.5
)
/
y
,
0.5
/
z
}
0.667
0.889
0.889
0.556
0.500
0.411
0.270
0.105
0.105
0.326
0.134
φ
21
=
{
0.2
/
x
,
(
1.0,0.5
)
/
y
,
1.0
/
z
}
0.667
0.889
0.889
0.222
0.445
0.354
0.270
0.105
0.105
0.334
0.136
φ
22
=
{
0.5
/
x
,
(
1.0,0.5
)
/
y
,
0.2
/
z
}
0.556
0.889
0.889
0.889
0.537
0.466
0.326
0.105
0.105
0.105
0.107
φ
23
=
{
0.5
/
x
,
(
1.0,0.5
)
/
y
,
0.5
/
z
}
0.556
0.889
0.889
0.556
0.482
0.386
0.326
0.105
0.105
0.326
0.144
φ
24
=
{
0.5
/
x
,
(
1.0,0.5
)
/
y
,
1.0
/
z
}
0.556
0.889
0.889
0.222
0.426
0.329
0.326
0.105
0.105
0.334
0.145
φ
25
=
{
1.0
/
x
,
(
1.0,0.5
)
/
y
,
0.2
/
z
}
0.333
0.889
0.889
0.889
0.500
0.424
0.366
0.105
0.105
0.105
0.114
φ
26
=
{
1.0
/
x
,
(
1.0,0.5
)
/
y
,
0.5
/
z
}
0.333
0.889
0.889
0.556
0.445
0.345
0.366
0.105
0.105
0.326
0.150
φ
27
=
{
1.0
/
x
,
(
1.0,0.5
)
/
y
,
1.0
/
z
}
0.333
0.889
0.889
0.222
0.389
0.288
0.366
0.105
0.105
0.334
0.152More examples with considering conceptz and concept x as important concepts which needs to be describe explicitly in the fusion result, will be shown in Tables 5 and 6. When concept z and concept x are with similar scale of multiple relations embedded, we could get equivalent maximum VI-value 0.410 from φ
28 and φ
38, which means these two strategies get the same effect. If only one concept is with multiple relations embedded, we should consider φ
10 to φ
45 and get the maximum VI-value 0.491 from φ
10 or φ
19. Both the situations needs to be further selected by considering the specific application: For φ
28 and φ
38, two solutions selected strong and medium strong relations for concept z and x, so the importance of concept should be further considered, that is to say, if concept x is more importance for fusion, φ
38 should be selected. For φ
10 or φ
19, when the fusion results need to be described with more details, corresponding solution φ
10 should be selected; otherwise, φ
19 would also be a candidate selection for fusion.Table 5
VI-values of  solutions (conceptz with multiple relations embedded).
φ
P
*
(
x
,
φ
(
x
)
|
M
)
P
*
(
y
,
φ
(
y
)
|
M
)
P
*
(
z
,
φ
(
z
)
|
M
)
Purity(φ
|
M)
(C
=
1.5)
E
*
(
x
,
φ
(
x
)
|
M
)
E
*
(
y
,
φ
(
y
)
|
M
)
E
*
(
z
,
φ
(
z
)
|
M
)
Entropy(φ
|
M)
VI(φ
|
M)
φ
28
=
{
0.2
/
x
,
0.5
/
y
,
(
0.2,0.5
)
/
z
}
0.667
0.889
0.889
0.556
0.500
0.410
0.270
0.105
0.105
0.326
0.134
φ
29
=
{
0.2
/
x
,
0.5
/
y
,
(
0.2,1.0
)
/
z
}
0.667
0.889
0.889
0.222
0.445
0.355
0.270
0.105
0.105
0.334
0.136
φ
30
=
{
0.2
/
x
,
0.5
/
y
,
(
0.5,1.0
)
/
z
}
0.667
0.889
0.556
0.222
0.389
0.274
0.270
0.105
0.326
0.334
0.173
φ
31
=
{
0.5
/
x
,
0.5
/
y
,
(
0.2,0.5
)
/
z
}
0.556
0.889
0.889
0.556
0.482
0.386
0.326
0.105
0.105
0.326
0.144
φ
32
=
{
0.5
/
x
,
0.5
/
y
,
(
0.2,1.0
)
/
z
}
0.556
0.889
0.889
0.222
0.426
0.329
0.326
0.105
0.105
0.334
0.145
φ
33
=
{
0.5
/
x
,
0.5
/
y
,
(
0.5,1.0
)
/
z
}
0.556
0.889
0.556
0.222
0.371
0.250
0.326
0.105
0.326
0.334
0.182
φ
34
=
{
1.0
/
x
,
0.5
/
y
,
(
0.2,0.5
)
/
z
}
0.333
0.889
0.889
0.556
0.445
0.345
0.366
0.105
0.105
0.326
0.150
φ
35
=
{
1.0
/
x
,
0.5
/
y
,
(
0.2,1.0
)
/
z
}
0.333
0.889
0.889
0.222
0.389
0.288
0.366
0.105
0.105
0.334
0.152
φ
36
=
{
1.0
/
x
,
0.5
/
y
,
(
0.5,1.0
)
/
z
}
0.333
0.889
0.556
0.222
0.333
0.207
0.366
0.105
0.326
0.334
0.189Table 6
VI-values of  solutions (conceptx with multiple relations embedded).
φ
P
*
(
x
,
φ
(
x
)
|
M
)
P
*
(
y
,
φ
(
y
)
|
M
)
P
*
(
z
,
φ
(
z
)
|
M
)
Purity(φ
|
M)
(C
=
1.5)
E
*
(
x
,
φ
(
x
)
|
M
)
E
*
(
y
,
φ
(
y
)
|
M
)
E
*
(
z
,
φ
(
z
)
|
M
)
Entropy(φ
|
M)
VI(φ
|
M)
φ
37
=
{
(
0.2,0.5
)
/
x
,
0.5
/
y
,
0.5
/
z
}
0.667
0.556
0.889
0.556
0.445
0.331
0.270
0.326
0.105
0.326
0.171
φ
38
=
{
(
0.2,0.5
)
/
x
,
0.5
/
y
,
0.2
/
z
}
0.667
0.556
0.889
0.889
0.500
0.410
0.270
0.326
0.105
0.105
0.134
φ
39
=
{
(
0.2,0.5
)
/
x
,
0.5
/
y
,
1.0
/
z
}
0.667
0.556
0.889
0.222
0.389
0.274
0.270
0.326
0.105
0.334
0.173
φ
40
=
{
(
0.2
,
1.0
)
/
x
,
0.5
/
y
,
0.5
/
z
}
0.667
0.333
0.889
0.556
0.408
0.289
0.270
0.366
0.105
0.326
0.178
φ
41
=
{
(
0.2
,
1.0
)
/
x
,
0.5
/
y
,
0.2
/
z
}
0.667
0.333
0.889
0.889
0.463
0.372
0.270
0.366
0.105
0.105
0.136
φ
42
=
{
(
0.2
,
1.0
)
/
x
,
0.5
/
y
,
1.0
/
z
}
0.667
0.333
0.889
0.222
0.352
0.233
0.270
0.366
0.105
0.334
0.179
φ
43
=
{
(
1.0
,
0.5
)
/
x
,
0.5
/
y
,
0.5
/
z
}
0.333
0.556
0.889
0.556
0.389
0.264
0.366
0.326
0.105
0.326
0.187
φ
44
=
{
(
1.0
,
0.5
)
/
x
,
0.5
/
y
,
0.2
/
z
}
0.333
0.556
0.889
0.889
0.445
0.345
0.366
0.326
0.105
0.105
0.150
φ
45
=
{
(
1.0,0.5
)
/
x
,
0.5
/
y
,
1.0
/
z
}
0.333
0.556
0.889
0.222
0.333
0.207
0.366
0.326
0.105
0.334
0.189Figure2 shows the distribution of the VI-values with different scales of semantic relations embedded using box-and-whisker plot and evaluates the effectiveness of the merge function. The observations on partial of VI-values are presented here. The top bar stands for the maximum observation value; the bottom bar represents the lowest observation value. The bottom of the box is the lower quartile with 25% of data less than this value, the top of the box is the upper quartile with 25% of data greater than this value, and the red line in the box is the median observation value with 50% of data greater than this value. The x-axis presents the functions we examined (single relation embedded in single concept as shown in Table 3 multiple relations embedded in single concept as shown in Tables 4, 5, and 6, and the upper solution and lower solution). The y-axis presents the VI-values. By observing the range of VI-values, we see that, for all VI-values, there is a wide range of values that are achieved by different merge functions. Thus, simple strategies are not likely to work well. Observing the performance of the multiple relations embedded strategy, we see that multiple relations embedded surpassed over only one relation embedded function, as it produces very good results on VI-values we examined. Thus, it is enough to optimize merge function using different scale of multiple relations embedded in concept, to obtain high quality results.Figure 2
The distribution of VI-value with different scales of semantic relations embedded.We have not performed all the merge functions with corresponding VI-values in our illustrative example yet. The data and explanation we give above is just to show the proposed framework vividly. Now, we’ve got the conclusion that we could get a corresponding VI-value for any solution. On the other hand, we could use the VI-value to select the best solution. As our framework is flexible enough to generate shortest description containing all information found within the document sets with different levels of details depending on practical requirement. With this framework, neither the relations between the keywords nor the context of co-text will be lost. To generate a moderately fluent semantic fusion result from a collection of documents, sentence planning and regeneration are then used to combine the segments together to form a coherent whole. In our paper, the framework solved basic issues on developing a document fusion system.(
1
) The documents are fused on more levels of granularity, as we assign different weights to different semantic relations embedding in the same element of concept. (
2
) Meanwhile, taking into account semantic relations in the fusion progress ensures the readability of the fused document.


## 5.1. Document Fusion

One possible application for this fuzzy multiset framework is document fusion. It involves the merging of elements with the different relations embedded. When it comes to document fusion, we have to introduce multidocument summarization briefly. Document fusion and multidocument summarization are two relevant areas. The important difference between these two areas is that, for multidocument summarization, the main task is to generate the shortest description containing the most relevant information, while for document fusion, the focus is to generate the shortest description containing all information contained in the whole document set excluding the redundancy [15, 16]. It is like that multidocument summarization is the intersection of the documents and document fusion is the union of the documents. Unlike multidocument summarization system, there is no organization like DUC (Document Understand Conference) [29] providing “ideal” datasets for document fusion research yet, with which multiple documents under same subject and ideal summarization results for testing can be achieved. In addition, intrinsic and extrinsic evaluations in multidocument summarization system could not be suitable in fusion task: intrinsic evaluation where evaluation is done by human on accessing the quality of the fused documents itself makes the evaluation process subjective [30], and on the other hand, the difficulty in intrinsic evaluation of document fusion systems is that there is no existing collection of human written fusion results of multiple documents, serving as a gold standard for such evaluations by now; and extrinsic evaluation where the result of the document fused is evaluated by the completion of a specific task makes the evaluation process more complicated. Thus, there are no standard methods used to estimate the work in fusion task like in some document summarization tasks [31–33]. Given the problems we mentioned above, the evaluation that we performed is limited to date. To demonstrate our work, an example of an article cluster concerning the spoilage problem complaints of the dairy products on a particular brand has been selected from “315 consumption complaint” website to show the general fusion process and results by utilizing our framework. Although we use Chinese text for illustration, it is worth mentioning that there is not any fundamental difference between Chinese and English or other language under this framework.The work of our paper is to propose a framework for document fusion, so we are not only aiming to get keywords, but for comprehensive information. Here, we just try to consider the situation of fuzzy multiset. With such extensions, the membership degree could be used to show the importance and fuzziness of an element, which makes the document representation more granular and semantically richer than multiset merging model in paper [11]. Assigning different weights to the same element also makes sense, when considering the situation that semantic-related terms with different semantic relations are used to identify the concept, which is semantically richer than just using words. Under our framework, semantic methods and statistical methods could be combined and used in many domains.


## 5.2. Illustrative Example

The main processing that needs to be performed is to get the Extra Strong, Strong, and Medium Strong relations of every concept in each article by using HowNet [34]. As a common-sense knowledge base, HowNet unveils interconceptual and interattribute relations of concepts. In HowNet, every concept of a word or phrase and its description form one entry with relations such as hypernym, hyponym, synonym, antonym, meronym, and Holonym (descriptions for these relations could be seen in Table 1), existing in HowNet and presented in DEF (concept definition) as shown in Box 1.Table 1
Descriptions for different semantic relations.
Relations
Descriptions
Hypernym
Also known as a superordinate, which is a word referring to broad categories or general concepts. For example, “musical instrument” is a hypernym of “guitar” because a guitar is a musical instrument.
Hyponym
A word or phrase whose semantic field is included within that of another word, a hyponym shares a type-of relationship with its hypernym, for example, “pigeon,” “crow,” “eagle,” and “seagull” are all hyponyms of “bird.”
Synonym
A word with the same or similar meaning of another word.
Antonym
A word which has the opposite meaning as another word.
Meronym
Meronym denotes a constituent part of or a member of something. For example, “finger” is a meronym of “hand” because a finger is part of a hand. Similarly, “wheels” is a meronym of “automobile.”
Holonym
Holonym defines the relationship between a term denoting the whole and a term denoting a part of or a member of the whole. For example, “tree” is a holonym of “bark,” of “trunk” and of “limb.”Box 1:Examples for concept definition.
taste:   DEF = attribute, taste, & edible
shape:DEF = attribute, form, & physical
bearing:  DEF = attribute, behavior, & humanWhen performing English text, a large lexical database of English, WordNet, could be used to identify these relations instead of HowNet. Here, textual intention structure is determined by three relations of every concept. As an indicator in linguistic segments, three relation segments of every concept tend to indicate the theme segments. That is to say, once three relations of every concept have been confirmed, the corresponding linguistic segments will have determinate tendency. Each concept is defined as an element in fuzzy multisets and the three relation segments that are included in each concept determine the different membership degree of each element as shown in Table2.Table 2
Three relations for constructing concepts.
Composition of three relations
Membership degree
Extra Strong
Identity
1
Strong
① Synonym ② Hypernym, Hyponym, Antonym
0.5
Medium Strong
Meronym, Holonym
0.2In the following example, three semantic segments concerning different conceptsx, y, and z will be used in merge process. The corresponding fuzzy multisets obtained from the source set are shown below:
(55)
M
~
(
p
1
)
=
(
x
,
1.0
)
,
(
x
,
0.5
)
,
(
x
,
0.2
)
,
(
y
,
1.0
)
,
(
y
,
0.5
)
,
llllllllllllll
y
,
0.2
,
z
,
0.5
,
z
,
0.2
,
M
~
(
p
2
)
=
(
x
,
1.0
)
,
(
x
,
0.5
)
,
(
x
,
0.2
)
,
(
y
,
1.0
)
,
llllllllllllll
y
,
0.5
,
y
,
0.2
,
z
,
0.2
,
M
~
p
3
=
y
,
1.0
,
y
,
0.5
,
y
,
0.2
,
z
,
0.5
,
z
,
0.2
,
M
~
(
p
4
)
=
(
x
,
0.5
)
,
(
x
,
0.2
)
,
(
y
,
1.0
)
,
(
y
,
0.5
)
,
llllllllllllll
y
,
0.2
,
z
,
0.5
,
z
,
0.2
,
M
~
p
5
=
x
,
0.5
,
x
,
0.2
,
y
,
0.5
,
z
,
0.5
,
z
,
0.2
,
M
~
(
p
6
)
=
(
x
,
1.0
)
,
(
x
,
0.2
)
,
(
y
,
1.0
)
,
(
y
,
0.5
)
,
llllllllllllll
y
,
0.2
,
z
,
0.2
,
M
~
p
7
=
y
,
1.0
,
y
,
0.2
,
z
,
1.0
,
z
,
0.5
,
z
,
0.2
,
M
~
p
8
=
y
,
1.0
,
y
,
0.5
,
y
,
0.2
,
z
,
1.0
,
z
,
0.2
,
M
~
p
9
=
x
,
0.5
,
x
,
0.2
,
y
,
1.0
,
y
,
0.5
,
y
,
0.2
,
where (
x
,
1.0
) denotes there are Extra Strong semantic relations identified in concept x.As we’ve mentioned above, document fusion is to produce the shortest description containing all information found within the document set, but without repetition. The solution that we need is the solution concluding all the key concepts (x, y, and z in this example) and these concepts are constructed by three relations (Extra Strong, Strong, and Medium Strong relations). Let us consider the solution φ
=
{
(
x
,
1
)
,
(
y
,
0.5
)
,
(
z
,
0.2
)
}. We get the local precision of all elements in this solution
(56)
P
*
(
x
,
φ
(
x
)
∣
M
)
=
P
*
(
x
,
1
∣
M
)
=
0.333
,
P
*
(
y
,
φ
(
y
)
∣
M
)
=
P
*
(
y
,
0.5
∣
M
)
=
0.889
,
P
*
(
z
,
φ
(
z
)
∣
M
)
=
P
*
(
z
,
0.2
∣
M
)
=
0.889
,
such that
(57)
Purity
(
φ
∣
M
)
=
0.352
.
And we calculate the local entropy
(58)
E
*
(
x
,
φ
(
x
)
∣
M
)
=
E
*
(
x
,
1
∣
M
)
=
0.366
,
E
*
(
y
,
φ
(
y
)
∣
M
)
=
E
*
(
y
,
0.5
∣
M
)
=
0.105
,
E
*
(
z
,
φ
(
z
)
∣
M
)
=
E
*
(
z
,
0.2
∣
M
)
=
0.105
,
such that
(59)
Entropy
(
φ
∣
M
)
=
0.096
.
Then, we have got the validation index with setting the constant value C
=
1.5:
(60)
VI
⁡
(
φ
∣
M
)
=
0.352
-
0.096
C
=
0.352
-
0.096
1.5
=
0.288
.On the same principle, we present the local precision, purity, local entropy, entropy, and VI-value of the solutions with only one semantic relation embedded in each concept. If every concept is treated of equal importance with single relation embedded, in this case, we have got a maximal VI-value 0.355 (see Table3).Table 3
VI-values of  solutions (concept with single relation embedded).
φ
P
*
(
x
,
φ
(
x
)
|
M
)
P
*
(
y
,
φ
(
y
)
|
M
)
P
*
(
z
,
φ
(
z
)
|
M
)
Purity(φ
|
M)
(C
=
1.5)
E
*
(
x
,
φ
(
x
)
|
M
)
E
*
(
y
,
φ
(
y
)
|
M
)
E
*
(
z
,
φ
(
z
)
|
M
)
Entropy(φ
|
M)
VI(φ
|
M)
φ
1
=
{
0.2
/
x
,
0.5
/
y
,
0.5
/
z
}
0.667
0.889
0.556
0.352
0.274
0.270
0.105
0.326
0.117
φ
2
=
{
0.2
/
x
,
0.5
/
y
,
0.2
/
z
}
0.667
0.889
0.889
0.408
0.355
0.270
0.105
0.105
0.080
φ
3
=
{
0.2
/
x
,
0.5
/
y
,
1.0
/
z
}
0.667
0.889
0.222
0.296
0.217
0.270
0.105
0.334
0.118
φ
4
=
{
0.5
/
x
,
0.5
/
y
,
0.5
/
z
}
0.556
0.889
0.556
0.334
0.250
0.326
0.105
0.326
0.126
φ
5
=
{
0.5
/
x
,
0.5
/
y
,
0.2
/
z
}
0.556
0.889
0.889
0.389
0.330
0.326
0.105
0.105
0.089
φ
6
=
{
0.5
/
x
,
0.5
/
y
,
1.0
/
z
}
0.556
0.889
0.222
0.278
0.193
0.326
0.105
0.334
0.128
φ
7
=
{
1.0
/
x
,
0.5
/
y
,
0.5
/
z
}
0.333
0.889
0.556
0.296
0.207
0.366
0.105
0.326
0.133
φ
8
=
{
1.0
/
x
,
0.5
/
y
,
0.2
/
z
}
0.333
0.889
0.889
0.352
0.288
0.366
0.105
0.105
0.096
φ
9
=
{
1.0
/
x
,
0.5
/
y
,
1.0
/
z
}
0.333
0.889
0.222
0.241
0.152
0.366
0.105
0.334
0.134As mentioned in former section, a valid solutionφ of a VI-optimal merge function should follow the constraint below:
(61)
φ
-
=
∪
M
~
=
1.0,0.5,0.2
x
,
1.0,0.5,0.2
y
,
1.0,0.5,0.2
z
,
φ
_
=
∩
M
~
=
0.5
y
,
φ
_
⊆
φ
⊆
φ
-
.We should only consider solutionφ that satisfies the constraint mentioned above in practical application. So, more complicated solutions could also be considered. For example, when concept y is an important concept which needs to be described explicitly in the fusion result, more details as Medium Strong relation in Table 2 should be contained to construct the description. If the concept is not treated of equal importance with single relation embedded, in this case, we’ve got two maximal VI-value of 0.491 (see Table 4). Generally, for any solution φ, we can calculate the VI-values and choose the solution based on the observation of maximal VI-value.Within the scope of this paper, a tie-breaking criterion does not always exist, the accessorial choice criterion that helps selecting a solution from the set of optimal solutions is necessary. From the observations of φ
10 and φ
19, we need to decide the merging function by actual requirement or finding a new solution with more semantic relations embedded.Table 4
VI-values of  solutions (concepty with multiple relations embedded).
φ
P
*
(
x
,
φ
(
x
)
|
M
)
P
*
(
y
,
φ
(
y
)
|
M
)
P
*
(
z
,
φ
(
z
)
|
M
)
Purity(φ
|
M)
(C
=
1.5)
E
*
(
x
,
φ
(
x
)
|
M
)
E
*
(
y
,
φ
(
y
)
|
M
)
E
*
(
z
,
φ
(
z
)
|
M
)
Entropy(φ
|
M)
VI(φ
|
M)
φ
10
=
{
0.2
/
x
,
(
0.2
,
0.5
)
/
y
,
0.2
/
z
}
0.667
0.889
0.889
0.889
0.556
0.491
0.270
0.105
0.105
0.105
0.098
φ
1
1
=
{
0.2
/
x
,
(
0.2,0.5
)
/
y
,
0.5
/
z
}
0.667
0.889
0.889
0.556
0.500
0.411
0.270
0.105
0.105
0.326
0.134
φ
1
2
=
{
0.2
/
x
,
(
0.2,0.5
)
/
y
,
1.0
/
z
}
0.667
0.889
0.889
0.222
0.445
0.354
0.270
0.105
0.105
0.334
0.136
φ
1
3
=
{
0.5
/
x
,
(
0.2,0.5
)
/
y
,
0.2
/
z
}
0.556
0.889
0.889
0.889
0.537
0.466
0.326
0.105
0.105
0.105
0.107
φ
1
4
=
{
0.5
/
x
,
(
0.2,0.5
)
/
y
,
0.5
/
z
}
0.556
0.889
0.889
0.556
0.482
0.386
0.326
0.105
0.105
0.326
0.144
φ
1
5
=
{
0.5
/
x
,
(
0.2,0.5
)
/
y
,
1.0
/
z
}
0.556
0.889
0.889
0.222
0.426
0.329
0.326
0.105
0.105
0.334
0.145
φ
1
6
=
{
1.0
/
x
,
(
0.2,0.5
)
/
y
,
0.2
/
z
}
0.333
0.889
0.889
0.889
0.500
0.424
0.366
0.105
0.105
0.105
0.114
φ
1
7
=
{
1.0
/
x
,
(
0.2,0.5
)
/
y
,
0.5
/
z
}
0.333
0.889
0.889
0.556
0.445
0.345
0.366
0.105
0.105
0.326
0.150
φ
1
8
=
{
1.0
/
x
,
(
0.2,0.5
)
/
y
,
1.0
/
z
}
0.333
0.889
0.889
0.222
0.389
0.288
0.366
0.105
0.105
0.334
0.152
φ
1
9
=
{
0.2
/
x
,
(
1.0
,
0.5
)
/
y
,
0.2
/
z
}
0.667
0.889
0.889
0.889
0.556
0.491
0.270
0.105
0.105
0.105
0.098
φ
2
0
=
{
0.2
/
x
,
(
1.0,0.5
)
/
y
,
0.5
/
z
}
0.667
0.889
0.889
0.556
0.500
0.411
0.270
0.105
0.105
0.326
0.134
φ
21
=
{
0.2
/
x
,
(
1.0,0.5
)
/
y
,
1.0
/
z
}
0.667
0.889
0.889
0.222
0.445
0.354
0.270
0.105
0.105
0.334
0.136
φ
22
=
{
0.5
/
x
,
(
1.0,0.5
)
/
y
,
0.2
/
z
}
0.556
0.889
0.889
0.889
0.537
0.466
0.326
0.105
0.105
0.105
0.107
φ
23
=
{
0.5
/
x
,
(
1.0,0.5
)
/
y
,
0.5
/
z
}
0.556
0.889
0.889
0.556
0.482
0.386
0.326
0.105
0.105
0.326
0.144
φ
24
=
{
0.5
/
x
,
(
1.0,0.5
)
/
y
,
1.0
/
z
}
0.556
0.889
0.889
0.222
0.426
0.329
0.326
0.105
0.105
0.334
0.145
φ
25
=
{
1.0
/
x
,
(
1.0,0.5
)
/
y
,
0.2
/
z
}
0.333
0.889
0.889
0.889
0.500
0.424
0.366
0.105
0.105
0.105
0.114
φ
26
=
{
1.0
/
x
,
(
1.0,0.5
)
/
y
,
0.5
/
z
}
0.333
0.889
0.889
0.556
0.445
0.345
0.366
0.105
0.105
0.326
0.150
φ
27
=
{
1.0
/
x
,
(
1.0,0.5
)
/
y
,
1.0
/
z
}
0.333
0.889
0.889
0.222
0.389
0.288
0.366
0.105
0.105
0.334
0.152More examples with considering conceptz and concept x as important concepts which needs to be describe explicitly in the fusion result, will be shown in Tables 5 and 6. When concept z and concept x are with similar scale of multiple relations embedded, we could get equivalent maximum VI-value 0.410 from φ
28 and φ
38, which means these two strategies get the same effect. If only one concept is with multiple relations embedded, we should consider φ
10 to φ
45 and get the maximum VI-value 0.491 from φ
10 or φ
19. Both the situations needs to be further selected by considering the specific application: For φ
28 and φ
38, two solutions selected strong and medium strong relations for concept z and x, so the importance of concept should be further considered, that is to say, if concept x is more importance for fusion, φ
38 should be selected. For φ
10 or φ
19, when the fusion results need to be described with more details, corresponding solution φ
10 should be selected; otherwise, φ
19 would also be a candidate selection for fusion.Table 5
VI-values of  solutions (conceptz with multiple relations embedded).
φ
P
*
(
x
,
φ
(
x
)
|
M
)
P
*
(
y
,
φ
(
y
)
|
M
)
P
*
(
z
,
φ
(
z
)
|
M
)
Purity(φ
|
M)
(C
=
1.5)
E
*
(
x
,
φ
(
x
)
|
M
)
E
*
(
y
,
φ
(
y
)
|
M
)
E
*
(
z
,
φ
(
z
)
|
M
)
Entropy(φ
|
M)
VI(φ
|
M)
φ
28
=
{
0.2
/
x
,
0.5
/
y
,
(
0.2,0.5
)
/
z
}
0.667
0.889
0.889
0.556
0.500
0.410
0.270
0.105
0.105
0.326
0.134
φ
29
=
{
0.2
/
x
,
0.5
/
y
,
(
0.2,1.0
)
/
z
}
0.667
0.889
0.889
0.222
0.445
0.355
0.270
0.105
0.105
0.334
0.136
φ
30
=
{
0.2
/
x
,
0.5
/
y
,
(
0.5,1.0
)
/
z
}
0.667
0.889
0.556
0.222
0.389
0.274
0.270
0.105
0.326
0.334
0.173
φ
31
=
{
0.5
/
x
,
0.5
/
y
,
(
0.2,0.5
)
/
z
}
0.556
0.889
0.889
0.556
0.482
0.386
0.326
0.105
0.105
0.326
0.144
φ
32
=
{
0.5
/
x
,
0.5
/
y
,
(
0.2,1.0
)
/
z
}
0.556
0.889
0.889
0.222
0.426
0.329
0.326
0.105
0.105
0.334
0.145
φ
33
=
{
0.5
/
x
,
0.5
/
y
,
(
0.5,1.0
)
/
z
}
0.556
0.889
0.556
0.222
0.371
0.250
0.326
0.105
0.326
0.334
0.182
φ
34
=
{
1.0
/
x
,
0.5
/
y
,
(
0.2,0.5
)
/
z
}
0.333
0.889
0.889
0.556
0.445
0.345
0.366
0.105
0.105
0.326
0.150
φ
35
=
{
1.0
/
x
,
0.5
/
y
,
(
0.2,1.0
)
/
z
}
0.333
0.889
0.889
0.222
0.389
0.288
0.366
0.105
0.105
0.334
0.152
φ
36
=
{
1.0
/
x
,
0.5
/
y
,
(
0.5,1.0
)
/
z
}
0.333
0.889
0.556
0.222
0.333
0.207
0.366
0.105
0.326
0.334
0.189Table 6
VI-values of  solutions (conceptx with multiple relations embedded).
φ
P
*
(
x
,
φ
(
x
)
|
M
)
P
*
(
y
,
φ
(
y
)
|
M
)
P
*
(
z
,
φ
(
z
)
|
M
)
Purity(φ
|
M)
(C
=
1.5)
E
*
(
x
,
φ
(
x
)
|
M
)
E
*
(
y
,
φ
(
y
)
|
M
)
E
*
(
z
,
φ
(
z
)
|
M
)
Entropy(φ
|
M)
VI(φ
|
M)
φ
37
=
{
(
0.2,0.5
)
/
x
,
0.5
/
y
,
0.5
/
z
}
0.667
0.556
0.889
0.556
0.445
0.331
0.270
0.326
0.105
0.326
0.171
φ
38
=
{
(
0.2,0.5
)
/
x
,
0.5
/
y
,
0.2
/
z
}
0.667
0.556
0.889
0.889
0.500
0.410
0.270
0.326
0.105
0.105
0.134
φ
39
=
{
(
0.2,0.5
)
/
x
,
0.5
/
y
,
1.0
/
z
}
0.667
0.556
0.889
0.222
0.389
0.274
0.270
0.326
0.105
0.334
0.173
φ
40
=
{
(
0.2
,
1.0
)
/
x
,
0.5
/
y
,
0.5
/
z
}
0.667
0.333
0.889
0.556
0.408
0.289
0.270
0.366
0.105
0.326
0.178
φ
41
=
{
(
0.2
,
1.0
)
/
x
,
0.5
/
y
,
0.2
/
z
}
0.667
0.333
0.889
0.889
0.463
0.372
0.270
0.366
0.105
0.105
0.136
φ
42
=
{
(
0.2
,
1.0
)
/
x
,
0.5
/
y
,
1.0
/
z
}
0.667
0.333
0.889
0.222
0.352
0.233
0.270
0.366
0.105
0.334
0.179
φ
43
=
{
(
1.0
,
0.5
)
/
x
,
0.5
/
y
,
0.5
/
z
}
0.333
0.556
0.889
0.556
0.389
0.264
0.366
0.326
0.105
0.326
0.187
φ
44
=
{
(
1.0
,
0.5
)
/
x
,
0.5
/
y
,
0.2
/
z
}
0.333
0.556
0.889
0.889
0.445
0.345
0.366
0.326
0.105
0.105
0.150
φ
45
=
{
(
1.0,0.5
)
/
x
,
0.5
/
y
,
1.0
/
z
}
0.333
0.556
0.889
0.222
0.333
0.207
0.366
0.326
0.105
0.334
0.189Figure2 shows the distribution of the VI-values with different scales of semantic relations embedded using box-and-whisker plot and evaluates the effectiveness of the merge function. The observations on partial of VI-values are presented here. The top bar stands for the maximum observation value; the bottom bar represents the lowest observation value. The bottom of the box is the lower quartile with 25% of data less than this value, the top of the box is the upper quartile with 25% of data greater than this value, and the red line in the box is the median observation value with 50% of data greater than this value. The x-axis presents the functions we examined (single relation embedded in single concept as shown in Table 3 multiple relations embedded in single concept as shown in Tables 4, 5, and 6, and the upper solution and lower solution). The y-axis presents the VI-values. By observing the range of VI-values, we see that, for all VI-values, there is a wide range of values that are achieved by different merge functions. Thus, simple strategies are not likely to work well. Observing the performance of the multiple relations embedded strategy, we see that multiple relations embedded surpassed over only one relation embedded function, as it produces very good results on VI-values we examined. Thus, it is enough to optimize merge function using different scale of multiple relations embedded in concept, to obtain high quality results.Figure 2
The distribution of VI-value with different scales of semantic relations embedded.We have not performed all the merge functions with corresponding VI-values in our illustrative example yet. The data and explanation we give above is just to show the proposed framework vividly. Now, we’ve got the conclusion that we could get a corresponding VI-value for any solution. On the other hand, we could use the VI-value to select the best solution. As our framework is flexible enough to generate shortest description containing all information found within the document sets with different levels of details depending on practical requirement. With this framework, neither the relations between the keywords nor the context of co-text will be lost. To generate a moderately fluent semantic fusion result from a collection of documents, sentence planning and regeneration are then used to combine the segments together to form a coherent whole. In our paper, the framework solved basic issues on developing a document fusion system.(
1
) The documents are fused on more levels of granularity, as we assign different weights to different semantic relations embedding in the same element of concept. (
2
) Meanwhile, taking into account semantic relations in the fusion progress ensures the readability of the fused document.


## 6. Conclusion and Future Work

We have presented a framework OMFM to map the fuzzy multisets of objects into one object. Our framework for merging multiple fuzzy multisets of documents is an interesting work, where a document set is modeled as a multiset of documents and each document is modeled as a fuzzy multiset of concepts. Also, OMFM is an extension of the work in paper [11], which could describe both uncertainty and repeatability of the natural language by using the membership degree as the semantic fuzziness of the objects. The quality measures widely used in the text mining literature are defined to quantify the result of a merge function: purity (a measure of correctness) and entropy (a measure of completeness), where the maximum purity is got by upper solution, and the minimum entropy is got by lower solution. Then, we have constructed VI-optimal merge function to get the best solution, where both the higher purity and the lower entropy could be achieved simultaneously. Moreover, we have proved the properties related to constraints of merging problem. Finally, how to settle the problem in document fusion application using OMFM has shown the practicality and effectiveness of our work.With comparatively higher theoretical value and prospect of application, object merging problem will become a hot spot of research in many domains. Future work will further focus on experimental research and applying this framework to solving more relevant problems.



---

*Source: 304537-2014-11-10.xml*