首页> 外文会议>Fuzzy Systems and Knowledge Discovery (FSKD), 2012 9th International Conference on >Mining scalable pattern based on temporal logic over data streams
【24h】

Mining scalable pattern based on temporal logic over data streams

机译:在数据流上基于时间逻辑挖掘可伸缩模式

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

摘要

In many data stream applications, data segments which are sequential and complicatedly changeable always imply great domain specific value. Especially in the field of medical survey, mining such sequential data segments will help making diagnosis. We discovered that, based on extensive analysis, although containing rich semantics, these data segments are actually composed of some certain basic units, and these units can form different kinds of complex patterns with duplication or lack in certain positions considering a temporal logic. Therefore, we present a scalable pattern mining method. With this method, the Scalable Pattern Tree (SPTree) structure is designed to support the expression of scalable semantics and efficient mining. At last, the experimental results on real datasets prove that our method is feasible and efficient.
机译:在许多数据流应用程序中,顺序且复杂变化的数据段始终暗示着特定于域的巨大价值。尤其是在医学调查领域,挖掘此类顺序数据段将有助于做出诊断。我们发现,基于广泛的分析,尽管这些数据段包含丰富的语义,但它们实际上是由某些特定的基本单元组成的,考虑到时间逻辑,这些单元可以形成某些类型的重复或缺少某些位置的复杂模式。因此,我们提出了一种可扩展的模式挖掘方法。通过这种方法,可伸缩模式树(SPTree)结构被设计为支持可伸缩语义的表达和有效的挖掘。最后,在真实数据集上的实验结果证明了该方法的可行性和有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号