首页> 外文会议>International Conference on Advanced Mechanical Engineering >Research on Dynamic Data Streams Clustering Algorithm -Pdstream based on PCA and Density
【24h】

Research on Dynamic Data Streams Clustering Algorithm -Pdstream based on PCA and Density

机译:基于PCA和密度的动态数据流集群聚类算法研究

获取原文

摘要

The research on data streams clustering has become a focus in the field of data streams mining. Because the number of data streams is too large, and CPU of the computer has limited memory and time, it's difficult to carry out clustering quickly and effectively. For that problem, we design an improved clustering algorithm for dynamic data streams based on principal component analysis and density. The PDStream algorithm effectively overcomes the shortcomings of the STREAM algorithm controlled by historical data and the CluStream algorithm is difficult to describe non-spherical and out "old data", resulting in huge amount of data. In the course of the experiment, we compare with the STREAM algorithm, the PDStream algorithm shows the superiority of handling mass data and the characteristics of high-quality clustering.
机译:数据流集群的研究已成为数据流挖掘领域的焦点。由于数据流的数量太大,并且计算机的CPU内存和时间有限,因此很难快速有效地进行聚类。对于该问题,我们根据主成分分析和密度设计一种改进的动态数据流群集算法。 PDStream算法有效地克服了历史数据控制的流算法的缺点,并且Clustram算法难以描述非球形和“旧数据”,从而产生大量数据。在实验过程中,我们与流算法进行比较,PDStream算法显示了处理质量数据的优越性和高质量聚类的特性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号