首页> 外国专利> METHOD FOR PARALLEL MINING OF TEMPORAL RELATIONS IN LARGE EVENT FILE

METHOD FOR PARALLEL MINING OF TEMPORAL RELATIONS IN LARGE EVENT FILE

机译:大型事件文件中时间关系的并行挖掘方法

摘要

Disclosed herein is a method for parallel mining of temporal relations in a large event file using a MapReduce model. In the method for parallel mining of temporal relations in a large even file according to the present invention, an event file is sorted based on customer identification (ID) and event time at which each event has occurred. A set of large event types satisfying a preset support or more is generated from the event file. The event file is converted into a large event sequence including the large event type set. The large event sequence is summarized and then a time interval data file is created. Candidate temporal relations are generated from the time interval data file, and frequent temporal relations satisfying a preset support or more are derived from the candidate temporal relations. A temporal relation rule is generated from the derived frequent temporal relations.
机译:本文公开了一种用于使用MapReduce模型并行挖掘大事件文件中的时间关系的方法。在根据本发明的用于在大型偶数文件中并行挖掘时间关系的方法中,事件文件是基于客户标识(ID)和每个事件发生的事件时间进行分类的。从事件文件中生成一组满足预设支持或更多支持的大型事件类型。事件文件将转换为包含大型事件类型集的大型事件序列。总结大事件序列,然后创建一个时间间隔数据文件。从时间间隔数据文件生成候选时间关系,并且从候选时间关系中导出满足预设支持或更多的频繁时间关系。从导出的频繁时间关系中生成时间关系规则。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号