首页> 外文会议>International Conference on Data Warehousing and Knowledge Discovery >A Single Pass Trellis-Based Algorithm for Clustering Evolving Data Streams
【24h】

A Single Pass Trellis-Based Algorithm for Clustering Evolving Data Streams

机译:一种基于格子的基于格子的群体演化数据流算法

获取原文

摘要

The main paradigm for clustering evolving data streams in the last 10 years has been to divide the clustering process into an online phase that computes and stores detailed statistics about the data in micro-clusters and an offline phase that queries micro-cluster statistics and returns desired clustering structures. The argument for two-phase algorithms is that they support evolving data streams and temporal multi-scale analysis, which single pass algorithms do not. In this paper, we describe a single pass fully online trellis-based algorithm, named ClusTrel, designed for centroid-based clustering that supports evolving data streams and generates clustering structures right after a new point is processed. The performance of ClusTrel is assessed and compared to state of the art algorithms for clustering of data streams showing similar performance with smaller memory footprint.
机译:在过去10年中聚类演化数据流的主要范例一直将聚类过程划分为计算和存储关于微集群中数据的详细统计的在线阶段以及查询微簇统计数据和返回所需的脱机阶段的详细统计聚类结构。两阶段算法的参数是它们支持不断发展的数据流和时间多尺度分析,单通算法没有。在本文中,我们描述了一个CARES完全在线网格基于网格的基于网站,名为Clustrel,专为基于质心的聚类而设计,支持在处理新点之后立即生成群集结构的基于质心的群集。分析和比较Clustrel的性能,并与最先进的数据流群体的状态进行比较,显示具有较小存储空间的类似性能的数据流。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号