# Fuzzy Logic and Its Application in Football Team Ranking

Authors: Wenyi Zeng; Junhong Li
Journal: The Scientific World Journal
 (2014)

---

## Abstract

Fuzzy set theory and fuzzy logic are a highly suitable and applicable basis for developing knowledge-based systems in physical education for tasks such as the selection for athletes, the evaluation
for different training approaches, the team ranking, and the real-time monitoring of sports data. In this paper, we use fuzzy set theory and apply fuzzy clustering analysis in football team ranking. Based on
some certain rules, we propose four parameters to calculate fuzzy similar matrix, obtain fuzzy equivalence matrix and the ranking result for our numerical example,T7, T3, T1, T9, T10, T8, T11, T12, T2, T6, T5, T4, and investigate four parameters sensitivity analysis. The study shows that our fuzzy logic method is reliable and stable when the parameters change in certain range.


---

## Body

## 1. Introduction

In recent years, computational intelligence has been used to solve many complex problems by developing intelligent systems. And fuzzy logic has proved to be a powerful tool for decision-making systems, such as expert systems and pattern classification systems. Fuzzy set theory has already been applied in some physical expert systems.In traditional rule-based approach, knowledge is encoded in the form of antecedent-consequent structure. When new data is encountered, it is matched to the antecedents clauses of each rule, and those rules, where antecedents match a datum exactly, are fired; then we establish the consequent clauses. This process continues until the desired conclusion is reached. In the past decade, fuzzy logic has proved to be wonderful tool for intelligent systems in physical training. Some examples of using fuzzy logic to develop fuzzy intelligent systems are fuzzy systems in their microprocessors, fuzzy control of the subway system, fuzzy washing machines, fuzzy cameras, and camcorders that map image data to lens settings.Fuzzy sets introduced by Zadeh [1] have been found to be an important tool to deal with vagueness and uncertainty. Over the last decades, many researchers have investigated the fuzzy set theory and applied it to various fields including decision making, logic programming, medical diagnosis, pattern recognition, fuzzy inference, and fuzzy control. Clustering analysis is a fundamental and important method in statistical data analysis which has been widely investigated and applied in a variety of fields such as pattern recognition, information retrieval, microbiology analysis, and data mining [2–5]. Wang [6] introduced the concepts, including the degree of fuzzy similarity, fuzzy similarity matrix, and fuzzy equivalence matrix, and then gave a procedure for transforming the fuzzy similarity matrix into the fuzzy equivalence matrix. After that, a clustering technique of fuzzy sets was extensively applied in many fields [2, 6–8] on the basis of the λ-cutting matrix of the fuzzy equivalence matrix. Since then, some researchers have investigated this topic and have obtained some meaningful conclusions. For example, Ansari et al. [9] applied the fuzzy clustering analysis method in identification of hidden patterns among historical and instrumental seismic catalog of Iran. Benati [10] investigated categorical data fuzzy clustering and applied it in the analysis of local search heuristics. Yang and Watada [11] applied fuzzy clustering analysis method to return appropriate information for user queries, data annotation, and underlying ontology. Li [12] and He et al. [13] investigated fuzzy clustering method based on perturbation, respectively. Xie and Beni [14] investigated the validity measure for fuzzy clustering. Zhang et al. [15] investigated the cluster validity index for fuzzy clustering analysis. Furthermore, Dunn [16] proposed the fuzzy c-means (FCM) clustering algorithm and Bezdek [2] extended the FCM method and made the FCM method to become the most well-known in fuzzy clustering analysis. Recently, Pan [17] combined fuzzy common mapping with fuzzy clustering approach to perform clustering effect analysis. Bozkir and Sezer [18] developed a desktop software, FUAT, and used it to analyze and investigate different aspects in order to obtain and inform possible natural cluster number.Ranking in the physical matches is an important and interesting topic. But the ranking becomes complicated because of a large amount of teams, data missing of the sport teams, and some other reasons. Aimed at the ranking problem, how to construct a mathematical model is an interesting topic. In this paper, we merge ranking problem with fuzzy clustering analysis. According to the queuing principle, if we choose one objective to be the best (or worst), then the next should be the second best (or worst) which belongs to this type that the first objective is in, and the others are similar.The organization of our work is as follows. In Section2, we recall some preliminaries for fuzzy clustering analysis. In Section 3, we give an application of fuzzy clustering analysis in ranking. The final section is conclusion.


## 2. Some Notions

Throughout this paper, we useX={x1,x2,…,xn} to denote a set of n objects. rij represents the degree of fuzzy similarity between the objects xi and xj.For clarity, some definitions and notations are listed as follows.Definition 1.
A binary operation∧:[0,1]×[0,1]→[0,1] is called a t-norm if it satisfies the following properties:(1)
(identity)1∧x=x;(2)
(commutativity)x∧y=y∧x;(3)
(associativity)x∧(y∧z)=(x∧y)∧z;(4)
(monotonicity) Ifw≤x and y≤z then w∧y≤x∧z.Definition 2.
A binary operation∨:[0,1]×[0,1]→[0,1] is called a t-conorm if it satisfies the following properties:(1)
(identity)0∨x=x;(2)
(commutativity)x∨y=y∨x;(3)
(associativity)x∨(y∨z)=(x∨y)∨z;(4)
(monotonicity) Ifw≤x and y≤z then w∨y≤x∨z.
Here are three basic examples oft-norms and t-conorms which are often used for reasoning in fuzzy logic systems:(1)
a∧b=min⁡(a,b), the corresponding t-conorm can be obtained by using de Morgan laws: a∨b=max⁡(a,b);(2)
a∧b=a·b, the corresponding t-conorm is a∨b=a+b-a·b;(3)
a∧b=max⁡(a+b-1,0), the corresponding t-conorm is a∨b=min⁡(a+b,1).Definition 3.
IfA=(aij)m×n is a fuzzy matrix such that 0≤aij≤1 for i=1,2,…,m, j=1,2,…,n, then we call Aλ=(aij(λ))m×n the λ-cutting matrix of the fuzzy matrix A, where
(1)aij(λ)={0,ifaij<λ,1,ifaij≥λ
and λ is the confidence level with λ∈[0,1].Definition 4.
LetA=(aij)m×n and B=(bij)n×p be m×n and n×p fuzzy matrixes, respectively; then A∘B is m×p fuzzy matrix and is called composition matrix of the m×n fuzzy matrix A and the n×p fuzzy matrix B, where “∘’’ is called the composition operation of fuzzy matrixes, written by C=A∘B=(cij)m×p and cij is computed as follows:
(2)cij=⋁k=1n(aik∧bkj),i=1,2,…,m,j=1,2,…,p.
IfA=B=(aij)n×n, specially, then we denote A2=A∘A. Generally, we have An=An-1∘A if n is a nonnegative integer.Definition 5.
A fuzzy matrixA=(aij)n×n is reflexive if aii=1 for 1≤i≤n. A fuzzy matrix A=(aij)n×n is symmetric if aij=aji for 1≤i, j≤n. A fuzzy matrix A=(aij)n×n is max-min transitive if aij≥⋁k=1n(aik∧akj), where “∨’’ and “∧’’ stand for max and min operation, respectively.Definition 6.
A fuzzy matrix is fuzzy similarity matrix when it is reflexive and symmetric. A fuzzy matrix is fuzzy equivalence matrix when it is reflexive, symmetric, and max-min transitive.Definition 7.
Fuzzy matrixB is called the max-min transitive closure of fuzzy matrix A if fuzzy matrix B includes fuzzy matrix A and fuzzy matrix B satisfies the following properties: (1) fuzzy matrix B is max-min transitive; (2) fuzzy matrix B is included by any fuzzy matrix which includes fuzzy matrix A and satisfies max-min transitivity.Known by the above definitions, we can get the following conclusions.Theorem 1 (see [6]).
For a given fuzzy matrixR=(rij)n×n, its max-min transitive closure R* is computed as follows:
(3)R*=R∪R2∪⋯∪Rn.Theorem 2 (see [6]).
For a given fuzzy similarity matrixR=(rij)n×n, there exists the smallest nonnegative integer k(k≤n), such that R*=Rk and for every nonnegative integer l(l>k), we have Rl=Rk, and R*=Rk is a fuzzy equivalence matrix.Therefore, known by the above-mentioned Theorem2, then after the finite times of compositions, we have
(4)R⟶R2⟶R4⟶⋯⟶R2k⟶⋯
and there must exist a positive integer k such that R*=R2k=R2k+1 is a fuzzy equivalence matrix.Known by the above theoretical result, we can construct the following algorithm for fuzzy clustering analysis.Step 1.
Compute the similar degree between the objectsxi and xj, i,j=1,2,…,n, and then construct the fuzzy similarity matrix R=(rij)n×n.Step 2.
If the fuzzy similarity matrixR=(rij)n×n is a fuzzy equivalence matrix, then we can obtain the λ-cutting matrix Rλ=(rij(λ))n×n of the fuzzy equivalence matrix R; otherwise, we make the composition operation “∘” for the fuzzy similarity matrix R and derive fuzzy equivalence matrix R* by using the square method. Furthermore, we can construct the λ-cutting matrix Rλ*=(rij*(λ))n×n of the fuzzy equivalence matrix R*.Step 3.
If all elements of theith line (column) in the equivalence matrix Rλ(orRλ*) are the same as the corresponding elements of the jth line (column) in the equivalence matrix Rλ(orRλ*), then the objects xi and xj are of the same type, and λ is called as the confidence level. According to this principle, we can classify the all n objects xi on X based on the different confidence level λ, i=1,2,…,n; thus, we have a dynamic clustering graph.


## 3. Numerical Application

The ranking football team was the B problem of China Undergraduate Mathematical Contest in Modeling in 1993. The match points of 12 football teams in 1988-1989’s Chinese National Football League are given. The match point table contains a great amount of data, and some data are missing. The details are listed in Table1.Table 1
Match scores of 12 football teams.
T
1
T
2
T
3
T
4
T
5
T
6
T
1
X
0 : 1, 1 : 0, 0 : 0
2 : 2, 1 : 0, 0 : 2
2 : 0, 3 : 1, 1 : 0
3 : 1
1 : 0
T
2
X
2 : 0, 0 : 1, 1 : 3
0 : 0, 2 : 0, 0 : 0
1 : 1
2 : 1
T
3
X
4 : 2, 1 : 1, 0 : 0
2 : 1
3 : 0
T
4
X
2 : 3
0 : 1
T
5
X
0 : 1
T
6
X
T
7
T
8
T
9
T
10
T
11
T
12
T
7
T
8
T
9
T
10
T
11
T
12
T
1
0 : 1, 1 : 3
0 : 2, 2 : 1
1 : 0, 4 : 0
1 : 1, 1 : 1
X
X
T
2
1 : 1, 1 : 1
0 : 0, 0 : 0
2 : 0, 1 : 1
0 : 2, 0 : 0
X
X
T
3
1 : 0, 1 : 4
0 : 1, 3 : 1
1 : 0, 2 : 3
0 : 1, 2 : 0
X
X
T
4
0 : 5, 2 : 3
2 : 1, 1 : 3
0 : 1, 0 : 0
0 : 1, 1 : 1
X
X
T
5
X
X
X
X
1 : 0, 1 : 2
0 : 1, 1 : 1
T
6
X
X
X
X
X
T
7
X
1 : 0, 2 : 0, 0 : 0
2 : 1, 3 : 0, 1 : 0
3 : 1, 3 : 0, 1 : 0
3 : 1
2 : 0
T
8
X
0 : 1, 1 : 2, 2 : 0
1 : 1, 1 : 0, 0 : 1
3 : 1
0 : 0
T
9
X
3 : 0, 1 : 0, 0 : 0
1 : 0
1 : 0
T
10
X
1 : 0
2 : 0
T
11
X
1 : 1, 1 : 2
T
12
XIt is difficult to rank the 12 football teams directly according to the original data in Table1 since the numbers of fields are in huge difference between some teams. Aimed at the amount of missing data, some researcher proposed some methods to deal with these problems. For example, Dadelo et al. [19] applied the multicriteria assessment method, TOPSIS, in ranking system of sport team. Jalao et al. [20] investigated stochastic AHP method to solve ranking and decision making problem. Keener [21] applied Perron-Frobenius theorem in ranking of football teams. In this paper, we will apply fuzzy cluster analysis to investigate such ranking problem. And firstly we approximately recognize the competency of every team through the numbers of wins, loses, and draws of fields that they attended. The data are listed in Table 2.Table 2
Numbers of wins, loses, and draws.
T
1
T
2
T
3
T
4
T
5
T
6
T
7
T
8
T
9
T
10
T
11
T
12
Wins
10
5
8
1
2
2
13
6
7
6
1
2
Loses
5
4
4
12
5
3
1
8
8
5
6
3
Draws
4
6
3
6
2
0
3
3
2
6
2
4
Total
19
15
15
19
9
5
17
17
17
17
9
9Then, we consider the average numbers of goals(G), goals against (GA), and their difference (G-GA) of each team in matches, which may help us to realize each team’s competency. The result is listed in Table 3.Table 3
Numbers of goals, goals against, and their difference.
T
1
T
2
T
3
T
4
T
5
T
6
Goals
1.412
0.8
1.333
0.632
1
0.6
Goals against
0.941
0.667
0.8
1.681
1.444
1.2
G
-
GA
0.471
0.133
0.533
-
1.052
-
0.444
-
0.6
T
7
T
8
T
9
T
10
T
11
T
12
Goals
2.059
0.911
0.647
0.882
0.778
0.667
Goals against
0.588
0.824
1
1
1.556
1
G
-
GA
1.471
0.118
-
0.353
-
0.118
-
0.778
-
0.333After a simple analysis of Tables2 and 3, we can conclude that the football team T7 is the best and T4 is the worst; teams T5, T6, T10, T11, and T12 are low-ranking and T1, T2, T3, T9, and T8 are moderate in ranking. But the gap among them is not very big. Besides, considering that the data are asymmetry and incomplete, it is not very reasonable to rank the football teams just according to Tables 2 and 3.In order to give a more reasonable and reliable ranking result, we propose a more efficient algorithm that can make full use of given data. Considering that (1) there are some teams that did not play a match with each other at all and the match points are unknown and (2) the match times between some football teams have a large difference, the number may be 0, 1, 2, and even 4. Therefore, we have to establish a rule and define a group of characteristic data for each team. Then we can compute the degrees of similarity of competencies of the 12 teams (i.e., degrees of fuzzy similarity). According to Tables2 and 3, we propose the method of fuzzy clustering to compute the rank of the 12 teams.


### 3.1. Model Hypotheses

For conveniences, we give the following hypotheses.(1)
If teamTi does not play with team Tj, then we assume the only match result between Ti and Tj is A:B. Let Q=A-B and set Q=0 in this paper.(2)
Each match, every goal, and every goal against play an equally important role in ranking.(3)
We only use the difference of the numbers of goals and goals against to decide the characteristic data for each team. Then the characteristic data for theith team Ti is denoted by ri=(ri1,ri2,…,rin) where n=12,i=1,2,…,12.Considering that, in football fields, it is easier for teamTi to beat team Tj 2 : 1 in one match than beat Tj 2 : 1 in both two matches and much easier than get a 2 : 1 winning in three matches. Therefore, weighting factors shall be included when we compute characteristic data. For example, if Ti gets a 2 : 1 winning over Tj, then rij=(2-1)S; if Ti gets 2 : 1 winning over Tj two times, then
(5)rij=(2-1)+(2-1)2V;
if the winning comes to three times, then
(6)rij=(2-1)+(2-1)+(2-1)3U,
where U>V>S, and set U=1.4, V=1.2 and S=1.0 in this paper.(4)
The characteristic data for teamTi and itself is defined by rii=0.(5)
The degree of fuzzy similarity between teamTi and Tj is computed by
(7)xij=1-0.038∑k=112‍|rik-rjk|.(6)
The ranking principle is that the earlier the teams cluster, the closer they are in ranking.


### 3.2. Mathematical Modeling

Suppose the universe of discourseT={T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12}. According to the given data, we can obtain the following characteristic data ri for the ith football team, i=1,2,…,12,
(8)r1=(0,0,-0.467,2.333,2,1,-1.8,-0.6,3,0,0,0),r2=(0,0,-0.467,0.933,0,1,0,0,1.2,0,0,0),r3=(0.467,0.467,0,0.933,1,3,1,-1,1,-1,0,0),r4=(-2.333,-0.933,-0.933,0,-1,-1,-3.6,-0.6,-0.6,-0.6,0,0),r5=(-2,0,-1,1,0,-1,0,0,0,0,0,-0.6),r6=(-1,-1,-3,1,1,0,0,0,0,0,0,0),r7=(1.8,0,-1,3.6,0,0,0,1.4,2.333,2.333,2,2),r8=(0.6,0,1,0.6,0,0,-1.4,0,0,0,2,0),r9=(-3,-1.2,-1,0.6,0,0,-2.333,0,0,1.867,1,1),r10=(0,0,1,0.6,0,0,-2.333,0,-1.867,0,1,2),r11=(0,0,0,0,0,0,-2,-2,-1,-1,0,-0.467),r12=(0,0,0,0,0.6,0,-2,0,-1,-2,0.467,0).Then we can calculate the degrees of fuzzy similarityrij between football teams Ti and Tj and obtain the fuzzy similarity matrix R as follows:(9)R=(10.6660.5440.3510.4730.4960.3390.5140.3060.3460.5110.52610.6410.3970.650.5970.3890.590.3510.3920.5870.67810.2750.4830.5060.1820.4930.1840.2960.5310.51610.6450.5110.0040.4530.5690.3720.6020.57210.7490.3130.620.5740.4220.5770.55710.260.5670.5210.3690.4880.54910.4050.3030.2370.1290.17910.5290.6810.6480.69910.4780.420.47110.5720.62310.8281).After calculating the fuzzy equivalence matrix of fuzzy similarity matrixR and the classification results and combining the information from Tables 2 and 3, we think that team T4 is ranked as number 12, the last place. And known by hypothesis (6), the first team clustered with T4 is T5; thus, T5 is ranked as number 11. The rest process is just similar. Team T7 is ranked as number 1 since it is the last team falling into the cluster of T4. The whole ranking result is listed in Table 4.Table 4
Ranking results of 12 football teams.
Team
T
1
T
2
T
3
T
4
T
5
T
6
T
7
T
8
T
9
T
10
T
11
T
12
Rank
3
9
2
12
11
10
1
6
4
5
7
8


### 3.3. Parameter Sensitivity Analysis

There are four parameters in our model and they are predefined which seems very subjective. To make sure the ranking result is reasonable and reliable, we shall analyze whether the result will change when these parameters vary in a certain range. Some calculating results are listed in Table5.Table 5
Some ranking results with varied parameters.
Team
T
1
T
2
T
3
T
4
T
5
T
6
T
7
T
8
T
9
T
10
T
11
T
12
Q
=
0, U=1.4, V=1.2, S=1
3
9
2
12
11
10
1
6
4
5
7
8
Q
=
0.1, U=1.4, V=1.2, S=1
3
9
2
12
11
10
1
6
4
5
7
8
Q
=
0.2, U=1.4, V=1.2, S=1
3
9
2
12
11
10
1
6
4
5
7
8
Q
=
0.3, U=1.4, V=1.2, S=1
3
9
2
12
11
10
1
6
4
5
7
8
Q
=
-
0.1, U=1.4, V=1.2, S=1
3
9
2
12
11
10
1
6
4
5
7
8
Q
=
-
0.2, U=1.4, V=1.2, S=1
3
9
2
12
11
10
1
6
4
5
7
8
Q
=
-
0.3, U=1.4, V=1.2, S=1
3
9
2
12
11
10
1
6
4
5
7
8
Q
=
0, U=1.5, V=1.3, S=1
3
9
2
12
11
10
1
6
4
5
7
8
Q
=
0.1, U=1.6, V=1.4, S=1.1
3
9
2
12
11
10
1
6
4
5
7
8Known by Table5, we can find that the ranking result does not change when Q∈[-0.3,0.3] and the absolute value of change quantity of U,V,S is less than 0.2, which implies our result is not sensitive to these parameters. That shows our ranking result is stable when the parameters vary slightly. Therefore, the result is reasonable and reliable.


## 3.1. Model Hypotheses

For conveniences, we give the following hypotheses.(1)
If teamTi does not play with team Tj, then we assume the only match result between Ti and Tj is A:B. Let Q=A-B and set Q=0 in this paper.(2)
Each match, every goal, and every goal against play an equally important role in ranking.(3)
We only use the difference of the numbers of goals and goals against to decide the characteristic data for each team. Then the characteristic data for theith team Ti is denoted by ri=(ri1,ri2,…,rin) where n=12,i=1,2,…,12.Considering that, in football fields, it is easier for teamTi to beat team Tj 2 : 1 in one match than beat Tj 2 : 1 in both two matches and much easier than get a 2 : 1 winning in three matches. Therefore, weighting factors shall be included when we compute characteristic data. For example, if Ti gets a 2 : 1 winning over Tj, then rij=(2-1)S; if Ti gets 2 : 1 winning over Tj two times, then
(5)rij=(2-1)+(2-1)2V;
if the winning comes to three times, then
(6)rij=(2-1)+(2-1)+(2-1)3U,
where U>V>S, and set U=1.4, V=1.2 and S=1.0 in this paper.(4)
The characteristic data for teamTi and itself is defined by rii=0.(5)
The degree of fuzzy similarity between teamTi and Tj is computed by
(7)xij=1-0.038∑k=112‍|rik-rjk|.(6)
The ranking principle is that the earlier the teams cluster, the closer they are in ranking.


## 3.2. Mathematical Modeling

Suppose the universe of discourseT={T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12}. According to the given data, we can obtain the following characteristic data ri for the ith football team, i=1,2,…,12,
(8)r1=(0,0,-0.467,2.333,2,1,-1.8,-0.6,3,0,0,0),r2=(0,0,-0.467,0.933,0,1,0,0,1.2,0,0,0),r3=(0.467,0.467,0,0.933,1,3,1,-1,1,-1,0,0),r4=(-2.333,-0.933,-0.933,0,-1,-1,-3.6,-0.6,-0.6,-0.6,0,0),r5=(-2,0,-1,1,0,-1,0,0,0,0,0,-0.6),r6=(-1,-1,-3,1,1,0,0,0,0,0,0,0),r7=(1.8,0,-1,3.6,0,0,0,1.4,2.333,2.333,2,2),r8=(0.6,0,1,0.6,0,0,-1.4,0,0,0,2,0),r9=(-3,-1.2,-1,0.6,0,0,-2.333,0,0,1.867,1,1),r10=(0,0,1,0.6,0,0,-2.333,0,-1.867,0,1,2),r11=(0,0,0,0,0,0,-2,-2,-1,-1,0,-0.467),r12=(0,0,0,0,0.6,0,-2,0,-1,-2,0.467,0).Then we can calculate the degrees of fuzzy similarityrij between football teams Ti and Tj and obtain the fuzzy similarity matrix R as follows:(9)R=(10.6660.5440.3510.4730.4960.3390.5140.3060.3460.5110.52610.6410.3970.650.5970.3890.590.3510.3920.5870.67810.2750.4830.5060.1820.4930.1840.2960.5310.51610.6450.5110.0040.4530.5690.3720.6020.57210.7490.3130.620.5740.4220.5770.55710.260.5670.5210.3690.4880.54910.4050.3030.2370.1290.17910.5290.6810.6480.69910.4780.420.47110.5720.62310.8281).After calculating the fuzzy equivalence matrix of fuzzy similarity matrixR and the classification results and combining the information from Tables 2 and 3, we think that team T4 is ranked as number 12, the last place. And known by hypothesis (6), the first team clustered with T4 is T5; thus, T5 is ranked as number 11. The rest process is just similar. Team T7 is ranked as number 1 since it is the last team falling into the cluster of T4. The whole ranking result is listed in Table 4.Table 4
Ranking results of 12 football teams.
Team
T
1
T
2
T
3
T
4
T
5
T
6
T
7
T
8
T
9
T
10
T
11
T
12
Rank
3
9
2
12
11
10
1
6
4
5
7
8


## 3.3. Parameter Sensitivity Analysis

There are four parameters in our model and they are predefined which seems very subjective. To make sure the ranking result is reasonable and reliable, we shall analyze whether the result will change when these parameters vary in a certain range. Some calculating results are listed in Table5.Table 5
Some ranking results with varied parameters.
Team
T
1
T
2
T
3
T
4
T
5
T
6
T
7
T
8
T
9
T
10
T
11
T
12
Q
=
0, U=1.4, V=1.2, S=1
3
9
2
12
11
10
1
6
4
5
7
8
Q
=
0.1, U=1.4, V=1.2, S=1
3
9
2
12
11
10
1
6
4
5
7
8
Q
=
0.2, U=1.4, V=1.2, S=1
3
9
2
12
11
10
1
6
4
5
7
8
Q
=
0.3, U=1.4, V=1.2, S=1
3
9
2
12
11
10
1
6
4
5
7
8
Q
=
-
0.1, U=1.4, V=1.2, S=1
3
9
2
12
11
10
1
6
4
5
7
8
Q
=
-
0.2, U=1.4, V=1.2, S=1
3
9
2
12
11
10
1
6
4
5
7
8
Q
=
-
0.3, U=1.4, V=1.2, S=1
3
9
2
12
11
10
1
6
4
5
7
8
Q
=
0, U=1.5, V=1.3, S=1
3
9
2
12
11
10
1
6
4
5
7
8
Q
=
0.1, U=1.6, V=1.4, S=1.1
3
9
2
12
11
10
1
6
4
5
7
8Known by Table5, we can find that the ranking result does not change when Q∈[-0.3,0.3] and the absolute value of change quantity of U,V,S is less than 0.2, which implies our result is not sensitive to these parameters. That shows our ranking result is stable when the parameters vary slightly. Therefore, the result is reasonable and reliable.


## 4. Conclusion

In this paper, we propose the ranking algorithm based on the fuzzy clustering and obtain the ranking result as follows:T7, T3, T1, T9, T10, T8, T11, T12, T2, T6, T5, T4. Our study shows that our ranking result is reliable and stable when the parameters change in a certain range. And our algorithm can be easily generalized to the case in which the number of teams is an arbitrary positive integer N.By the way, it needs to be pointed out that there are some disadvantages in our algorithm. (1) it will not rank the teams when it is difficult to figure out which teams have better or worse competition results; (2) the algorithm will fail when there are too much missing data.



---

*Source: 291650-2014-06-16.xml*