# Fuzzy Collaborative Clustering-Based Ranking Approach for Complex Objects

Authors: Shihu Liu; Xiaozhou Chen; Tauqir Ahmed Moughal; Fusheng Yu
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

This paper makes a discussion on the ranking problem of complex objects where each object is composed of some patterns described by individual attribute information as well as the relational information between patterns. This paper presents a fuzzy collaborative clustering-based ranking approach for this kind of ranking problem. In this approach, a referential object is employed to guide the ranking process. To achieve the final ranking result, fuzzy collaborative clustering is carried on the patterns in the referential object by using the collaborative information obtained from each ranked object. Since the collaborative information of ranking objects is represented by cluster centers and/or partition matrices, we give two forms of the proposed approach. With the aid of fuzzy collaborative clustering, the ranking results can be obtained by comparing the difference of the referential object before and after collaboration with respect to ranking objects. One can find that this proposed ranking approach is totally different from the previous ranking methods because of its completely collaborative clustering mechanism. Moreover, some synthetic examples show that our proposed ranking algorithm is valid.


---

## Body

## 1. Introduction

For decision makers, the goal of ranking is to discover a mechanism that induces an increasing or decreasing order over the data set of given objects to be ranked. Ranking problem appears in many fields such as information retrieval [1], selection and evaluation [2, 3], image similarity measure [4], and income distribution [5]. It can be easily found that, during the ranking process, only the attribute information is usually considered. Thereinto, the attribute information may be given by fuzzy numbers [6, 7], intuitionistic fuzzy numbers [8], or interval-valued intuitionistic fuzzy numbers [9]. Generally speaking, in these cases, the ranking problem can be regarded as a multiple criteria decision making problem [10, 11], and the detailed decision making process can be executed by many approaches [11–13].Most ranking algorithms receive attribute information and output a real-valued sequence as the ranking results. Sometimes, besides the attribute information, the relational information of the patterns is also provided for the ranking, especially in the fields of machine learning [14–16]. Up to now, there have been several developments in theory and algorithms for learning over relational information. For example, Agarwal [17] developed an algorithmic framework for learning ranking functions on graph data; Mihalcea [18] presented an innovative unsupervised method for automatic sentence extraction using graph-based ranking algorithms; Lee et al. [19] focused on the flexibility of recommendation and proposed a graph-based multidimensional recommendation method; Agarwal [20] considered the graph learning problems through ranking objects relative to one another, and so on [21, 22]. No matter what problem to investigate or which algorithm to construct, in general, the patterns that need to be sorted are described by only one kind of information: attribute information or relational information.Obviously, the above-mentioned methods are concentrated on attribute information or relational information separately. In practical terms, it is not enough when the attribute information and relational information of patterns are available at the same time. In fact, there have been many ranking problems that need to take both of these types of information into consideration, for the purpose of improving knowledge recognition degree.Bearing this in mind, in this paper, we make a discussion on the ranking problem of complex objects. Each complex object consists of some simple patterns which are described by attribute information as well as the relational information between patterns. Because of the complexity of the objects, inspired by the famous TOPSIS method [23], in our proposed ranking approach, a referential object is proposed in advance. Hereinto, the number of patterns of the referential object is the same as that of each complex object. To fully fulfill the ranking problem, the fuzzy collaborative clustering mechanism is proposed and it is carried on the patterns in the referential object by using the collaborative information. The collaborative information refers to the partition matrices and/or cluster centers with respect to the complex objects, and it can be employed freely during the ranking process. During the process of ranking, the essence of the ranking algorithm is to compare the difference of the referential object before and after collaboration with respect to the ranking objects. Throughout the ranking process, only the collaborative information participates in the sequence calculation.The remainder of this paper is organized as follows. In Section2, we recall some basic concepts, such as the mathematical description of complex object and fuzzy collaborative clustering. In Section 3, we discuss the ranking problem about complex objects when the collaborative information is cluster centers that derived from the corresponding complex object by some clustering approaches. In Section 4, the partition matrices are regarded as the collaborative information and corresponding ranking approach is constructed. In Section 5, some synthetic examples are simulated to illustrate the validity of the proposed ranking approaches. Finally, Section 6 concludes this paper.


## 2. Preliminaries

In this section, at first we introduce the concept of complex objects and then make a brief review of the fuzzy collaborative clustering algorithm. For simplicity, here we ignore the presentation of fuzzyc-means clustering algorithm [24–26], not to mention other associated research topics [27–29].


### 2.1. Mathematical Description of Complex Objects

Mathematically, the complex object can be expressed as a tupleG
=
(
X
,
E
), where X
=
{
x
1
,
x
2
,
…
,
x
n
} is a nonempty finite set and x
i for i
=
1,2
,
…
,
n are patterns, E
=
{
e
i
j
∣
i
,
j
=
1,2
,
…
,
n
} is a relational information set, and e
i
j
∈
E for i
,
j
=
1,2
,
…
,
n is the possible relational information between the patterns x
i and x
j.Formally, ifx
i
∈
X is nothing but a symbolic representation of the ith pattern, then the relational information set E can be only used during the process of data analysis. If not, the pattern x
i
∈
X can be expressed as x
i
=
(
x
i
1
,
x
i
2
,
…
,
x
i
m
), where x
i
j represents the value of x
i with respect to the attribution a
j. In general, the value x
i
j may not be a real number. Sometimes it may be a set [30], an interval [31], or a fuzzy number [32, 33], and so forth.Certainly, the foregoing proposed data representation formats are also suitable for the entries in relational information setE. Particularly, the relationship between any two patterns may be described by more than one relation; that is, E
=
{
E
1
,
E
2
,
…
,
E
k
} with k
≥
1, where E
i
∈
E describes the ith relationship between patterns. Notice that, in this paper, we adhere to the hypothesis that x
i
j for i
=
1,2
,
…
,
n and j
=
1,2
,
…
,
m is a real number, e
i
j for i
,
j
=
1,2
,
…
,
n belongs to unit interval [
0,1
], and k
=
1 for complex object G
=
(
X
,
E
).


### 2.2. Fuzzy Collaborative Clustering

It is well known that the nature of clustering analysis is to find out the potential structure of the data. If one wants to search for the common structure of some different data sets while the information of these data sets cannot be shared freely, the collaborative clustering algorithm [34, 35] plays an important role.One has that the collaborative clustering can be divided into horizontal collaborative clustering, vertical collaborative clustering, and hybrid collaborative clustering. Because we have assumed that the number of patterns for each ranking object is equal, in what follows, we will use the horizontal collaborative clustering algorithm; thus we give a brief introduction of it.Given thatX
[
1
]
,
X
[
2
]
,
…
,
X
[
p
] are p data sets, and there are n patterns in each X
[
i
i
] for i
i
=
1,2
,
…
,
p, the collaborative mechanism based objective function can be constructed as(1)
Q
i
i
=
∑
i
=
1
c
∑
k
=
1
n
u
i
k
2
i
i
d
i
k
2
i
i
+
∑
j
j
=
1
j
j
≠
i
i
p
α
i
i
,
j
j
∑
i
=
1
c
∑
k
=
1
n
u
i
k
i
i
-
u
i
k
j
j
2
d
i
k
2
i
i
,where d
i
k
[
i
i
]
=
x
k
[
i
i
]
-
v
i
[
i
i
] is the distance between the pattern x
k
[
i
i
] and the cluster center v
i
[
i
i
] in X
[
i
i
] and the nonnegative parameter α
[
i
i
,
j
j
] represents the collaborative degree of X
[
i
i
] to X
[
j
j
].The concrete optimization process of objective function in (1) is the same as that of fuzzy c-means clustering algorithm [24–26] or partial supervised fuzzy clustering algorithm [36, 37]: applying Lagrange multiplier method. Just as [35] did, the partition matrix U
[
i
i
] can be expressed as(2)
u
i
k
i
i
=
φ
i
k
i
i
1
+
ϕ
i
i
+
1
-
1
/
1
+
ϕ
i
i
∑
j
=
1
c
φ
j
k
i
i
∑
j
=
1
c
d
i
k
2
i
i
/
d
j
k
2
i
i
,where φ
i
k
[
i
i
]
=
∑
i
i
≠
j
j
α
[
i
i
,
j
j
]
u
i
k
[
i
i
] and ϕ
[
i
i
]
=
∑
i
i
≠
j
j
α
[
i
i
,
j
j
]. Similarly, the cluster centers can be expressed as(3)
v
i
k
i
i
=
A
i
k
i
i
+
C
i
k
i
i
B
i
i
i
+
D
i
i
i
,where(4)
A
i
k
i
i
=
∑
j
=
1
n
u
i
j
2
i
i
x
j
k
,
B
i
i
i
=
∑
j
=
1
n
u
i
j
2
i
i
,
C
i
k
i
i
=
∑
j
j
=
1
j
j
≠
i
i
p
α
i
i
,
j
j
∑
j
=
s
n
u
i
j
i
i
-
u
i
j
j
j
2
x
j
k
,
D
i
i
i
=
∑
j
j
=
1
j
j
≠
i
i
p
α
i
i
,
j
j
∑
j
=
s
n
u
i
j
i
i
-
u
i
j
j
j
2
.In fact, the process of collaborative clustering can be partitioned into two phases: the first stage is to execute fuzzyc-means clustering algorithm for each data set X
[
i
i
] separately, in which case we can obtain partition matrix U
[
i
i
] and cluster centers V
[
i
i
]. The second stage is to compute the collaborated partition matrix by (2) and the cluster centers by (3).


## 2.1. Mathematical Description of Complex Objects

Mathematically, the complex object can be expressed as a tupleG
=
(
X
,
E
), where X
=
{
x
1
,
x
2
,
…
,
x
n
} is a nonempty finite set and x
i for i
=
1,2
,
…
,
n are patterns, E
=
{
e
i
j
∣
i
,
j
=
1,2
,
…
,
n
} is a relational information set, and e
i
j
∈
E for i
,
j
=
1,2
,
…
,
n is the possible relational information between the patterns x
i and x
j.Formally, ifx
i
∈
X is nothing but a symbolic representation of the ith pattern, then the relational information set E can be only used during the process of data analysis. If not, the pattern x
i
∈
X can be expressed as x
i
=
(
x
i
1
,
x
i
2
,
…
,
x
i
m
), where x
i
j represents the value of x
i with respect to the attribution a
j. In general, the value x
i
j may not be a real number. Sometimes it may be a set [30], an interval [31], or a fuzzy number [32, 33], and so forth.Certainly, the foregoing proposed data representation formats are also suitable for the entries in relational information setE. Particularly, the relationship between any two patterns may be described by more than one relation; that is, E
=
{
E
1
,
E
2
,
…
,
E
k
} with k
≥
1, where E
i
∈
E describes the ith relationship between patterns. Notice that, in this paper, we adhere to the hypothesis that x
i
j for i
=
1,2
,
…
,
n and j
=
1,2
,
…
,
m is a real number, e
i
j for i
,
j
=
1,2
,
…
,
n belongs to unit interval [
0,1
], and k
=
1 for complex object G
=
(
X
,
E
).


## 2.2. Fuzzy Collaborative Clustering

It is well known that the nature of clustering analysis is to find out the potential structure of the data. If one wants to search for the common structure of some different data sets while the information of these data sets cannot be shared freely, the collaborative clustering algorithm [34, 35] plays an important role.One has that the collaborative clustering can be divided into horizontal collaborative clustering, vertical collaborative clustering, and hybrid collaborative clustering. Because we have assumed that the number of patterns for each ranking object is equal, in what follows, we will use the horizontal collaborative clustering algorithm; thus we give a brief introduction of it.Given thatX
[
1
]
,
X
[
2
]
,
…
,
X
[
p
] are p data sets, and there are n patterns in each X
[
i
i
] for i
i
=
1,2
,
…
,
p, the collaborative mechanism based objective function can be constructed as(1)
Q
i
i
=
∑
i
=
1
c
∑
k
=
1
n
u
i
k
2
i
i
d
i
k
2
i
i
+
∑
j
j
=
1
j
j
≠
i
i
p
α
i
i
,
j
j
∑
i
=
1
c
∑
k
=
1
n
u
i
k
i
i
-
u
i
k
j
j
2
d
i
k
2
i
i
,where d
i
k
[
i
i
]
=
x
k
[
i
i
]
-
v
i
[
i
i
] is the distance between the pattern x
k
[
i
i
] and the cluster center v
i
[
i
i
] in X
[
i
i
] and the nonnegative parameter α
[
i
i
,
j
j
] represents the collaborative degree of X
[
i
i
] to X
[
j
j
].The concrete optimization process of objective function in (1) is the same as that of fuzzy c-means clustering algorithm [24–26] or partial supervised fuzzy clustering algorithm [36, 37]: applying Lagrange multiplier method. Just as [35] did, the partition matrix U
[
i
i
] can be expressed as(2)
u
i
k
i
i
=
φ
i
k
i
i
1
+
ϕ
i
i
+
1
-
1
/
1
+
ϕ
i
i
∑
j
=
1
c
φ
j
k
i
i
∑
j
=
1
c
d
i
k
2
i
i
/
d
j
k
2
i
i
,where φ
i
k
[
i
i
]
=
∑
i
i
≠
j
j
α
[
i
i
,
j
j
]
u
i
k
[
i
i
] and ϕ
[
i
i
]
=
∑
i
i
≠
j
j
α
[
i
i
,
j
j
]. Similarly, the cluster centers can be expressed as(3)
v
i
k
i
i
=
A
i
k
i
i
+
C
i
k
i
i
B
i
i
i
+
D
i
i
i
,where(4)
A
i
k
i
i
=
∑
j
=
1
n
u
i
j
2
i
i
x
j
k
,
B
i
i
i
=
∑
j
=
1
n
u
i
j
2
i
i
,
C
i
k
i
i
=
∑
j
j
=
1
j
j
≠
i
i
p
α
i
i
,
j
j
∑
j
=
s
n
u
i
j
i
i
-
u
i
j
j
j
2
x
j
k
,
D
i
i
i
=
∑
j
j
=
1
j
j
≠
i
i
p
α
i
i
,
j
j
∑
j
=
s
n
u
i
j
i
i
-
u
i
j
j
j
2
.In fact, the process of collaborative clustering can be partitioned into two phases: the first stage is to execute fuzzyc-means clustering algorithm for each data set X
[
i
i
] separately, in which case we can obtain partition matrix U
[
i
i
] and cluster centers V
[
i
i
]. The second stage is to compute the collaborated partition matrix by (2) and the cluster centers by (3).


## 3. Cluster Center-Based Ranking Approach for Complex Objects

Here, we pay our attention to the construction of ranking algorithm when the collaborative information of each complex object is provided in terms of cluster centers. For all ranking objectsG
(
1
)
,
G
(
2
)
,
…
,
G
(
p
), we suppose that they have the same number of patterns, as well as the referential object G.In the approach to be given in this section, there are three kinds of collaborative information, producing corresponding cluster center matrices:(
1
) if it is derived from the attribute information of complex object G
(
i
i
), then we apply V
˙
[
i
i
] to denote the collaborative information; (
2
) if it is derived from the relational information of complex object G
(
i
i
), then we apply V
¨
[
i
i
] to denote the collaborative information; (
3
) if it is derived from both of the attribute information and relational information of the complex object G
(
i
i
), then we apply V
˘
[
i
i
] to denote the collaborative information. It should be noted that if the collaborative information is composed of two irrelative parts (one is derived from attribute information and another is derived from relational information), then {
V
˙
[
i
i
]
,
V
¨
[
i
i
]
} comes naturally. Certainly, the information contained in these matrices can be combined to be embedded in collaborative fuzzy c-means clustering.With the above description, one knows that the collaborative information has at least three possible representation types, and different type represents different meaning. No matter which types the collaborative information belongs to, once the collaborative mechanism is introduced to rank the objectsG
(
i
i
) for i
i
=
1,2
,
…
,
p, the objective function of G collaborated by G
(
i
i
) can be constructed as follows:(5)
Q
G
,
G
i
i
=
∑
i
=
1
c
∑
k
=
1
n
u
i
k
2
d
2
x
k
,
v
i
+
β
i
i
∑
i
=
1
c
T
i
i
,
i
,where d
(
x
k
,
v
i
)
=
x
k
-
v
i is the distance between pattern x
k and center v
i and β
[
i
i
]
=
(
β
[
i
i
,
1
]
,
β
[
i
i
,
2
]
,
β
[
i
i
,
3
]
) is a label function with respect to the collaborative information. Moreover, T
[
i
i
,
i
] is the distance between v
i
∈
V and the collaborative information V
[
i
i
]:(6)
T
i
i
,
i
=
∑
j
=
1
c
1
v
i
-
v
˙
j
i
i
2
∑
j
=
1
c
2
v
i
-
v
¨
j
i
i
2
∑
j
=
1
c
3
v
i
-
v
˘
j
i
i
2
.Obviously, in (5) β
[
i
i
]
∑
i
=
1
c
T
[
i
i
,
i
] describes the collaboration influence of G
(
i
i
) on G, and parameter β
[
i
i
] can be viewed as the collaborative coefficient that is relevant to the types of collaborative information. Meanwhile, (6) represents the distances between the cluster center v
i of referential object G and the cluster center v
i
[
i
i
] of complex object G
(
i
i
).Remark 1.
The collaborative coefficientβ
[
i
i
] can be determined from the types of the collaborative information:(i)
If the collaborative information isV
˙
[
i
i
], then β
[
i
i
,
2
]
=
β
[
i
i
,
3
]
=
0 and β
[
i
i
,
1
]
≠
0.
(ii)
If the collaborative information isV
¨
[
i
i
], then β
[
i
i
,
1
]
=
β
[
i
i
,
3
]
=
0 and β
[
i
i
,
2
]
≠
0.
(iii)
If the collaborative information isV
˘
[
i
i
], then β
[
i
i
,
1
]
=
β
[
i
i
,
2
]
=
0 and β
[
i
i
,
3
]
≠
0.
(iv)
If the collaborative information is{
V
˙
[
i
i
]
,
V
¨
[
i
i
]
}, then β
[
i
i
,
3
]
=
0, but β
[
i
i
,
1
]
≠
0 and β
[
i
i
,
2
]
≠
0.As can be seen from Remark1, the types of collaborative information can determine which component of β
[
i
i
] is equal to 0, but the value of other nonzero components is not provided. No matter which types of collaborative information, that is, the collaborative information is V
˙
[
i
i
], V
¨
[
i
i
], V
˘
[
i
i
], and/or {
V
˙
[
i
i
]
,
V
¨
[
i
i
]
}, the concrete value of β
[
i
i
] depends entirely on the requirement of practical ranking problem, and it can be calculated by many methods.So far, one can regard the objective function in (5) as an optimization problem with the constraint ∑
i
=
1
c
u
i
k
=
1. In what follows, we still apply the Lagrange multiplier method to solve it. At first, the Lagrange function of (5) can be rewritten as(7)
L
λ
G
,
G
i
i
=
∑
i
=
1
c
u
i
k
2
d
2
x
k
,
v
i
+
β
i
i
∑
i
=
1
c
T
i
i
,
i
-
λ
∑
i
=
1
c
u
i
k
-
1
.Computing the derivative ofL
λ
(
G
,
G
(
i
i
)
) with respect to u
i
k and making it equal to 0, we have(8)
∂
L
λ
G
,
G
i
i
∂
u
i
k
=
2
u
i
k
d
2
x
k
,
v
i
-
λ
=
0
,
(9)
u
i
k
=
λ
2
d
2
x
k
,
v
i
.On account of the constraint ∑
i
=
1
c
u
i
k
=
1, we have that the Lagrange multiplier λ can be determined as(10)
λ
=
1
∑
i
=
1
c
2
d
2
x
k
,
v
i
-
1
.Inserting the expression of the above into (9) yields(11)
u
i
k
=
∑
j
=
1
c
x
k
-
v
i
x
k
-
v
j
2
-
1
.The computations of the cluster centers are straightforward, as no constraints are imposed on them. By executing the derivation of (5) with respect to variant v
i, and letting the result be equal to 0, then we have that(12)
∂
Q
∂
v
i
=
-
2
∑
k
=
1
n
u
i
k
2
x
k
-
v
i
+
β
i
i
∂
T
i
i
,
i
∂
v
i
=
0
.For the solving of ∂
T
[
i
i
,
i
]
/
∂
v
i, by (6), we have that(13)
∂
T
i
i
,
i
∂
v
i
=
2
∑
j
=
1
c
1
v
i
-
v
˙
j
i
i
∑
j
=
1
c
2
v
i
-
v
¨
j
i
i
∑
j
=
1
c
3
v
i
-
v
˘
j
i
i
.Therefore, taking (10) into (9) yields(14)
v
i
=
∑
k
=
1
n
u
i
k
2
x
k
+
ϕ
2
i
i
∑
k
=
1
n
u
i
k
2
+
ϕ
1
i
i
,where ϕ
1
(
i
i
)
=
β
[
i
i
,
1
]
c
1
+
β
[
i
i
,
2
]
c
2
+
β
[
i
i
,
3
]
c
3 and ϕ
2
(
i
i
)
=
β
[
i
i
,
1
]
∑
j
=
1
c
1
v
˙
j
[
i
i
]
+
β
[
i
i
,
2
]
∑
j
=
1
c
2
v
¨
j
[
i
i
]
+
β
[
i
i
,
3
]
∑
j
=
1
c
3
v
˘
j
[
i
i
].Up to now, the partition matrixU
[
i
i
] in (11) and the cluster centers V
[
i
i
] in (14) can be used to describe the clustering results of referential object G under the collaboration of complex object G
(
i
i
). Notice that, throughout this section, the notation “V
[
i
i
]” denotes the cluster centers or collaborative information of the ranking object G
(
i
i
). To avoid unnecessary ambiguity, in the rest of this subsection, we apply V
G
[
i
i
] to replace the computing results of (14).By the collaboration ofG
(
i
i
), one can obtain the new partition matrix U
[
i
i
] and cluster centers V
G
[
i
i
] of the referential data G. Certainty, if the difference of U
[
i
i
] and U is smaller, then we can say that G and G
(
i
i
) have a bigger similarity in aspects of partition matrix. Similarly, if the difference of V
[
i
i
] and V
G
[
i
i
] is smaller, then we can say that G and G
(
i
i
) have a bigger similarity in aspect of cluster center.Bearing this in mind, the equation(15)
S
V
V
,
V
G
i
i
=
∑
v
∈
V
∑
v
i
∈
V
G
i
i
s
v
,
v
i
V
V
G
i
ican be used to compute the similarity of V
G
[
i
i
] and V about the referential object G, where s
(
v
,
v
i
) represents the similarity of v
∈
V and v
i
∈
V
G
[
i
i
], and can be calculated by many methods [38]. Similarly, the equation(16)
S
U
U
,
U
i
i
=
∑
i
=
1
c
∑
k
=
1
n
u
i
k
u
i
k
i
i
U
U
i
ican be used to calculate the similarity of U and U
[
i
i
], where U
[
i
i
]
=
∑
i
=
1
c
∑
k
=
1
n
u
i
k
2
[
i
i
]. By (15) and (16), the similarity of clustering results of referential object G before and after collaboration of G
(
i
i
) can be determined by the following equation:(17)
S
G
,
G
i
i
=
S
U
2
U
,
U
i
i
+
S
V
2
V
,
V
G
i
i
S
U
U
,
U
i
i
+
S
V
V
,
V
G
i
i
.Obviously, if the similarity betweenG and G
(
i
i
) is greater than that of G and G
(
j
j
), then G
(
i
i
) is nearer to G than the object G
(
j
j
) in aspects of collaborative information. Therefore, complex object G
(
i
i
) should be sorted in front of complex object G
(
j
j
). So much for this, the collaborative clustering-based ranking approach for complex objects can be summarized in Algorithm 1.Algorithm 1:Cluster center-based ranking approach for complex objects.
Input: referential object G; collaborative information V
[
i
i
], β
[
i
i
] for i
i
=
1,2
,
…
,
p; ε, η.
Output: possible sequence G
(
i
1
)
≽
G
i
2
≽
⋯
≽
G
(
i
q
).
begin
(1) Compute the partition matrixU and cluster center V of G by some clustering algorithm.
(2) For each objectG
(
i
i
), compute the partition matrix U
[
i
i
] by (11) and the cluster center V
G
[
i
i
] by (14).
(3) For each objectG
(
i
i
), compute the similarity of clustering results about the referential
objectG before and after collaboration of complex object G
(
i
i
) by (17).
(4) Compare the results computed by (17): if S
(
G
,
G
(
i
i
)
)
⩾
S
(
G
,
G
(
j
j
)
), then G
(
i
i
)
≽
G
(
j
j
), otherwise G
(
j
j
)
≻
G
(
i
i
).
end


## 4. Partition Matrix-Based Ranking Approach for Complex Objects

In the partition matrix-based ranking approach for complex objects, the collaborative information provided by each ranking object is the corresponding partition matrix. Similarly, we suppose that the referential objectG and the ranking object G
(
i
i
) for i
i
=
1,2
,
…
,
p have the same number of patterns.Similar to what was discussed in Section3, there are three kinds of collaborative information, producing corresponding partition matrices: (
1
) if it is derived from the attribute information of G
(
i
i
), then we apply U
˙
[
i
i
]
=
u
˙
i
k
i
i
c
1
×
n to denote the collaborative information; (
2
) if it is derived from the relational information of G
(
i
i
), then we apply U
¨
[
i
i
]
=
u
¨
i
k
i
i
c
2
×
n to denote the collaborative information; (
3
) and if it is derived from both of the attribute information and relational information of G
(
i
i
), then we apply U
˘
[
i
i
]
=
u
˘
i
k
i
i
c
3
×
n to denote the collaborative information. Certainly, if the collaborative information is composed of two irrelative parts (one is derived from attribute information and another is derived from relational information), then U
˙
[
i
i
]
,
U
¨
[
i
i
] comes naturally.In terms of the cluster center numbersc, c
1, c
2, and c
3, one has c
=
c
i and c
≠
c
i. Because of the complexity of the representation of collaborative information U
˙
[
i
i
]
,
U
¨
[
i
i
], at first we make a discussion on U
˙
[
i
i
], U
¨
[
i
i
], and U
˘
[
i
i
], respectively. By the description of collaborative clustering, if c
=
c
i, then the objective function can be constructed as follows:(18)
Q
G
,
G
i
i
=
∑
i
=
1
c
∑
k
=
1
n
u
i
k
2
d
2
x
k
,
v
i
+
δ
i
i
∑
i
=
1
c
∑
k
=
1
n
u
i
k
-
u
i
k
i
i
2
d
2
x
k
,
v
i
,where δ
[
i
i
] is the decision maker’s confidence for the collaborative information.Obviously, in (18) the part δ
[
i
i
]
∑
i
=
1
c
∑
k
=
1
n
u
i
k
-
u
i
k
i
i
2
d
2
(
x
k
,
v
i
) is the collaboration of G
(
i
i
) to G, and δ
[
i
i
] can be viewed as the collaborative coefficient. Note that the mechanism of parameter δ
[
i
i
] is the same as that of parameter β
[
i
i
].Ifc
≠
c
i, the objective function in (18) will be invalid. By taking the fact that each row of the partition matrix represents the classification distribution as well as the concept of proximity proposed in [39, 40] into consideration, here (18) can be rewritten as follows:(19)
Q
G
,
G
i
i
=
∑
i
=
1
c
∑
k
=
1
n
u
i
k
2
d
2
x
k
,
v
i
+
δ
i
i
∑
k
=
1
n
∑
s
=
1
n
p
i
k
-
p
i
k
i
i
2
d
2
x
k
,
x
s
,where p
k
s and p
k
s
[
i
i
] can be computed by formula p
i
j
=
∑
k
=
1
c
u
k
i
∧
u
k
j. Up to now, under the constraint ∑
i
=
1
c
u
i
k
=
1, the objective function in (19) can be solved by Lagrange multiplier method.Next, we discuss the problem of how to construct the objective function when the collaborative information isU
˙
[
i
i
]
,
U
¨
[
i
i
]. By taking c
=
c
i and c
≠
c
i into consideration, the objective function can be constructed as(20)
Q
G
,
G
i
i
=
∑
i
=
1
c
∑
k
=
1
n
u
i
k
2
d
2
x
k
,
v
i
+
δ
i
i
∑
k
=
1
n
∑
s
=
1
n
Δ
i
k
i
i
d
2
x
k
,
v
s
+
γ
i
i
∑
k
=
1
n
∑
s
=
1
n
∇
i
k
i
i
d
2
x
k
,
v
s
,where δ
[
i
i
]
=
(
δ
[
i
i
,
1
]
,
δ
[
i
i
,
2
]
,
δ
[
i
i
,
3
]
) is a label function with respect to c
=
c
i and γ
[
i
i
]
=
(
γ
[
i
i
,
1
]
,
γ
[
i
i
,
2
]
,
γ
[
i
i
,
3
]
) is also a label function with respect to c
≠
c
i. Moreover, Δ
k
s
[
i
i
] can be defined as(21)
Δ
k
s
i
i
=
u
i
k
-
u
˙
i
k
i
i
2
u
i
k
-
u
¨
i
k
i
i
2
u
i
k
-
u
˘
i
k
i
i
2and ∇
k
s
[
i
i
] that represents the distance between objects x
k and x
s can be defined as(22)
∇
k
s
i
i
=
p
k
s
-
u
˙
k
s
i
i
2
p
k
s
-
p
¨
k
s
i
i
2
p
k
s
-
p
˘
k
s
i
i
2
,where p
˙
k
s
[
i
i
], p
¨
k
s
[
i
i
], and p
˘
k
s
[
i
i
] can be determined by formula p
i
j
=
∑
k
=
1
c
u
k
i
∧
u
k
j.Remark 2.
Similarly, (18)–(22) describe the collaboration of complex object G
(
i
i
) to the referential object G. The collaborative coefficient δ
[
i
i
] and γ
[
i
i
] can be determined from the types of the collaborative information:(i)
The collaborative information isU
˙
[
i
i
]: if c
=
c
1, then there is only δ
[
i
i
,
1
]
≠
0; otherwise there is only γ
[
i
i
,
1
]
≠
0.
(ii)
The collaborative information isU
¨
[
i
i
]: if c
=
c
2, then there is only δ
[
i
i
,
2
]
≠
0; otherwise there is only γ
[
i
i
,
2
]
≠
0.
(iii)
The collaborative information isU
˘
[
i
i
]: if c
=
c
3, then there is only δ
[
i
i
,
3
]
≠
0; otherwise there is only γ
[
i
i
,
3
]
≠
0.
(iv)
The collaborative information isU
˙
[
i
i
]
,
U
¨
[
i
i
]: if c
=
c
1 and c
=
c
2, then there are only δ
[
i
i
,
1
]
≠
0 and δ
[
i
i
,
2
]
≠
0; if c
1
≠
c and c
2
≠
c, then there are only γ
[
i
i
,
1
]
≠
0 and γ
[
i
i
,
2
]
≠
0; if c
1
=
c and c
2
≠
c, then there are only δ
[
i
i
,
1
]
≠
0 and γ
[
i
i
,
2
]
≠
0; if c
1
≠
c and c
2
=
c, then there are only γ
[
i
i
,
1
]
≠
0 and δ
[
i
i
,
2
]
≠
0.Evidently, types of collaborative information have a critical implication for the value selection of parametersδ
[
i
i
] and γ
[
i
i
]. No matter which types it belongs to, the parameters can be predetermined or provided by decision makers during the process of ranking.Just as described in foregoing sections, next we still employ the Lagrange multiplier method to solve the ranking problem based on (20). Let the Lagrange function of (20) be(23)
L
λ
G
,
G
i
i
=
∑
i
=
1
c
u
i
k
2
d
2
x
k
,
v
i
+
δ
i
i
∑
i
=
1
c
Δ
i
k
i
i
d
2
x
k
,
v
i
+
γ
i
i
∑
i
=
1
c
∇
i
k
i
i
d
2
x
k
,
x
s
-
λ
∑
i
=
1
c
u
i
k
-
1
,where λ is the Lagrange multiplier.Computing the derivative ofL
λ
(
G
,
G
(
i
)
) with respect to u
i
k and making it equal to 0, we have(24)
∂
L
λ
∂
u
i
k
=
γ
i
i
∑
s
=
1
n
∂
∇
k
s
i
i
∂
u
i
k
d
2
x
k
,
x
s
+
δ
i
i
∂
Δ
k
s
i
i
∂
u
i
k
d
2
x
k
,
v
i
+
2
u
i
k
d
2
x
k
,
v
i
-
λ
=
0
.In addition, taking (21) into variant Δ
i
k
[
i
i
], we have(25)
∂
Δ
p
s
i
i
∂
u
i
k
=
2
u
i
k
-
u
˙
i
k
i
i
u
i
k
-
u
¨
i
k
i
i
u
i
k
-
u
˘
i
k
i
i
.Similarly, by computing, we have(26)
∂
∇
p
s
i
i
∂
u
i
k
=
2
p
k
s
-
p
˙
k
s
i
i
p
k
s
-
p
¨
k
s
i
i
p
k
s
-
p
˘
k
s
i
i
∂
p
k
s
i
i
∂
u
i
k
,where ∂
p
k
s
[
i
i
]
/
∂
u
i
k
=
1 if s
∈
Γ; otherwise ∂
p
k
s
[
i
i
]
/
∂
u
i
k
=
0. Note that Γ is an index set and can be described as k
0
∈
Γ if and only if there exists one k
0
∈
{
1,2
,
…
,
n
} such that u
i
k
≤
u
i
k
0 and ⋁
i
≠
j
c
(
u
j
k
∧
u
j
k
0
)
⩽
u
i
k
∧
u
i
k
0. Taking (26) and (25) into (24), we have that(27)
λ
=
2
u
i
k
x
k
-
v
i
2
+
2
d
2
x
k
,
v
i
∑
j
=
1
3
δ
i
i
,
j
u
i
k
+
ϕ
i
i
,
k
-
2
δ
i
i
d
2
x
k
,
v
i
U
i
i
,
i
,
k
,where U
[
i
i
,
i
,
k
]
=
u
˙
i
k
i
i
,
u
¨
i
k
i
i
,
u
˘
i
k
i
i
T and(28)
ϕ
i
i
,
k
=
2
γ
i
i
∑
s
∈
T
p
k
s
-
p
˙
k
s
i
i
p
k
s
-
p
¨
k
s
i
i
p
k
s
-
p
˘
k
s
i
i
d
2
x
k
,
x
s
.Obviously, (27) can be rewritten as(29)
u
i
k
=
λ
-
φ
1
i
i
,
i
,
k
2
x
k
-
v
i
2
φ
2
i
i
,where φ
1
(
i
i
,
i
,
k
)
=
ϕ
(
i
i
,
k
)
-
2
δ
[
i
i
]
x
k
-
v
i
2
U
[
i
i
,
i
,
k
] and φ
2
[
i
i
]
=
1
+
∑
t
=
1
3
δ
[
i
i
,
t
]. By taking the above equation into constraint ∑
i
=
1
c
u
i
k
=
1, we have that(30)
λ
=
1
+
∑
i
=
1
c
φ
1
i
i
,
i
,
k
/
2
d
2
x
k
,
v
i
φ
2
i
i
∑
i
=
1
c
1
/
2
d
2
x
k
,
v
i
φ
2
i
i
.Taking (30) into (27), we have(31)
u
i
k
=
1
+
∑
j
=
1
c
φ
1
i
i
,
j
,
k
-
φ
1
i
i
,
i
,
k
/
2
d
2
x
k
,
v
i
φ
2
i
i
∑
i
=
1
c
d
2
x
k
,
v
i
/
d
2
x
k
,
v
j
.The computation of the cluster centers is straightforward, as no constraints are imposed on them. By executing the derivation of (20) with respect to variant v
i, and letting the result be equal to 0, then we have that(32)
∑
k
=
1
n
u
i
k
2
x
k
-
v
i
+
δ
i
i
∑
k
=
1
n
Δ
i
k
i
i
x
k
-
v
i
=
0
,which yields(33)
v
i
=
∑
k
=
1
n
u
i
k
2
x
k
+
δ
i
i
∑
k
=
1
n
Δ
i
k
i
i
x
k
∑
k
=
1
n
u
i
k
2
+
δ
i
i
∑
k
=
1
n
Δ
i
k
i
i
.Up to now, the partition matrix determined by (31) and the cluster centers determined by (33) can be applied to describe the clustering results of the referential object G under the collaboration of complex object G
(
i
i
). Notice that, throughout this section, the notation “U
[
i
i
]” denotes the partition matrix or the collaborative information of the complex object G
(
i
i
). To avoid unnecessary ambiguity, in the rest of this subsection, we apply U
G
[
i
i
] to describe the computing results of (31).Similarly, the similarity betweenG and G
(
i
i
) can be determined by equation(34)
S
G
,
G
i
=
S
V
2
V
,
V
i
i
+
S
U
2
U
,
U
G
i
i
S
V
V
,
V
i
i
+
S
U
U
,
U
G
i
i
.So much for this, the collaborative clustering-based ranking approach for complex objects can be summarized in Algorithm 2.Algorithm 2:Partition matrix-based ranking approach for complex objects.
Input: referential object G; collaborative information U
[
i
i
], δ
[
i
i
] and γ
[
i
i
] for i
i
=
1,2
,
…
,
p; ε, η.
Output: possible sequence G
(
i
1
)
≽
G
i
2
≽
⋯
≽
G
(
i
q
).
begin
(1) Compute the partition matrixU and cluster center V of G by some clustering algorithm.
(2) For each objectG
(
i
i
), compute the partition matrix U
G
[
i
i
] by (31) and the cluster center V
[
i
i
] by (33).
(3) For each objectG
(
i
i
), compute the similarity of clustering results about G before and
after collaboration of objectG
(
i
i
) by (34).
(4) Compare the results computed by (34): if S
(
G
,
G
(
i
i
)
)
⩾
S
(
G
,
G
(
j
j
)
), then G
(
i
i
)
≽
G
(
j
j
), otherwise G
(
j
j
)
≻
G
(
i
i
).
end


## 5. Experimental Studies

In this section, we make an experimental analysis about the proposed ranking approaches for complex objects by simulating some data sets.


### 5.1. Example of Cluster Center-Based Ranking Approach

Given thatG
(
i
i
) for i
i
=
1,2
,
…
,
5 are ranking objects, and G is the referential object, Figures 1 and 2 show the attribute information and the partition matrix of G, respectively. The cluster centers V of the referential object G are v
1
=
(
6.5,2.9
), v
2
=
(
5.5,2.8
), and v
3
=
(
5.3,2.4
). The collaborative information of complex objects V
˘
[
i
i
] for i
i
=
1,2
,
…
,
5 is listed in Table 1.Table 1
The collaborative information provided by complex objects.
G
(
1
)
G
(
2
)
G
(
3
)
G
(
4
)
G
(
5
)
v
1
5.3
2.5
5.0
3.0
5.0
3.3
5.3
3.3
5.0
3.4
v
2
5.0
3.3
5.1
2.5
5.3
2.5
6.6
2.9
6.5
2.9
v
3
6.0
2.0
6.2
2.8
5.3
2.5Figure 1
The attribute information of referential objectG.Figure 2
The partition matrixU of referential object G.Since the cluster number of referential objectG is c
=
3 and the collaborative information is V
˘
[
i
i
], β
[
i
i
,
1
]
=
β
[
i
i
,
2
]
=
0 holds. For the determination of β
[
i
i
,
3
], here we use the following formula: (35)
β
i
i
,
3
=
1
if
c
=
c
3
c
∧
c
3
c
∨
c
3
if
c
≠
c
3
.Based on this, parameter β
[
i
i
] can be expressed as (
0,0
,
1
) for G
(
1
), G
(
2
), and G
(
4
) and (
0,0
,
2
/
3
) for G
(
3
) and G
(
5
).By computing, we can obtain the new partition matrix of referential objectG under the collaboration of the ranking objects (shown in Figure 3) and the cluster centers (listed in Table 2).Table 2
The new cluster centers of the referential objectG.
G
(
1
)
G
(
2
)
G
(
3
)
G
(
4
)
G
(
5
)
v
1
5.3
2.5
5.0
3.0
5.0
3.3
5.3
3.3
5.0
3.4
v
2
5.0
3.3
5.1
2.5
5.3
2.5
6.6
2.9
6.5
2.9
v
3
6.0
2.0
6.2
2.8
5.3
2.5Figure 3
The new partition matrix of the referential objectG.According to the description of Algorithm1, we have(36)
S
V
,
V
G
1
=
0.9940
,
S
V
,
V
G
2
=
0.9979
,
S
V
,
V
G
3
=
0.9945
,
S
V
,
V
G
4
=
0.9973
,
S
V
,
V
G
5
=
0.9934
,
S
U
,
U
1
=
0.7779
,
S
U
,
U
2
=
0.7816
,
S
U
,
U
3
=
0.7798
,
S
U
,
U
4
=
0.7783
,
S
U
,
U
5
=
0.7909
.Hence, if we take the cluster centers into consideration, then we have(37)
G
2
≻
G
4
≻
G
3
≻
G
1
≻
G
5
;if we take the partition matrix into consideration, then we have(38)
G
5
≻
G
2
≻
G
3
≻
G
4
≻
G
1
;if we follow the route of Algorithm 1, then there holds(39)
G
5
≻
G
2
≻
G
4
≻
G
3
≻
G
1
.


### 5.2. Example of Partition Matrix-Based Ranking Approach

In this part, the referential objectG is the same as that in Section 5.1. For the ranking objects G
(
i
i
) for i
i
=
1,2
,
…
,
5, Figure 4 gives its collaborative information, and the collaborative information for i
i
=
1,2
,
…
,
5 is U
˘
[
i
i
].Figure 4
The provided collaborative information: partition matrix.Because the cluster number of referential objectG is c
=
3 and the collaborative information is U
˘
[
i
i
], then δ
[
i
i
,
1
]
=
δ
[
i
i
,
2
]
=
0 and γ
[
i
i
,
1
]
=
γ
[
i
i
,
2
]
=
0. For the determination of δ
[
i
i
,
3
] and γ
[
i
i
,
3
], we apply the following formulas: (40)
δ
i
i
,
3
=
1
if
c
=
c
3
c
∧
c
3
c
∨
c
3
if
c
≠
c
3
,
γ
i
i
,
3
=
1
if
c
=
c
3
c
∧
c
3
c
∨
c
3
if
c
≠
c
3
.For this, the label functions are δ
[
i
i
]
=
(
0,0
,
1
) and γ
[
i
i
]
=
(
0,0
,
1
). By computing, the new partition matrix and cluster centers of the referential object G are listed in Figure 5 and Table 3.Table 3
The new cluster centers of the referential objectG.
V
[
1
]
V
[
2
]
V
[
3
]
V
[
4
]
V
[
5
]
v
1
5.18
3.12
6.37
3.01
5.77
2.99
5.65
2.74
5.70
2.93
v
2
5.75
3.16
5.11
3.14
5.08
3.30
5.09
3.31
5.33
3.19
v
3
6.05
2.90
5.90
2.90
6.24
2.81
6.43
2.93
6.21
2.93Figure 5
The new partition matrix of the referential objectG.Up to now, by computing, we have(41)
S
V
,
V
1
=
0.9973
,
S
V
,
V
2
=
0.9976
,
S
V
,
V
3
=
0.9963
,
S
V
,
V
4
=
0.9965
,
S
V
,
V
5
=
0.9978
,
S
U
,
U
1
=
0.5849
,
S
U
,
U
2
=
0.7005
,
S
U
,
U
3
=
0.7001
,
S
U
,
U
4
=
0.7767
,
S
U
,
U
5
=
0.7371
.Similarly, if only the partition matrix is considered, then we have(42)
G
4
≻
G
5
≻
G
2
≻
G
3
≻
G
1
;if only the cluster centers are considered, then we have(43)
G
5
≻
G
2
≻
G
1
≻
G
4
≻
G
3
;and if we apply Algorithm 2 to compute the possible sequence of the complex objects, which yields(44)
G
4
≻
G
5
≻
G
2
≻
G
3
≻
G
1
.


## 5.1. Example of Cluster Center-Based Ranking Approach

Given thatG
(
i
i
) for i
i
=
1,2
,
…
,
5 are ranking objects, and G is the referential object, Figures 1 and 2 show the attribute information and the partition matrix of G, respectively. The cluster centers V of the referential object G are v
1
=
(
6.5,2.9
), v
2
=
(
5.5,2.8
), and v
3
=
(
5.3,2.4
). The collaborative information of complex objects V
˘
[
i
i
] for i
i
=
1,2
,
…
,
5 is listed in Table 1.Table 1
The collaborative information provided by complex objects.
G
(
1
)
G
(
2
)
G
(
3
)
G
(
4
)
G
(
5
)
v
1
5.3
2.5
5.0
3.0
5.0
3.3
5.3
3.3
5.0
3.4
v
2
5.0
3.3
5.1
2.5
5.3
2.5
6.6
2.9
6.5
2.9
v
3
6.0
2.0
6.2
2.8
5.3
2.5Figure 1
The attribute information of referential objectG.Figure 2
The partition matrixU of referential object G.Since the cluster number of referential objectG is c
=
3 and the collaborative information is V
˘
[
i
i
], β
[
i
i
,
1
]
=
β
[
i
i
,
2
]
=
0 holds. For the determination of β
[
i
i
,
3
], here we use the following formula: (35)
β
i
i
,
3
=
1
if
c
=
c
3
c
∧
c
3
c
∨
c
3
if
c
≠
c
3
.Based on this, parameter β
[
i
i
] can be expressed as (
0,0
,
1
) for G
(
1
), G
(
2
), and G
(
4
) and (
0,0
,
2
/
3
) for G
(
3
) and G
(
5
).By computing, we can obtain the new partition matrix of referential objectG under the collaboration of the ranking objects (shown in Figure 3) and the cluster centers (listed in Table 2).Table 2
The new cluster centers of the referential objectG.
G
(
1
)
G
(
2
)
G
(
3
)
G
(
4
)
G
(
5
)
v
1
5.3
2.5
5.0
3.0
5.0
3.3
5.3
3.3
5.0
3.4
v
2
5.0
3.3
5.1
2.5
5.3
2.5
6.6
2.9
6.5
2.9
v
3
6.0
2.0
6.2
2.8
5.3
2.5Figure 3
The new partition matrix of the referential objectG.According to the description of Algorithm1, we have(36)
S
V
,
V
G
1
=
0.9940
,
S
V
,
V
G
2
=
0.9979
,
S
V
,
V
G
3
=
0.9945
,
S
V
,
V
G
4
=
0.9973
,
S
V
,
V
G
5
=
0.9934
,
S
U
,
U
1
=
0.7779
,
S
U
,
U
2
=
0.7816
,
S
U
,
U
3
=
0.7798
,
S
U
,
U
4
=
0.7783
,
S
U
,
U
5
=
0.7909
.Hence, if we take the cluster centers into consideration, then we have(37)
G
2
≻
G
4
≻
G
3
≻
G
1
≻
G
5
;if we take the partition matrix into consideration, then we have(38)
G
5
≻
G
2
≻
G
3
≻
G
4
≻
G
1
;if we follow the route of Algorithm 1, then there holds(39)
G
5
≻
G
2
≻
G
4
≻
G
3
≻
G
1
.


## 5.2. Example of Partition Matrix-Based Ranking Approach

In this part, the referential objectG is the same as that in Section 5.1. For the ranking objects G
(
i
i
) for i
i
=
1,2
,
…
,
5, Figure 4 gives its collaborative information, and the collaborative information for i
i
=
1,2
,
…
,
5 is U
˘
[
i
i
].Figure 4
The provided collaborative information: partition matrix.Because the cluster number of referential objectG is c
=
3 and the collaborative information is U
˘
[
i
i
], then δ
[
i
i
,
1
]
=
δ
[
i
i
,
2
]
=
0 and γ
[
i
i
,
1
]
=
γ
[
i
i
,
2
]
=
0. For the determination of δ
[
i
i
,
3
] and γ
[
i
i
,
3
], we apply the following formulas: (40)
δ
i
i
,
3
=
1
if
c
=
c
3
c
∧
c
3
c
∨
c
3
if
c
≠
c
3
,
γ
i
i
,
3
=
1
if
c
=
c
3
c
∧
c
3
c
∨
c
3
if
c
≠
c
3
.For this, the label functions are δ
[
i
i
]
=
(
0,0
,
1
) and γ
[
i
i
]
=
(
0,0
,
1
). By computing, the new partition matrix and cluster centers of the referential object G are listed in Figure 5 and Table 3.Table 3
The new cluster centers of the referential objectG.
V
[
1
]
V
[
2
]
V
[
3
]
V
[
4
]
V
[
5
]
v
1
5.18
3.12
6.37
3.01
5.77
2.99
5.65
2.74
5.70
2.93
v
2
5.75
3.16
5.11
3.14
5.08
3.30
5.09
3.31
5.33
3.19
v
3
6.05
2.90
5.90
2.90
6.24
2.81
6.43
2.93
6.21
2.93Figure 5
The new partition matrix of the referential objectG.Up to now, by computing, we have(41)
S
V
,
V
1
=
0.9973
,
S
V
,
V
2
=
0.9976
,
S
V
,
V
3
=
0.9963
,
S
V
,
V
4
=
0.9965
,
S
V
,
V
5
=
0.9978
,
S
U
,
U
1
=
0.5849
,
S
U
,
U
2
=
0.7005
,
S
U
,
U
3
=
0.7001
,
S
U
,
U
4
=
0.7767
,
S
U
,
U
5
=
0.7371
.Similarly, if only the partition matrix is considered, then we have(42)
G
4
≻
G
5
≻
G
2
≻
G
3
≻
G
1
;if only the cluster centers are considered, then we have(43)
G
5
≻
G
2
≻
G
1
≻
G
4
≻
G
3
;and if we apply Algorithm 2 to compute the possible sequence of the complex objects, which yields(44)
G
4
≻
G
5
≻
G
2
≻
G
3
≻
G
1
.


## 6. Conclusions

In this paper, the problem of ranking for complex objects is discussed carefully by considering the merits of collaborative clustering and the privacy of information. During the process of constructing the ranking algorithm, a referential object is preproposed and the collaborative information of complex objects is provided by means of partition matrices and/or cluster centers. No matter what the type of the collaborative information is, that is, the collaborative information is partition matrix or cluster center, we regarded it as an objective-function-based optimization problem and solved it by Lagrange multiplier method, where the complex objects can be sorted by comparing the difference of the referential objects before and after collaborative clustering with respect to the ranking objects. To illustrate the validity of our proposed ranking algorithms, we constructed synthetic examples and the experimental results show that our proposed algorithms are valid.It is well known that no matter what result one ranking algorithm leads to, the topic of ranking is a soft decision making problem. We will still, in future work, pursue the analysis of the ranking approaches for complex objects. What is more, another interesting issue in this aspect is how to apply the proposed ranking methods of data with relational information into large and sparse data, in a clever, perfect way.



---

*Source: 495829-2015-08-06.xml*