[1] HAN J, KAMBER M, PEI J. Data mining: concepts and tech-niques [M]. FAN M, MENG X, translated. 3rd ed. Beijing: China Machine Press, 2013: 288-347.(HAN J, KAMBER M,裴健.数据挖掘:概念与技术[M].范明,孟小峰,译.3版.北京:机械工业出版社,2013:288-347.) [2] AGGARWAL C C, HAN J, WANG J, et al. A framework for clus-tering evolving data streams [C]// Proceedings of the 29th International Conference on Very Large Data Bases. [S.l.]: VLDB Endowment, 2003: 81-92. [3] AGGARWAL C C, HAN J, WANG J, et al. A framework for projected clustering of high dimensional data streams [C]// Proceedings of the 30th International Conference on Very Large Data Bases. [S.l.]: VLDB Endowment, 2004: 852-863. [4] CAO F, ESTER M, QIAN W, et al. Density-based clustering over an evolving data stream with noise [C]// Proceedings of the Sixth SIAM International Conference on Data Mining. Philadelphia: SIAM, 2006: 328-339. [5] CHEN Y, TU L. Density-based clustering for real-time stream data [C]// Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2007: 133-142. [6] CHEN Y, TU L. Stream data clustering based on grid density and attraction [J]. ACM Transactions on Knowledge Discovery from Data, 2009, 3(3): 12-20. [7] YANG N, TANG C, WANG Y, et al. Clustering algorithm on data stream with skew distribution based on temporal density [J]. Journal of Software, 2010, 21(5): 1031-1041.(杨宁,唐常杰,王悦,等.一种基于时态密度的倾斜分布数据流聚类算法.软件学报,2010,21(5):1031-1041.) [8] NTOUTSI I, ZIMEK A, PALPANAS T, et al. Density-based projected clustering over high dimensional data streams [C]// Proceedings of the Twelfth SIAM International Conference on Data Mining. Philadelphia: SIAM, 2012: 987-998. [9] YU Y, WANG Q, KUANG J, et al. An on-line density-based clustering algorithm for spatial data stream [J]. Acta Automatica Sinica, 2012, 38(6): 1051-1058.(于彦伟,王沁,邝俊,等.一种基于密度的空间数据流在线聚类算法[J].自动化学报,2012,38(6):1051-1058.) [10] ZHANG X, FURTLEHNER C, SEBAG M. Data streaming with affinity propagation [C]// Proceedings of the 2008 Machine Learning and Knowledge Discovery in Databases, LNCS 5212. Berlin: Springer, 2008: 628-643. [11] ZHANG J, CHEN F, LI S, et al. Data stream clustering algorithm based on density and affinity propagation techniques [J]. Acta Automatica Sinica, 2014, 40(2): 277-288.(张建朋,陈福才,李绍梅,等.基于密度与近邻传播的数据流聚类算法[J].自动化学报,2014,40(2):277-288.) [12] LIU D, JIANG M. Affinity propagation clustering on oral conversation texts [C]// ICSP 2012: Proceedings of 2012 IEEE 11th International Conference on Signal Processing. Piscataway: IEEE, 2012: 2279-2282. [13] ZHANG X, FURTLEHNER C, GERMAIN-RENAUD C, et al. Data stream clustering with affinity propagation [J]. IEEE Transactions on Knowledge and Data Engineering, 2014, 26(7): 1644-1656. [14] HUANG D, WU T. Density-based clustering algorithm for mixture data sets [J]. Control and Decision, 2010, 25(3): 416-421.(黄德才,吴天虹.基于密度的混合属性数据流聚类算法[J].控制与决策,2010,25(3):416-421.) [15] FUJIWARA Y, IRIE G, KITAHARA T, et al. Fast algorithm for affinity propagation [C]// Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Piscataway: IEEE, 2011: 2238-2243. |