Aiming at the problem that the traditional stream clustering algorithm cannot effectively deal with the inspection and treatment of outliers
and the incremental data stream clustering efficiency is low
an enhanced stream clustering algorithm based on affinity propagation using density measurement was proposed. Based on the STRAP
the proposed algorithm can improve the clustering accuracy and efficiency by introducing a mechanism for outlier detection and removal. Firstly
the online stream clustering process is realized by the affinity propagation algorithm. Meanwhile
the phenomenon of data drift is detected
i.e.
the distribution of data stream changes with time. In view of this phenomenon
the new algorithm can implement the outlier detection and removal in the reservoir based on local outlier factor
and then re-cluster the current cluster and the treated reservoir to reconstruct the dynamic stream clustering model. Finally
through the validation on the KDD'99 data
the experimental results showed that the proposed algorithm not only reduces the number of re-clustering and improves the clustering efficiency
but also is superior to the STRAP in terms of the three clustering evaluation criteria
i.e.
the clustering accuracy
purity and entropy.
关键词
Keywords
references
SILVA J A, FARIA E R, BARROS R C, et al. Data stream clustering: a survey [J]. ACM Computing Surveys, 2013, 46(1): 125-134.
ZHOU Aoying, CAO Feng, QIAN Weining, et al. Tracking clusters in evolving data streams over sliding windows [J]. Knowledge and Information Systems, 2008, 15(2): 181-214.
ACKERMANN M R, MARTENS M, RAUPACH C, et al. StreamKM++: a clustering algorithm for data streams [J]. Journal of Experimental Algorithmics, 2012, 17: 173-187.
CAO Feng, ESTER M, QIAN Weining, et al. Density-based clustering over an evolving data stream with noise [C]∥SIAM International Conference on Data Mining. Philadelphia, PA, USA: SIAM, 2006: 328-339.
RODRIGUES P P, GAMA J, PEDROSO J P. ODAC: hierarchical clustering of time series data streams [C]∥ Proceedings of the 2006 SIAM International Conference on Data Mining. Philadelphia, PA, USA: SIAM, 2006: 615-627.
GAMA J, RODRIGUES P P, LOPES L M B. Clustering distributed sensor data streams using local processing and reduced communication [J]. Intelligent Data Analysis, 2011, 15(1): 3-28.
FREY B J, DUECK D. Clustering by passing messages between data points [J]. Science, 2007, 315(5814): 972-976.
ZHANG Xiangliang, FURTLEHNER C, SEBAG M. Data streaming with affinity propagation [C]∥ Lecture Notes in Computer Science. Berlin, Germany: Springer, 2008: 628-643.
ZHANG Xiangliang, FURTLEHNER C, GERMAIN-RENAUD C, et al. Data stream clustering with affinity propagation [J]. IEEE Transactions on Knowledge Data Engineering, 2014, 26(7): 1644-1656.
HA J, SEOK S, LEE J S. Robust outlier detection using the instability factor [J]. Knowledge-Based Systems, 2014, 63(2): 15-23.
BREUNIG M M, KRIEGEL H P, NG R T, et al. LOF: identifying density-based local outliers [J]. ACM Sigmod Record, 2000, 29(2): 93-104.
WU Junjie, HUI Xiong, CHEN Jian. Adapting the right measures for K-means clustering [C]∥Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York, USA: ACM, 2009: 877-886.