期刊文献+

基于滑动窗口的支持泛在应用的流聚类挖掘算法 被引量:4

Clustering Algorithm for Ubiquitous Data Stream Mining Based on Slip Window
下载PDF
导出
摘要 近年来,泛在数据流挖掘逐渐成为数据挖掘发展的新热点,它具有在有限的资源上去挖掘无限的数据流,并可随时随地返回挖掘结果的特点,对此,本文提出一种基于滑动窗口的流聚类算法;该方法将一个滑动窗口分成n个大小相等的窗口单元,基于窗口单元进行增量式的知识相关性的挖掘,提高了流挖掘的效率;当窗口滑动时,通过衰变函数衰减当前滑动窗口内的第一个窗口单元的挖掘结果,并在当前滑动窗口挖掘结果中将其剔除,实现下一滑动窗口的增量式挖掘. Recently, ubiquitous Data Stream Mining has become a new focus of data mining gradually. For its having finite ubiquitous resource mine infinite data stream and returning outcome anytime and anywhere,this paper suggest stream clustering algorithm based on slip window. It divides a window into n average units, on which the increasable and knowledge-correlated mining is executed based, so as to heighten its efficiency. As window is to slip,algorithm weaken the first unit's outcome of current window with weakened function and eliminate its affect for current outcome so as to make true the next increasable mining in next window.
出处 《小型微型计算机系统》 CSCD 北大核心 2008年第12期2262-2267,共6页 Journal of Chinese Computer Systems
基金 国家自然基金项目(60573090)资助
关键词 滑动窗口 聚类挖掘 非线性数据流 slip window clustering mining non-linear data stream
  • 相关文献

参考文献8

  • 1Gaber M M, Zaslavsky A, Krishnaswamy S. A Cost-efficient model for ubiquitous data stream mining[C]. Tenth International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU 2004), Perugia Italy, July 4-9.
  • 2Gaber M M, Krishnaswamy S,Zaslavsky A. Cost-efficient mining techniques for data streams[C]. Australasian Workshop on Data Mining and Web Intelligence (DMWI2004), Dunedin, New Zealand. CRPIT, 32. Purvis, M. ,Ed. ACS.
  • 3Gaber M M,Krishnaswamy S, Zaslavsky A. Adaptive mining techniques for data streams using algorithm output granularity [C]. The Australasian Data Mining Workshop (AusDM 2003), Held in conjunction with the 2003 Congress on Evolutionary Computation (CEC 2003), December, Canberra, Australia, Springer Verlag, Lecture Notes in Computer Science (LNCS).
  • 4Chalaghan LO,Mishra N, Meyerson A,et al. Streaming data algorithms for high-quatlty clustering[C]. Proc.of the 18th Int'l Conf. on Data Engineering. San Jose, 2002,685-694.
  • 5Gaber M, Krishnaswamy S,Zaslavsky. A ubiquitous data stream mining [C]. Current Research and Future Directions Workshop Proceedings Held in Conjunction with PAKDD 2004, Sydney, Australia, May 26 2004.
  • 6Aggarwal C C,Han J ,Wang J ,et al. A framework for clustering evolving data streams[C]. Proc. of VLDB, 2003.
  • 7Shah R,Krishnaswamy S,Gaber M M. Resource-aware very fast K-Means for ubiquitous data stream mining[C]. Proceedings of Second International Workshop on Knowledge Discovery in Data Streams, to be Held in Conjunction with 16th European Conference on Machine Learning (ECML 2005) and the 9th European Conference on the Principals and Practice of Knowledge Discovery in Databases (PKDD 2005), Porto, Portugal, October 3-7, 2005.
  • 8Cao F,Ester M, Qian W, et al. Density-based clustering over an evolving data stream with noise[C]. Proc. of the SIAM Conf.on Data Mining (SDM). 2006.

同被引文献20

引证文献4

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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