Comparison Between Fuzzy C-means Clustering and

Fuzzy Clustering Subtractive in Urban Air Pollution

Collazo-Cuevas J.I1., Aceves-Fernandez M. A.2, Gorrostieta-Hurtado E2., Pedraza-Ortega
J.C2., Sotomayor-Olmedo A.2, Delgado-Rosas M.2
Universidad del Valle de México1 (UVM) Campus Querétaro Boulevard Villas del Mesón No. 1000 Col.
Juriquilla, Querétaro, México.
Centro de Investigación y Desarrollo en Informática y Telecomunicaciones (CIDIT) Facultad de
Informática de la Universidad Autónoma de Querétaro (UAQ), Av. de las Ciencias s/n, Querétaro México2

collazo013@hotmail.com, marco.aceves@uaq.mx, efren.gorrostieta@uaq.mx, carlos.pedraza@uaq.mx

artemio.sotomayor@uaq.mx, manuel.delgado@uaq.mx

Abstract extending the zero-one membership to the

Clustering is generally associated with
classification problem. In this contribution, the
implementation of cluster estimation method as a
basis of a fuzzy model identification algorithm
has been developed. A comparison between two
different clustering techniques is presented,
Fuzzy C-means clustering and Fuzzy Clustering
Subtractive. Also, an application in modeling the
relationship between temperature, humidity and
PM10 concentration in urban air pollution in
Liverpool at northwest of England is presented.
Keywords. Fuzzy model identification, fuzzy c-
means, fuzzy clustering subtractive.
1. Introduction
Clustering of numerical data forms the basis
of many classification, system modeling, and
pattern recognition algorithms [1]. Pattern
recognition is a field concerned with machine
recognition of meaningful regularities in noisy or
complex environments. In other words, pattern
recognition is search structures in data.
Pattern recognition, by its nature, is an
inexact science. To deal with the inexactitude, it
is helpful to introduce some "fuzziness" into the
formulation of the problem.
For example, the boundary between clusters
could be fuzzy rather than crisp; that is, a data
point could belong to two or more clusters with
different degrees of membership. In this way, the
formulation is closer to the real-world problem
and therefore better performance may be
expected. This is the first reason for using fuzzy
modeling for pattern recognition, in fact, fuzzy
modeling means more flexible modeling-by
membership in the interval (0,1), more flexibility
is introduced [1].
The second reason for using fuzzy modeling
is simplifying the problem formulation since this
reduces the computational cost.
This is due to the fact that a non-fuzzy
(crisp) model generally results in an exhaustive
search in a huge space (because some key
variables can only take values 0 and 1), whereas
in a fuzzy model all the variables are continuous,
so that derivatives can be computed to find the
right direction for the search [5][12].
Finally fuzzy modeling could be automatic
or semi-automatic process by using clustering
techniques like fuzzy c-means clustering
(FCM)[10] and fuzzy clustering subtractive
(FCS) [8][9] where, each cluster center can be
used as the basis of a rule that describes the
system behavior.
2. Fuzzy Systems
Since 1985 when the fuzzy model
methodology suggested by Takagi-Sugeno
[1][2][12], as well known as the TSK model, has
been widely applied on theoretical analysis,
control applications and fuzzy modeling.
Fuzzy system needs the antecedent and
consequence to express the logical connection
between the input-data and output-data that is
used as a basis to produce the desired system
behavior [6].
Fuzzy systems provide a simple, flexible
way to express knowledge by using fuzzy IF-
THEN Rules [5] and fuzzy modeling provide a
framework for modeling complex non-linear
relations, compared to traditional mathematical

978-1-4244-5353-5/10/$26.00 ©2010 IEEE 174

 modeling, fuzzy modeling possesses some
distinctive advantages, such as the mechanism of
reasoning in human understandable terms, the
capacity of taking linguistic information from
human experts and combining it with numerical
data and the ability of approximating complex
non-linear functions with simple models[1-
5][12]. A set of n fuzzy rules performs a fuzzy
system. The IF-THEN are the basis of TSK and
any other kind of fuzzy system and are given by:
Ri = IF Y1 is A1 and Y2 is A2 and … THEN Z1 is
B1 and Z2 is B2 …
Where Ri is ith fuzzy rule and i pertenecent to set
of n fuzzy rules. In order to automatically
generate a set of fuzzy rules, clustering
techniques are applied where, each cluster center
can be used as the basis of a rule that describes
the system behavior. In this contribution, both
Fuzzy C-means Clustering and Fuzzy clustering
subtractive are used.
3. The Fuzzy C-Means Clustering
Fuzzy C-Means clustering (FCM) is an
iterative optimization algorithm that minimizes the
cost function given by:
n c
J =∑ ∑μ m
ik || x k − v i ||2
k=1 i=1
Where n is the number of data points, c is the
number of clusters, xk is the kth data point, vi is the
ith cluster center μik is the degree of membership of
the kth data in the ith cluster, and m is a constant
greater than 1 (tipically m=2)[10]. The degree of
membership μik is defined by:
1
μ ik =
c
|| x − vi || 2 /( m −1)
∑ ( k
j =1 || x k − v j ||
)
Starting with a desired number of clusters c and an
initial guess for each cluster center vi, i = 1,2,3… c,
FCM will converge to a solution for vi that
represents either a local minimum or a saddle point
cost function [10]. The FCM method employs
fuzzy partitioning such that each point can belong
to several clusters with membership values between
0 and 1. FCM include predefined parameters such
as the weighting exponent m and the number of
clusters c.
4. Fuzzy Clustering Subtractive
The subtractive clustering method assumes
each data point is a potential cluster center and
978-1-4244-5353-5/10/$26.00 ©2010 IEEE
calculates a measure of the likelihood that each
data point would define the cluster center, based
on the density of surrounding data points.
Consider m dimensions n data point (x1,x2,
…, xn) and each data point is potential cluster
center, the density function Di of data point at xi
is given by:
(3)
where ra is a positive number. The data point
with the highest potential is surrounded by more
data points. A radius defines a neighbor area then
the data points, which exceed ra, have no
influence on the density of data point.
After calculating the density function of each
data point is possible to select the data point with
the highest potential and find the first cluster
center. Assuming that xc1 is selected and Dc1 is its
density, the density of each data point can be
amended by:
(4)
2
The density function of data point which is
(1) close to the first cluster center is reduced, so
these data points cannot become the next cluster
center. rb defines an neighbor area where the
density function of data point is reduced. Usually
constant rb > ra. In order to avoid the overlapping
of cluster centers near to other(s) is given by [9]:
1.5 · (5)
Once amending the density function of data
points is possible to find the next cluster center.
(2)
Then repeat this process until find all cluster
centers.
The subtractive clustering is used to
determine the number of clusters of the data
being proposed, and then generates a fuzzy
model.
5. Fuzzy model construction
When cluster estimation method is applied
to a collection of input/output data, each cluster
center exemplifies a characteristic behavior of
the system. Hence, each cluster center can be
used as the basis of a rule that describes the
system behavior. Consider a set of c cluster
* * * *
centers {x1 , x 2 , x 3 ,...x c } in an M-dimensional
space. Let the first N dimensions correspond to
175
 the input variables and the last M–N dimensional computes the output as a weighted average of the
corresponds to output variables. Each vector x i
* output of each rule [1] [4] [8].
could be decomposed into two component
* * *
vectors y i and z i where y i contains the first N
6. Experimental results
* *
A comparison in the performance of both
elements of x i and z i contains the last M–N fuzzy systems generated by Fuzzy Clustering
elements Subtractive and Fuzzy C-Means was made taking
Then consider each cluster center x i is
* in count the number or membership functions,
represents a fuzzy rule that describes the system rules, and Least Mean Square Error for Airborne
behavior. Given an input vector y, the degree to particulate monitoring in the city of Liverpool in
which rule i is fulfilled is defined by: the Northwest England for different years [11].
The parameters to be taken into account are:
* 2 Humidity and Temperature, these datasets are
μi = e−α ||yy || i (6) provided by the UK National Air Quality
Archive. A total of 13 sites were used with
Where α is the constant defined by [9]. similar characteristics: they used a TEOM
monitoring method (microanalyzer that uses a
microbalance to weigh the amount of particle
4 concentration). The list of sites is shown on
α= (7) Table 1.
ra2
Blackpool Bolton Bradford
and ra is a positive constant[9]. Bury Leeds Liverpool
Manchester Preston Salford
The output vector z is computed by:
c Sheffield Stockport Wigan
∑μ z *
i i
Wirral
Table 1. List of sites where TEOMs are located.
z= i−1
c (8)
∑μ i
It was designed for each case of study two
different FIS models the first using subtractive
i−1
clustering, and the second using 2006 Clustering
then this computational model is in terms of a fuzzy C-Mean, the characteristics of the Subtractive
inference system employing if-then rules following Clustering models are shown in Table 2, and the
the form: characteristics of the Clustering C-Means are
shown in Table 3.
IF Y1 is A1 and Y2 is A2 and … THEN Z1 is B1 and Z2
is B2 … IF-
Site And Membership
Variable THEN
where Y1 is the jth input variable and Z1 is the jth
Year Functions
Rules
output varaiable. A1 is an exponential membership Liverpool
function and B1 is a singleton for the ith rule that is 5 14 14
*
2003
represented by cluster center x i , Aj and Bj are Liverpool
given by: 2004 5 15 15
Liverpool
−α (q−y *ij )2 5 18 18
A j (q) = e (9) 2005
B j = z*ij (10) Liverpool
5 12 12
2006
Liverpool
where y *ij is the jth element of y *i and z*ij is the 2007
5 14 14
*
jth element of z i . This computational scheme is Table 2. Characteristics of FIS models using
equivalent to an inference method that uses Subtractive Clustering.
multiplication as the AND operator, weights the
output of each rule by the firing strength, and

978-1-4244-5353-5/10/$26.00 ©2010 IEEE 176

 IF-
Site And Membership
Variable THEN
Year Functions
Rules
Liverpool
2003
5 4 4
Liverpool
2004 5 5 5
Liverpool
2005 5 3 3
Liverpool Figure 2. Membership Functions in FIS model
2006
5 3 3
using Clustering C-Means in Temperature in
Liverpool Liverpool 2004
2007
5 3 3
Table 2: Characteristics of FIS models using As it had shown in the cases, when it used
Clustering C-Means. the Subtractive Clustering algorithm has a lower
computational cost than the C-Means algorithm
As shown in tables 2 and 3 both because it has a higher computational cost,
algorithms create in all the cases the same because in all the cases has more number of
number of rules as membership functions(MF), Membership Functions and rules.
in the case of two o more rules use the same The Least Mean Square Error (LMSE),
median and standard deviation, the algorithm between the raw data, and both FIS models
create a new MF, increasing the computational trough the different years are shown from
cost. Figures 3 to 7.
In the case of using Subtractive
Clustering this algorithm every TSK
Membership function in the same input variable
need to have the same width in difference with
the C-Means algorithm, in Figure 1 is shown an
example of the Membership Functions of the
Temperature and in the Figure 2 is shown the
same input data using C-Means algorithm.

Figure 3. LMSE between Raw data and FIS

models in Liverpool 2003

Figure 1. Membership Functions in FIS model

using Subtractive Clustering in Temperature in
Liverpool 2004

Figure 4. LMSE between Raw data and FIS

models in Liverpool 2004

978-1-4244-5353-5/10/$26.00 ©2010 IEEE 177


Figure 5. LMSE between Raw data and FIS
models in Liverpool 2005
Figure 6. LMSE between Raw data and FIS
models in Liverpool 2007
Figure 7. LMSE between Raw data and FIS
models in Liverpool 2007
7. Conclusions and Future work
Fuzzy clustering techniques allow the
automatic generation of fuzzy models and can be
utilized to predict Urban Air Pollution. In this
case study, a particular type of harmful particles
(PM10) were monitored and a prediction was
made using two different fuzzy methods. To
validate the results, the datasets from other cities
apart from Liverpool, England, were used,
showing te feasibility of using both methods to
predict the behavior of such a complex system.
Fuzzy C-means clustering and fuzzy clustering
subtractive are useful techniques to describe
978-1-4244-5353-5/10/$26.00 ©2010 IEEE
complex dynamic systems and provide an
automatic way to generate robust fuzzy systems.
Future work will be involved with minimizing the
system error and try novel clustering techniques.
Also, real-time prediction may be carried out using
sensor networks and embedded systems.
8. Acknowledgements
The authors would like to thank Alan
Charton from The Air Quality Archive hosted by
AEA Energy & Environment, on behalf of the
UK Department for Environment, Food & Rural
Affairs and the Devolved Administrations (DE-
FRA). Also, the authors would like to
acknowledge the financial support of the
Mexican government via PROMEP funding.
References
[1] Takagi, T., and M. Sugeno. Fuzzy Identification of
Systems and its Application to Modeling and Control.
IEEE Trans. Systems Man and Cybernetics. 15: 116-
132. 1985
[2] Sugeno, M., and G. T. Kang. Structure
Identification of Fuzzy Model. Fuzzy Sets and
Systems. 28: 15-33.1988
[3] Mamdani, E. Advances in the Linguistic Synthesis
of Fuzzy Controllers. Int. Journal in Man-Machine
Studies. 8: 669-678. 1976
[4] Papadakis, S. E., and J. B. Theocharis. A GA-
based Fuzzy Modeling Approach for Generating TSK
Models. Fuzzy Sets and Systems. 131: 121-152. 2002
[5] T. Cox, E. The Fuzzy Systems Handbook:
A Practitioner’s Guide to Building, Using, and
Maintaining Fuzzy Systems. Academic Press. 2002
[6] Sin, S. K., and De Figueiredo. Fuzzy System
Designing Through Fuzzy Clustering and Optimal
preDefuzzification. Proc. IEEE International
Conference on Fuzzy Systems. 190-195.1993
[7] Gomez, A. F., M. Delgado, and M. A. Vila. About
the Use of Fuzzy Clustering Techniques for
Fuzzy Model Identification. Fuzzy Set and Systems.
106: 179-188. 1999
[8] Chiu S. Fuzzy model identification based on
cluster estimation., Journal of Intelligent and Fuzzy
Systems; Vol. 2, No. 3, pp. 267–78. September 1994
[9] Yager, R. and D. Filev, Generation of Fuzzy Rules
by Mountain Clustering, Journal of Intelligent &
Fuzzy Systems, vol. 2, No. 3, pp. 209- 219. 1994
178
 [10] Bezdek, J. C., Pattern Recognition with Fuzzy
Objective Function Algorithms, Plenum Press, NY,
1981.

[11] M. A. Aceves-Fernandez, J. I. Collazo-Cuevas, E.

Gorrostieta, C. Pedraza-Ortega, J. M. Ramos, S.
Canchola. Prognosis of Urban Air Pollution by using a
Fuzzy Clustering System In Northwest England
journal in Computing Science, ISSN 1870-4069.

[12] Gorrostieta, E., J.C. Pedraza, R.J. Carlos, ”Fuzzy

Modelling of Systems”, Proceedings of 11 th IEEE
International Conference on Methods and Models in
Automation and Robotics MMAR 2005, 29 August- 1
September 2005, Miedzyzdroje, Poland. ISBN 83-
60140-85-5.

978-1-4244-5353-5/10/$26.00 ©2010 IEEE 179