...
首页> 外文期刊>Pattern Recognition: The Journal of the Pattern Recognition Society >A clustering procedure for exploratory mining of vector time series
【24h】

A clustering procedure for exploratory mining of vector time series

机译:矢量时间序列的探索性挖掘的聚类过程

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

A two-step procedure is developed for the exploratory mining of real-valued vector (multivariate) time series using partition-based clustering methods. The proposed procedure was tested with model-generated data, multiple sensor-based process data, as well as simulation data. The test results indicate that the proposed procedure is quite effective in producing better clustering results than a hidden Markov model (HMM)-based clustering method if there is a priori knowledge about the number of clusters in the data. Two existing validity indices were tested and found ineffective in determining the actual number of clusters. Determining the appropriate number of clusters in the case that there is no a priori knowledge is a known unresolved research issue not only for our proposed procedure but also for the HMM-based clustering method and further development is necessary. (c) 2007 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
机译:开发了一个两步过程,用于使用基于分区的聚类方法对实值向量(多元)时间序列进行探索性挖掘。使用模型生成的数据,基于多个传感器的过程数据以及模拟数据对提议的过程进行了测试。测试结果表明,如果对数据中的簇数具有先验知识,则与基于隐马尔可夫模型(HMM)的聚类方法相比,所提出的过程在产生更好的聚类结果方面非常有效。测试了两个现有的有效性指标,发现它们对确定群集的实际数量无效。在没有先验知识的情况下确定适当数目的聚类,不仅对于我们提出的程序,而且对于基于HMM的聚类方法,都是一个尚未解决的已知研究问题,因此有必要进一步发展。 (c)2007模式识别学会。由Elsevier Ltd.出版。保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号