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

METHOD FOR PARALLEL MINING OF TEMPORAL RELATIONS IN LARGE EVENT FILE

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

摘要

A method for parallel exploration of temporal relationships in large event files using a MapReduce model is disclosed. The method for parallel exploration of a time relationship in a large event file according to the present invention comprises the steps of: arranging an event file based on a customer ID and an event time when an event occurs, and a type of frequent events satisfying more than a predetermined support degree in the event file. Generating a set, converting the event file into a frequent event sequence including the frequent event type set, generating a time interval file by summarizing the frequent event sequence, and generating a candidate time relationship in the time interval file. And generating a frequent time relationship that satisfies a predetermined support degree or more in the candidate time relationship, and generating a time relationship rule from the frequent time relationship.
机译:公开了一种使用MapReduce模型并行探索大型事件文件中的时间关系的方法。根据本发明的用于在大事件文件中并行探索时间关系的方法包括以下步骤:根据客户ID和事件发生时的事件时间来安排事件文件,以及满足更多事件的频繁事件的类型。比事件文件中的预定支持度高。生成集合,将事件文件转换为包括频繁事件类型集的频繁事件序列,通过汇总频繁事件序列来生成时间间隔文件,并在时间间隔文件中生成候选时间关系。并且,生成候选时间关系中满足预定支持度以上的频繁时间关系,并根据该频繁时间关系生成时间关系规则。

著录项

  • 公开/公告号KR102028708B1

    专利类型

  • 公开/公告日2019-10-07

    原文格式PDF

  • 申请/专利权人

    申请/专利号KR20130006078

  • 发明设计人 이용준;

    申请日2013-01-18

  • 分类号G06F17;G06F17/40;

  • 国家 KR

  • 入库时间 2022-08-21 11:47:39

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号