首页> 外文会议>Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining >A MPAA-Based Iterative Clustering Algorithm Augmented by Nearest Neighbors Search for Time-Series Data Streams
【24h】

A MPAA-Based Iterative Clustering Algorithm Augmented by Nearest Neighbors Search for Time-Series Data Streams

机译:基于MPAA的迭代聚类算法通过最近的邻居搜索时间序列数据流而增强

获取原文

摘要

In streaming time series the Clustering problem is more complex, since the dynamic nature of streaming data makes previous clustering methods inappropriate. In this paper, we propose firstly a new method to evaluate Clustering in streaming time series databases. First, we introduce a novel multi-resolution PAA (MPAA) transform to achieve our iterative clustering algorithm. The method is based on the use of a multi-resolution piecewise aggregate approximation representation, which is used to extract features of time series. Then, we propose our iterative clustering approach for streaming time series. We take advantage of the multiresolution property of MPPA and equip a stopping criteria based on Hoeffding bound in order to achieve fast response time. Our streaming time-series clustering algorithm also works by leveraging off the nearest neighbors of the incoming streaming time series datasets and fulfill incremental clustering approach. The comprehensive experiments based on several publicly available real data sets shows that significant performance improvement is achieved and produce high-quality clusters in comparison to the previous methods.
机译:在流时间序列中,聚类问题更复杂,因为流数据的动态性质使先前的群集方法不合适。在本文中,我们首先提出了一种新方法来评估流时间序列数据库中的聚类。首先,我们介绍一种新型多分辨率Paa(MPAA)变换,以实现我们的迭代聚类算法。该方法基于使用多分辨率分段聚合近似表示,其用于提取时间序列的特征。然后,我们提出了我们的迭代聚类方法,用于流媒体时间序列。我们利用MPPA的多分辨率特性,并根据霍夫·绑定的停止标准进行努力,以实现快速响应时间。我们的流定时级别聚类算法还通过利用传入的流时间序列数据集的最近邻居来实现,并满足增量聚类方法。基于几种公开的真实数据集的综合实验表明,与以前的方法相比,实现了显着的性能改进,并产生了高质量的群集。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号