DEPSO MODEL FOR EFFICIENT CLUSTERING USING DRIFTING CONCEPTS.
Dr. J.S.Kanchana1, Dr.N.Rajathi2
1
Department of Information Technology, K.L.N. College of Engineering, Pottapalayam, Tamil Nadu, India
2
Department of Information Technology, Kumaraguru College of Technology Coimbatore, Tamil Nadu, India
Abstract
Data mining is the procedure of mining
knowledge from data. The information
or knowledge extracted so can be used
for Market Analysis, Customer
Retention. As a data mining function,
cluster analysis serves as a tool to gain
insight into the distribution of data to
observe characteristics of each cluster.
Clustering is the process of making a
group of abstract objects into classes of
similar objects. An Existing system uses
iterative optimization algorithm for
clustering the data objects with drifting
concepts using some cluster validity
function to evaluate the effectiveness of
the clustering model while each new
input data subset is flowing. The
Proposed system uses Differential
Evolutionary Particle Swarm
Optimization (DEPSO) model for
effectively clustering the several real
data sets with drifting concepts.
Keywords: Cluster analysis, Differential
evolutionary, Particle Swarm Optimization,
Drifting Concepts
1 INTRODUCTION
Today’s data mining, it is helpful for
the extraction of hidden predictive
information from large databases, it is an
powerful new technology with great
potential to help companies focus on the
most important in their data warehouses.
Data mining tools predict future trends and
behaviors, allowing business to make
proactive. knowledge based decisions. The
automated, prospective tools typical of
decision support systems. Data mining
tools can answer business questions that
traditionally were too time consuming to
resolve. The techniques can be
implemented rapidly on existing software
and hardware platforms to enhance the
value of existing information-resources,
and can be integrated with new products
and systems as they are brought on-line.
The objective of clustering is to
grouping similar data items into clusters so
that items in the same cluster have high
similarity but are dissimilar with item in
other clusters. The process of clustering
the entire dataset without performing
drifting concepts are in considered. Such
process is not only decreasing the quality
of the cluster but also disregards the
expectations of user that they need only
the recent clustering result. The volume of
data stream is huge so storing and taking
the entire data stream is expensive.
Therefore, well defined technique is used
for effectively and efficiently clustering
dataset with drifting concepts. In this paper
we use differential evolutionary particle
swarm optimization algorithm for
clustering the dataset with drifting
concepts.
2. RELATED WORK:
Liang Bai [3] in “An optimization
model for clustering categorical data
streams with drifting concepts” had
observed that there is always a lack of a
2
cluster validity function and optimization without having to look at every point that
strategy to find out clusters and catch the has been clustered so far.
evolution trend of cluster structures on a
categorical data stream. Therefore, this Fuyuan Cao in “A new initialization
paper presents an optimization model for method for categorical data clustering” has
clustering categorical data streams. An revealed that a novel initialization method
iterative optimization algorithm is for categorical data is proposed, in which
proposed to solve an optimal solution of the distance between objects and the
the objective function with some density of the object is considered. We also
constraints. apply the proposed initialization method to
Hung-Leng Chen in “Catching the trend: k-modes algorithm and fuzzy k-modes
A framework for clustering concept- algorithm.
drifting categorical data” has revealed that
sampling has been recognized as an
important technique to improve the
efficiency of clustering. Mechanism 3. PROPOSED WORK:
named Maximal Resemblance Data
Labeling (abbreviated as MARDL) is 3.1. BLOCK DIAGRAM
proposed to allocate each unlabeled data
point into the corresponding appropriate The block diagram of the proposed
cluster based on the novel categorical system is presented in figure 1.
clustering representative, namely, N-Node
set Importance
Representative(abbreviated as NNIR),
which represents clusters by the
importance of the combinations of
attribute values.

Fuyuan Caoin in “A framework for

clustering categorical time-evolving data”
had observed that, the problem of
clustering categorical time-evolving data
remains as a challenging issue. In this
paper, we propose a generalized clustering
framework for categorical time-evolving
data. The time-complexity analysis
indicates that these proposed algorithms
are effective for large datasets.

Daniel Barbara in “COOLCAT: An

entropy-based algorithm for categorical
“had investigated COOLCAT is well
equipped to deal with clustering of data
streams (continuously arriving streams of
data point) since it is an incremental Fig 1. Working of the Proposed System
algorithm capable of clustering new points
7
3.2. CLUSTERING FRAMEWORK
In order to cluster categorical data
streams and detect the drifting concepts,
we apply a clustering framework based on
the sliding window technique. The sliding
window technique conveniently eliminates
the outdated records and only saves the
clustering models, which is utilized in
several previous works on clustering time-
evolving data. Therefore, based on the
technique, we can cluster the latest data
objects in the current window and catch
the evolution trend of cluster structures on
the data stream. The different partition
results maybe lead to the different
detection results of drifting concepts.
Therefore, we need the optimization model
to find out the optimal partition result for
the new input data subset.
3.3. DEPSO ALGORITHM
DE-PSO starts like the usual DE
algorithm up to the point where the trial
vector is generated. If the trial vector
satisfies the conditions, then it is included
in the population otherwise the algorithm
enters the PSO phase and generates a new
candidate solution. The method is repeated
iteratively till the optimum value is
reached. The inclusion of PSO phase
creates a perturbation in the population,
which in turn helps in maintaining
diversity of the population and producing a
good optimal solution.
3.4. THE DRIFTING CONCEPT
DETECTION
After clustering new input data
subsets, we need to analyze the change
situation between the new and last
clustering models, in order to determine
whether the drifting concepts occur. While
the concepts have drifted, the last
clustering model is not used to participate
in the construction of the new clustering
model. In the case, we need to re-cluster
the new input data subset. we consider the
following two factors to find out the
drifting concepts such as distribution
variation and certainty variation.
The distribution variation may reduce
or enhance the uncertainty of the
clustering model for cluster
representatives. If the uncertainty is
reduced, it is thought that the concepts do
not drift, although the distribution
variation is large.
3.5. CLUSTERING ACCURACY
EVALUATION
To evaluate the performance of
clustering algorithms in the experiment,
we consider the three validity measures
accuracy, precision and recall and the
formulas are as follows
1) accuracy(AC)
2) precision (PE)
3) recall (RE)
RE=
4. EXPERIMENTAL SETUP
Here we can use KDD-CUP’99 data
stream for our experiment. Table 1 shows
the computational times against the
numbers of clusters. According to the
table, the DEPSO algorithm requires more
computational times than iterative
algorithms.
4
effectively clustering with drifting
No. of Iterative DEPSO concepts was presented. Finally, the
Iteration Algorithm Algorithm performance of the proposed algorithm is
tested and the experimental results have
5 169.12 172.7 shown that the proposed algorithm is
effective in clustering the data streams and
10 256.88 262.34
the detection results based on the proposed
15 371.69 385.52 method are reliable. This work has a very
vast scope in future and it can be
20 458.69 467.21 implemented on other new heuristic
algorithms in future. It can be updated in
Table 1. Computational Times (Seconds) near future as and when requirement for
of Clustering Algorithms for Different the same arises, as it is very flexible in
Numbers of Clusters terms of efficiency.

The figure 2 shows the computational

time of iterative algorithm and DEPSO
algorithm for different number of clusters.
The DEPSO algorithm shows the better
computational time when compared with
iterative algorithm.
Fig.2. Computational Times (Seconds) of
Clustering Algorithms for Different
Numbers of Clusters
5. CONCLUSION
In this paper, Differential evolutionary
particle swarm optimization algorithm for
REFERENCES
[1] Liang Bai, Xueqi Cheng, Member,
IEEE, Jiye Liang, and Huawei Shen., “An
Optimization Model for Clustering
Categorical Data Streams with Drifting
Concepts”, IEEE Transactions on
Knowledge and Data Engineering, Vol.
28 , Issue. 11, Nov. 2016.
[2] L. Bai, J. Liang, C. Dang, and F.
Cao, “The impact of cluster
representatives on the convergence of the
K-modes type clustering,” IEEE Trans.
Pattern Anal. Mach. Intell., vol. 35, no. 6,
pp. 1509– 1522, Jun. 2013.
[3] L. Bai, J. Liang, and C. Dang, “An
initialization method to simultaneously
find initial cluster centers and the number
of clusters for clustering categorical data,”
Knowl.-Based Syst., vol. 24, no. 6, pp.
785–795, 2011.
[4] S. Ho and H. Wechsler, “A
martingale framework for detecting
changes in data streams by testing
exchangeability,” IEEE Trans. Pattern
Anal. Mach. Intell., vol. 32, no. 20, pp.
2113–2127, Dec 2010.
[5] F. Cao, J. Liang, and L. Bai, “A
framework for clustering categorical time-
7
evolving data,” IEEE Trans. Fuzzy Syst.,
vol. 18, no. 5, pp. 872–885, Oct. 2010.
[6] K. Chen and L. Liu, “HE-tree: A
framework for detecting changes in
clustering structure for categorical data
streams,” Int. J. Very Large Data Bases,
vol. 18, no. 5, pp. 1241–1260, 2009.
[7] H. Chen, M. Chen, and S. Lin,
“Catching the trend: A framework for
clustering concept-drifting categorical
data,” IEEE Trans. Knowl. Data Eng., vol.
21, no. 5, pp. 652–665, May 2009.