# The Big Data Processing Algorithm for Water Environment Monitoring of the Three Gorges Reservoir Area

Authors: Yuanchang Zhong; Liang Zhang; Shaojing Xing; Fachuan Li; Beili Wan
Journal: Abstract and Applied Analysis
 (2014)

---

## Abstract

Owing to the increase and the complexity of data caused by the uncertain environment, the water environment monitoring system in Three Gorges Reservoir Area faces much pressure in data handling. In order to identify the water quality quickly and effectively, this paper presents a new big data processing algorithm for water quality analysis. The algorithm has adopted a fast fuzzy C-means clustering algorithm to analyze water environment monitoring data. The fast clustering algorithm is based on fuzzy C-means clustering algorithm and hard C-means clustering algorithm. And the result of hard clustering is utilized to guide the initial value of fuzzy clustering. The new clustering algorithm can speed up the rate of convergence. With the analysis of fast clustering, we can identify the quality of water samples. Both the theoretical and simulated results show that the algorithm can quickly and efficiently analyze the water quality in the Three Gorges Reservoir Area, which significantly improves the efficiency of big data processing. What is more, our proposed processing algorithm provides a reliable scientific basis for water pollution control in the Three Gorges Reservoir Area.


---

## Body

## 1. Introduction

The Yangtze River Three Gorges project is one of the world-renowned large water conservancy projects. After the completion of the project, the storage capacity of the reservoir has been growing tremendously. Because of the deterioration of the self-purification capacity of hydrostatic body, the environment of reservoir water is gradually worsening, which has attracted widespread attention. The safety of water environment is related to the Three Gorges Reservoir Area, the success of the Yangtze River region water security, the smooth implementation of the water diversion project, and even the overall sustainable development of China [1, 2]. According to the requirements of the “observational study of water quality during storage of the Three Gorges Project 135 Rules,” the “Upstream of the Yangtze River Water Environment Monitoring Center,” mainly monitoring the turbidity, sediment volume, conductivity, temperature, and hazardous materials (such as copper, lead, phenols, and cyanide) and another 27 items in the eight sections of Qingxichang, Fengdu, Zhongxian, Wanxian (Tuokou), Wanxian (Shaiwangba), Yunyang, Fengjie, and Wushan and the three sections of tributaries (Daning River, Xiao River, and Long River), has been found. Meanwhile, environmental monitoring stations of various levels have been established in the Three Gorges Reservoir Area, as an extremely important task of Three Gorges Reservoir Area water environment monitoring. Since monitoring methods and means applied to the existing monitoring equipment are unable to meet the needs of the task, the most pressing solution is needed for improvement on monitoring capacity.In order to overcome the deficiencies of the prior technique, the project team funded by the Natural Science Foundation of Chongqing has made ​​a series of researches. It has applied the wireless sensor network (WSN) technology to Three Gorges Reservoir Area water environmental monitoring, studied the expansion technology of WSN expansion in Three Gorges Reservoir Area water environment monitoring, and explored new ways to solve the use of new WSN in wireless remote real-time monitoring of water environment issues. On the basis of the research results obtained [3, 4], in this paper, we mainly discuss big data processing on water environment monitoring in the Three Gorges Reservoir Area.The database or big data solution becomes efficient and receives more attention nowadays [5, 6]. The big data processing has become a hot issue [7–9]. Considering the characteristics of large and wide distribution, the WSN applied to Three Gorges Reservoir Area water environment monitoring, with thousands of nodes, is a typical large-scale one. Obtained by this network, massive data about the Three Gorges Reservoir Area water quality is available; this is typical big data processing. Therefore, figuring out how to deal with these data fast and efficiently is important for water quality analyzing, which is also the key issue to be addressed in this paper.In water quality analysis, the assessment of water quality has a variety of parameters according to surface water quality standards [10]. The dissolved oxygen (DO), permanganate index (CODMn), and ammonia nitrogen (NH3–N), which have an impact on water quality in the Three Gorges Reservoir Area, should be comprehensively analyzed to determine water quality. The data collected from each node of ultra-large-scale WSN in the Three Gorges Reservoir Area contains these three parameters (DO, CODMn, and NH3–N). Obviously, the analysis and processing of multidimensional data from WSN monitoring network are a typical big data processing problem.Currently, the key technologies for big data analysis are clustering, fuzzy logic, evolutionary algorithms, and so forth [11]. There have been many scientific studies on big data analysis methods: the literature [12] reveals the connection between SoS system and research big data analysis and establishes a stable system model to predict the photovoltaic energy; big data analysis is adopted in [13] for the study of a complex global environment system, playing an important role in environmental data analysis; the author in [14] studies the big data analysis in the management and prediction of natural disaster. However, the system model proposed in [12] is so sophisticated that it is not suitable for water environment monitoring system with single data type; the algorithms adopted in [13, 14] put high requirements on the processing ability of a computer, which is also not appropriate for water environment monitoring system.In this paper, the existing big data analysis and processing method has been studied in depth based on the achievement in our project. According to massive data collected from “ultra-large-scale WSN for water environment monitoring of Three Gorges Reservoir Area,” our emphasis is put on the research of the big data analysis and processing method.The rest of this paper is organized as follows. In Section2, we collect data from these network nodes. According to the fuzzy C-means clustering algorithm and hard C-means clustering algorithm, we present the fast fuzzy C-means clustering algorithm in Section 3. Then, numerical results are provided in Section 4. Finally, Section 5 gives the conclusion.


## 2. The Network Model of Water Environment Monitoring

For the wide distribution of the Three Gorges Reservoir Area, some places are still not accessible. This leads to the special area in Three Gorges Reservoir Area and the reservoir shows a tree structure of winding [15]. Therefore, the special structure should be considered in the distribution of nodes and the planning of water monitoring network. The distribution of the Three Gorges Reservoir Area and structure model of ultra-large-scale WSN water environment monitoring system are shown in Figure 1.Figure 1
Distribution of the Three Gorges Reservoir and structure model of WSN water environment monitoring system.From Figure1, we observe that a huge number of sensor nodes are distributed in the ultra-large-scale WSN. In the process of data collection, water quality indicator data has obvious characteristics of big data. Simultaneously, the data collected from node includes many different indicators of water quality parameters, such as DO, CODMn, and NH3–N. As we can see, the traditional data analysis methods face a challenge to analyze large data in a short time as well as obtain the quality of current water conditions in a particular region. Therefore, we need to explore a fast and effective method for big data analysis and processing.


## 3. Research of Big Data Processing Algorithm

### 3.1. Fuzzy C-Means Clustering Algorithm Analysis

Both clustering, fuzzy logic and evolutionary algorithms are an effective way to solve the problem of big data. The concept of fuzzy clustering was first proposed by Ruspini. The fuzzy logic is adopted in clustering, and the result of fuzzy clustering represents the extent of the sample belonging to the related cluster, rather than simply hard clustering indicating which sample belongs to a cluster [16, 17]. The fuzzy clustering is more scientific and reasonable. In many fuzzy clustering methods, the most widely used is the fuzzy C-means clustering (fuzzy C-means, referred to as FCM) algorithm [18–20]. Compared with the traditional hard C-means (hard C-means, referred to as HCM), FCM clustering can get richer information, which can reflect the actual distribution of the sample accurately. The convergence has also been demonstrated [21]. The FCM clustering algorithm is the development of the HCM and it was proposed by Bezdek in 1981, which is used to put the distribution of data points in multidimensional data space into a number of several specific classes. FCM algorithm is taken to continuously optimize the sample through an iterative and C cluster center similarity objective function [22, 23], so that we can have access to local minima and obtain the optimal clustering. However, the FCM clustering algorithm is extremely time consuming. In the FCM clustering algorithm, the membership used to indicate the degree of each data point belongs to a cluster [24, 25].LetX
=
{
x
1
,
x
2
,
…
,
x
n
}
⊂
Φ
s denote the set of the data points without clustering; c is the number of clusters, and the fuzzy matrix P
=
[
p
i
j
]
c
×
n indicates the fuzzy C partition of data points. The p
i
j is one element of the matrix P; it shows the membership of the data point x
i for the ith cluster. The P must meet the following conditions [26]:
(1)
∀
i
,
j
p
i
j
∈
[
0,1
]
,
∀
j
∑
i
=
1
C
p
i
j
=
1
,
∀
i
0
<
∑
j
=
1
n
p
i
j
<
n
.Bezdek summed up the fuzzyC partition problem as an extreme value problem that follows the objective function under the constraint conditions:
(2)
G
m
(
P
,
Q
)
=
∑
j
=
1
n
∑
i
=
1
c
p
i
j
m
d
i
j
2
.In formula (2), Q
=
(
q
1
,
q
2
,
…
,
q
c
) is a matrix of s
×
c and q
i
=
(
q
1
i
,
q
2
i
,
…
,
q
s
i
)
T
∈
Φ
s is the ith cluster center. The d
i
j
=
∥
x
j
-
q
i
∥ indicates the Euclidean distance between the ith cluster center and the jth data point. And m is the fuzzy index which is used to control the fuzzy degree of classification matrix. The greater m is, the higher degree of fuzziness of the classification is. When m
=
1, the FCM clustering algorithm will degenerate into the HCM clustering algorithm. Therefore, the objective function G
m
(
P
,
Q
) is the quadratic sum of the weighted distance for each data point to the cluster center. The FCM algorithm is an iterative solution procedure making the objective function G
m
(
P
,
Q
) to minimization.The Lagrange multiplier method is applied to solving the optimization problem of formula (2) under the restriction of formula (1), and we can obtain the formula for P and Q:
(3)
p
i
j
(
t
+
1
)
=
[
∑
k
=
1
c
(
d
i
j
(
t
)
d
k
j
(
t
)
)
2
/
(
m
-
1
)
]
-
1
,
(4)
q
i
(
t
)
=
∑
j
=
1
n
(
p
i
j
(
t
)
)
m
x
j
∑
j
=
1
n
(
p
i
j
(
t
)
)
m
.In the FCM clustering algorithm, we set an initial cluster center randomly. At the same time, adjust the classification and cluster center according to formula (3) and formula (4) in each iteration. Until the change of the cluster center coming from two adjacent iterations is less than the preset σ, we believe that the algorithm has been convergent. But the iterative workload is great, and the clustering analysis has low efficiency, so it is not suitable for some clustering analysis which is multidimensional with a large amount of data. In particular, for such big data processing in Three Gorges Reservoir Area water quality monitoring, it cannot meet the water quality monitoring requirements quickly and efficiently.


### 3.2. Fast Fuzzy C-Means Clustering Algorithm

Further studies have shown what follows. In the standard FCM clustering algorithm, whenm
∈
[
1,5
], the fuzzy cluster center is much close to the hard cluster center. The deviation between them will increase slightly with the value of m increased, and the similarity between them is 0.98 in the maximum deviation; it is close to 1 in the vicinity of the typical m
=
2. Pal and Bezdek think that the reasonable range is m
∈
[
1.5,2.5
], so we take m
=
2 in this paper. At this moment, the fuzzy cluster center is close to the hard cluster center very much. Therefore, the hard cluster center can be treated as the initial value of the fuzzy cluster center to accelerate the speed of convergence and reduce the number of iterations. Accordingly, an improved FCM clustering algorithm that is called fast fuzzy C-means clustering algorithm (FFCM) can be obtained.Firstly, the HCM clustering algorithm is adopted to quickly determine hard cluster center of the input data. Then the hard cluster center is used as the initial cluster center of the FCM clustering algorithm for the fuzzy clustering iteration. Because of these, the convergence of the algorithm is speeded up; thus this fast FCM clustering algorithm is built. The iterative steps of the algorithm are as follows.(1)
Determine the number of clusters(
1
<
c
<
n
), select the constant σ
(
σ
>
0
), and initialize the membership matrix P
(
0
) by formula (1); set the number of iterations as t
=
0.
(2)
Calculate the cluster centerQ
(
t
)
=
(
v
1
(
t
)
,
v
2
(
t
)
,
…
,
v
c
(
t
)
) as follows:
(5)
q
i
(
t
)
=
∑
j
=
1
n
p
i
j
(
t
)
x
j
∑
j
=
1
n
p
i
j
(
t
)
.
(3)
For thetth iteration, modify the membership matrix P
(
t
) as follows:
(6)
p
i
j
(
t
+
1
)
=
{
1
,
d
i
j
(
t
)
=
min
⁡
{
d
i
j
(
t
)
}
,
∀
i
∈
c
,
0
,
other
.
(4)
If∥
P
(
t
+
1
)
-
P
(
t
)
∥
≤
σ, then enter the next step. Otherwise, set t
=
t
+
1 and go to step (
2
).
(5)
Set the iteration numberh
=
0. Set Q
(
0
) as the initial cluster center of FCM clustering algorithm by the result of step (
4
).
(6)
Calculate the membership matrixP
(
h
) according to the Q
(
h
) by formula (3).
(7)
Adjust the cluster centerQ
(
h
+
1
) further according to formula (4).
(8)
If∥
P
(
h
+
1
)
-
P
(
h
)
∥
≤
σ, the algorithm ends. Then output the cluster center and membership matrix P. Otherwise, set h
=
h
+
1 and return to step (
6
).The calculated membership matrixP can determine the membership of each data point for each cluster. Among them, for one data point, the degree of membership reflects the cluster that the data point belongs to. The hard cluster center is determined by using HCM clustering algorithm from step (
1
) to step (
4
). Because the hard cluster center is close to the fuzzy cluster center very much, the hard cluster center which is got from step (
5
) will be taken as the initial cluster center of FCM clustering algorithm. And then, the data samples will be managed by the FCM clustering through the following steps, so that the convergence speed of the fuzzy clustering algorithm could be speeded up. The number of iterations in fuzzy clustering algorithm would be reduced, and the time of the clustering analysis would be reduced greatly. For the water environment monitoring of Three Gorges Reservoir Area, the water quality data can be clustered rapidly by this fast fuzzy C-means clustering algorithm, which can be used to judge the water status quickly.


## 3.1. Fuzzy C-Means Clustering Algorithm Analysis

Both clustering, fuzzy logic and evolutionary algorithms are an effective way to solve the problem of big data. The concept of fuzzy clustering was first proposed by Ruspini. The fuzzy logic is adopted in clustering, and the result of fuzzy clustering represents the extent of the sample belonging to the related cluster, rather than simply hard clustering indicating which sample belongs to a cluster [16, 17]. The fuzzy clustering is more scientific and reasonable. In many fuzzy clustering methods, the most widely used is the fuzzy C-means clustering (fuzzy C-means, referred to as FCM) algorithm [18–20]. Compared with the traditional hard C-means (hard C-means, referred to as HCM), FCM clustering can get richer information, which can reflect the actual distribution of the sample accurately. The convergence has also been demonstrated [21]. The FCM clustering algorithm is the development of the HCM and it was proposed by Bezdek in 1981, which is used to put the distribution of data points in multidimensional data space into a number of several specific classes. FCM algorithm is taken to continuously optimize the sample through an iterative and C cluster center similarity objective function [22, 23], so that we can have access to local minima and obtain the optimal clustering. However, the FCM clustering algorithm is extremely time consuming. In the FCM clustering algorithm, the membership used to indicate the degree of each data point belongs to a cluster [24, 25].LetX
=
{
x
1
,
x
2
,
…
,
x
n
}
⊂
Φ
s denote the set of the data points without clustering; c is the number of clusters, and the fuzzy matrix P
=
[
p
i
j
]
c
×
n indicates the fuzzy C partition of data points. The p
i
j is one element of the matrix P; it shows the membership of the data point x
i for the ith cluster. The P must meet the following conditions [26]:
(1)
∀
i
,
j
p
i
j
∈
[
0,1
]
,
∀
j
∑
i
=
1
C
p
i
j
=
1
,
∀
i
0
<
∑
j
=
1
n
p
i
j
<
n
.Bezdek summed up the fuzzyC partition problem as an extreme value problem that follows the objective function under the constraint conditions:
(2)
G
m
(
P
,
Q
)
=
∑
j
=
1
n
∑
i
=
1
c
p
i
j
m
d
i
j
2
.In formula (2), Q
=
(
q
1
,
q
2
,
…
,
q
c
) is a matrix of s
×
c and q
i
=
(
q
1
i
,
q
2
i
,
…
,
q
s
i
)
T
∈
Φ
s is the ith cluster center. The d
i
j
=
∥
x
j
-
q
i
∥ indicates the Euclidean distance between the ith cluster center and the jth data point. And m is the fuzzy index which is used to control the fuzzy degree of classification matrix. The greater m is, the higher degree of fuzziness of the classification is. When m
=
1, the FCM clustering algorithm will degenerate into the HCM clustering algorithm. Therefore, the objective function G
m
(
P
,
Q
) is the quadratic sum of the weighted distance for each data point to the cluster center. The FCM algorithm is an iterative solution procedure making the objective function G
m
(
P
,
Q
) to minimization.The Lagrange multiplier method is applied to solving the optimization problem of formula (2) under the restriction of formula (1), and we can obtain the formula for P and Q:
(3)
p
i
j
(
t
+
1
)
=
[
∑
k
=
1
c
(
d
i
j
(
t
)
d
k
j
(
t
)
)
2
/
(
m
-
1
)
]
-
1
,
(4)
q
i
(
t
)
=
∑
j
=
1
n
(
p
i
j
(
t
)
)
m
x
j
∑
j
=
1
n
(
p
i
j
(
t
)
)
m
.In the FCM clustering algorithm, we set an initial cluster center randomly. At the same time, adjust the classification and cluster center according to formula (3) and formula (4) in each iteration. Until the change of the cluster center coming from two adjacent iterations is less than the preset σ, we believe that the algorithm has been convergent. But the iterative workload is great, and the clustering analysis has low efficiency, so it is not suitable for some clustering analysis which is multidimensional with a large amount of data. In particular, for such big data processing in Three Gorges Reservoir Area water quality monitoring, it cannot meet the water quality monitoring requirements quickly and efficiently.


## 3.2. Fast Fuzzy C-Means Clustering Algorithm

Further studies have shown what follows. In the standard FCM clustering algorithm, whenm
∈
[
1,5
], the fuzzy cluster center is much close to the hard cluster center. The deviation between them will increase slightly with the value of m increased, and the similarity between them is 0.98 in the maximum deviation; it is close to 1 in the vicinity of the typical m
=
2. Pal and Bezdek think that the reasonable range is m
∈
[
1.5,2.5
], so we take m
=
2 in this paper. At this moment, the fuzzy cluster center is close to the hard cluster center very much. Therefore, the hard cluster center can be treated as the initial value of the fuzzy cluster center to accelerate the speed of convergence and reduce the number of iterations. Accordingly, an improved FCM clustering algorithm that is called fast fuzzy C-means clustering algorithm (FFCM) can be obtained.Firstly, the HCM clustering algorithm is adopted to quickly determine hard cluster center of the input data. Then the hard cluster center is used as the initial cluster center of the FCM clustering algorithm for the fuzzy clustering iteration. Because of these, the convergence of the algorithm is speeded up; thus this fast FCM clustering algorithm is built. The iterative steps of the algorithm are as follows.(1)
Determine the number of clusters(
1
<
c
<
n
), select the constant σ
(
σ
>
0
), and initialize the membership matrix P
(
0
) by formula (1); set the number of iterations as t
=
0.
(2)
Calculate the cluster centerQ
(
t
)
=
(
v
1
(
t
)
,
v
2
(
t
)
,
…
,
v
c
(
t
)
) as follows:
(5)
q
i
(
t
)
=
∑
j
=
1
n
p
i
j
(
t
)
x
j
∑
j
=
1
n
p
i
j
(
t
)
.
(3)
For thetth iteration, modify the membership matrix P
(
t
) as follows:
(6)
p
i
j
(
t
+
1
)
=
{
1
,
d
i
j
(
t
)
=
min
⁡
{
d
i
j
(
t
)
}
,
∀
i
∈
c
,
0
,
other
.
(4)
If∥
P
(
t
+
1
)
-
P
(
t
)
∥
≤
σ, then enter the next step. Otherwise, set t
=
t
+
1 and go to step (
2
).
(5)
Set the iteration numberh
=
0. Set Q
(
0
) as the initial cluster center of FCM clustering algorithm by the result of step (
4
).
(6)
Calculate the membership matrixP
(
h
) according to the Q
(
h
) by formula (3).
(7)
Adjust the cluster centerQ
(
h
+
1
) further according to formula (4).
(8)
If∥
P
(
h
+
1
)
-
P
(
h
)
∥
≤
σ, the algorithm ends. Then output the cluster center and membership matrix P. Otherwise, set h
=
h
+
1 and return to step (
6
).The calculated membership matrixP can determine the membership of each data point for each cluster. Among them, for one data point, the degree of membership reflects the cluster that the data point belongs to. The hard cluster center is determined by using HCM clustering algorithm from step (
1
) to step (
4
). Because the hard cluster center is close to the fuzzy cluster center very much, the hard cluster center which is got from step (
5
) will be taken as the initial cluster center of FCM clustering algorithm. And then, the data samples will be managed by the FCM clustering through the following steps, so that the convergence speed of the fuzzy clustering algorithm could be speeded up. The number of iterations in fuzzy clustering algorithm would be reduced, and the time of the clustering analysis would be reduced greatly. For the water environment monitoring of Three Gorges Reservoir Area, the water quality data can be clustered rapidly by this fast fuzzy C-means clustering algorithm, which can be used to judge the water status quickly.


## 4. Simulation and Analysis

In order to verify the feasibility of the big data processing algorithm and its application to the big data processing for water environment monitoring in the Three Gorges Reservoir Area, we use the massive amounts of data collected by “ultra-large-scale WSN for water environment monitoring of Three Gorges Reservoir Area,” refer to monitoring data of the environment inspection department of Chongqing [27], and select 1024 groups of the sample data for a simulation test. There are three characteristic parameters (DO, CODMn, and NH3–N) in each group of data; the unit of them is mg/L.According to the standard of surface water environment quality, it divides the water quality into five classes named I, II, III, IV, and V, in which class I is the best, class V is the worst, and II, III, and IV are for the intermediate case. Then we selectσ
=
0.001, m
=
2 and we assume that the collected water samples obey the uniform distribution. Next, we analyze the samples based on the traditional clustering algorithm and the fast fuzzy C-means clustering algorithm proposed in this paper, respectively, and present the performance of different algorithms.First of all, the cluster center of the five kinds of water quality is analyzed using HCM clustering algorithm and FCM clustering algorithm, respectively. The two algorithms’ simulation cluster centers obtained are shown in Table1. From Table 1, HCM cluster center is much close to the FCM cluster center. So, the HCM cluster center can be used as the initial cluster center of FCM clustering algorithm.Table 1
The cluster center of HCM clustering and FCM clustering.
HCM
FCM
DO (mg/L)
CODMn (mg/L)
NH3–N (mg/L)
DO (mg/L)
CODMn (mg/L)
NH3–N (mg/L)
I
11.5950
1.8594
0.1976
11.6141
1.8361
0.1974
II
9.7224
1.8369
0.2000
9.7662
1.7530
0.2020
III
8.3351
1.7809
0.1760
8.3753
1.7475
0.1770
IV
8.2311
3.6315
0.1582
8.1945
3.2879
0.1570
V
7.0191
2.1462
0.1788
7.0756
2.1450
0.1794We cluster the selected sample data by FCM clustering algorithm and FFCM clustering algorithm, respectively, and then we analyze the convergence and the iterative process of the two algorithms. The convergence and the iterative process for the two algorithms are shown in Figure2. As we can see from Figure 2, the convergence speed of the new FFCM clustering algorithm is much faster than the FCM clustering algorithm. This shows that the FFCM clustering algorithm improves the convergence speed. The convergence speed of the HCM is very fast and the number of iterations needed is very small. Further analysis reveals that the FCM algorithm requires iterative operation 44 times and the FFCM algorithm only needs 24 times. So, the iterations of the FFCM algorithm are much less than those of the FCM algorithm. The new algorithm can reduce the required clustering time effectively and improve the efficiency of the data processing.Figure 2
The convergence process of the objective function in FCM clustering and FFCM clustering.The cluster centers of five kinds of water quality conditions are shown in Table2, which are obtained by the cluster analysis of the FFCM clustering algorithm. The cluster analysis results and the distribution of water quality under different factors are shown in Figures 3, 4, 5, and 6.Table 2
The cluster center of FFCM clustering.
DO (mg/L)
CODMn (mg/L)
NH3–N (mg/L)
I
11.6088
1.8371
0.1973
II
9.7600
1.7518
0.2019
III
8.3685
1.7477
0.1769
IV
8.1980
3.2885
0.1571
V
7.0729
2.1475
0.1794Figure 3
The distribution of water quality under the influence of CODMn, NH3–N, and DO.Figure 4
The distribution of water quality under the influence of CODMn and NH3–N.Figure 5
The distribution of water quality under the influence of DO and NH3–N.Figure 6
The distribution of water quality under the influence of DO and CODMn.From Figure3 to Figure 6, the different colors represent different water quality; it is shown that the water quality is affected by 3 characteristic parameters: DO, CODMn, and NH3–N. With comprehensive analysis of these three sets of parameters of water quality indicators, we can judge the quality correctly. The water quality situation can be considered comprehensively by the fast fuzzy C-means clustering algorithm from the three main indicators. It divides the 1024 selected sample points into five categories and determines the water quality level.In Figures5 and 6, the classification of the water quality is more accurate than DO and CODMn, and the effect of NH3–N is relatively less important. Mainly on the basis of DO and CODMn, we can get a preliminary determination of water types. The water in which DO is higher than 11 mg/L can be determined as class I. If CODMn is less than 3 mg/L, when DO is in the range of 9 mg/L to 10 mg/L, the water can be determined as class II. When DO is in the range of 8 mg/L to 9 mg/L, the water is class III. When the DO is less than 8 mg/L, the water is classified as V. The water belongs to class IV when the CODMn is more than 3 mg/L.


## 5. Conclusions

In this paper, a new fast fuzzy C-means clustering algorithm is proposed to complete the big data processing of the Three Gorges Reservoir Area water environment monitoring. The new algorithm improves the clustering algorithm convergence. The result of hard clustering is utilized to guide the initial value of fuzzy clustering. The new clustering algorithm can speed up the rate of convergence and improve the efficiency of big data processing. Simulation results show that, compared with the HCM clustering and the standard FCM clustering algorithm, this algorithm can not only effectively realize fuzzy clustering of data but also have faster convergence. The algorithm can quickly and efficiently analyze the discrimination of water quality in the Three Gorges Reservoir Area, improve the efficiency of big data processing in Three Gorges Reservoir Area water quality testing, and provide a reliable scientific basis for water pollution control in the Three Gorges Reservoir Area. The algorithm can not only be applied to the complexity of ultra-large-scale WSN for big data analysis and processing but also have some guidance for other areas in the big data processing.



---

*Source: 698632-2014-08-05.xml*