首页> 外国专利> A list-based method and apparatus for extracting the maximum frequency subtree

A list-based method and apparatus for extracting the maximum frequency subtree

机译:基于列表的提取最大频率子树的方法和装置

摘要

A method and a device for extracting a maximal frequent sub-tree are provided to extract a maximal frequent sub-tree efficiently by changing a hierarchy tree structure to a linked tree structure. A method for efficiently extracting a maximal frequent sub-tree based on a list comprises the steps of: creating a linked tree structure by using pre-stored trees(1110); calculating a minimum tree number by using the number of total trees and a pre-stored minimum map value creating a list structure; creating a purified list structure by removing a list having elements below the minimum number of trees; creating a seed corresponding to a lable stored at each list(1120); crating a lable header table by mapping the stored lable and the address value of the created seed; creating a seed tree by using a seed and lable header table; and extracting a maximal frequent sub-tree by performing a pruning as to the created seed tree(1125).
机译:提供一种用于提取最大频繁子树的方法和设备,以通过将层次树结构改变为链接树结构来有效地提取最大频繁子树。一种用于基于列表有效地提取最大频繁子树的方法,包括以下步骤:通过使用预存储的树来创建链接树结构(1110);以及通过使用总树数和预先存储的创建地图结构的最小地图值来计算最小树数;通过删除具有低于最小树数的元素的列表来创建纯净的列表结构;创建与存储在每个列表中的标签相对应的种子(1120);通过映射存储的标签和所创建种子的地址值来创建标签头表;通过使用种子和标签头表创建种子树;通过对所创建的种子树进行修剪来提取最大频繁子树(1125)。

著录项

  • 公开/公告号KR100908301B1

    专利类型

  • 公开/公告日2009-07-17

    原文格式PDF

  • 申请/专利权人

    申请/专利号KR20070054839

  • 发明设计人 백주련;김응모;

    申请日2007-06-05

  • 分类号G06F17/30;G06F17/40;

  • 国家 KR

  • 入库时间 2022-08-21 19:11:48

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号