期刊文献+

基于网格结构的数据流在线快速聚类算法 被引量:1

Online Clustering Algorithm Based on Grid Structure
下载PDF
导出
摘要 针对现有的数据流聚类算法不能在线实时生成用户需要的聚类结果问题,提出一种基于滑动窗口的数据流在线聚类算法.该算法采用密度网格存储结构,实现了数据流的在线聚类过程,能实时地向用户提供聚类结果,动态地检测数据流的进化情况.实验结果表明,该方法具有快速在线聚类能力,并能保证良好的聚类质量. As the most existing stream clustering algorithms can not generate online clustering results in real-time,an online data stream clustering algorithm is proposed by using sliding windows and density-based grid storage structure.The algorithm achieves a rapid speed for online clustering data stream and it can provide users with real-time clustering results and reflect the dynamic evolution of data streams.Experimental results show that the algorithm proposed has a good capacity of dealing with rapid evolutional data stream and have a good clustering quality.
出处 《北京工业大学学报》 EI CAS CSCD 北大核心 2011年第10期1575-1579,共5页 Journal of Beijing University of Technology
基金 国家自然科学基金资助项目(60496322)
关键词 数据挖掘 数据流 在线聚类 data mining data stream online clustering
  • 相关文献

参考文献9

  • 1HAN J, KAMBER M. Data mining: concepts and techniques[ M ]. 2nd ed. San Francisco: Morgan Kaufmann Publishers, 2006 : 467-589.
  • 2GABER M, ZASLAVSKY A, KRISHNASWAMY S. Mining data streams: a review [ J]. ACM SIGMOD Record, 2005, 34 (2) : 18-26.
  • 3GUHA S, MISHRA N, MEYERSON A, et al. Streaming-data algorithms for high-quality clustering[ C]//IProceedings of the lSth International Conference on Data Engineering. California: IEEE Computer Society, 2002: 685-704.
  • 4AGGARWAL C, HAN J, WANG J, et al. A frame-work for clustering evolving data streams[ C]////Proceedings of the 29th VLDB Conference. Berlin: VLDB Endowment, 2003: 81-92.
  • 5AGGARWAL C, HAN J, WANG J, et al. A framework for projected clustering of high dimensional data streams [ C ] //Proceedings of the 30th VLDB Conference. Toronto, Canada: VLDB Endowment, 2004 : 852-863.
  • 6CHEN 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. San Jose, California: ACM Press, 2007: 133-142.
  • 7BARBARA D. Requirements for clustering data streams [ J]. SIGKDD Explorations, 2003, 3 (2) : 23-27.
  • 8AGRAWAL R, GEHRKE J, GONO Polos D, et al. Automatic subspace clustering of high dimensional data for data mining applications[ C ]//Proceedings of 1998 ACM-SIGMOD International Conference on Management of Data. Seattle, WA: ACM Press, 1998: 94-105.
  • 9REN J, MAR. Density-based data streams clustering over sliding windows [ C ] //Proceedings of the 6th International Conference on Fuzzy Systems and Knowledge Discovery. Tianjin: IEEE Computer Society, 2009: 248-252.

同被引文献3

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部