【24h】

Empirical Comparison of Clustering Methods for Long Time-Series Databases

机译:长时间系列数据库聚类方法的经验比较

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

This paper presents a comparative study of methods for clustering long-term temporal data. We split a clustering procedure into two processes: similarity computation and grouping. As similarity computation methods, we employed dynamic time warping (DTW) and multiscale matching. As grouping methods, we employed conventional agglomerative hierarchical clustering (AHC) and rough sets-based clustering (RC). Using various combinations of these methods, we performed clustering experiments of the hepatitis data set and evaluated validity of the results. The results suggested that (1) complete-linkage (CL) criterion outperformed average-linkage (AL) criterion in terms of the interpret-ability of a dendrogram and clustering results, (2) combination of DTW and CL-AHC constantly produced interpretable results, (3) combination of DTW and RC would be used to find the core sequences of the clusters, (4) multiscale matching may suffer from the treatment of 'no-match' pairs, however, the problem may be eluded by using RC as a subsequent grouping method.
机译:本文介绍了聚类长期时间数据的方法的比较研究。我们将群集过程拆分为两个进程:相似性计算和分组。作为相似性计算方法,我们采用动态时间翘曲(DTW)和多尺度匹配。作为分组方法,我们使用常规的凝聚层次聚类(AHC)和基于粗糙集的聚类(RC)。使用这些方法的各种组合,我们对肝炎数据集进行了聚类实验并评估了结果的有效性。结果表明(1)完全连锁(CL)标准在树木和聚类结果的解释能力方面表现出平均连杆(A1)标准,(2)DTW和CL-AHC的组合不断产生可解释结果,(3)DTW和RC的组合将用于找到簇的核心序列,(4)多尺度匹配可能遭受“无匹配”对的处理,但是,使用RC可以抵消问题后续分组方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号