公开(公告)号：KR1020080008573A

公开(公告)日：2008-01-24

申请号：KR1020060067996

申请日：2006-07-20

Applicant: 성균관대학교산학협력단

Inventor： 신준 ,  백주련 ,  김응모

IPC: G06F9/44 ,  G06F17/00

CPC classification number: G06F17/2247 ,  G06F17/2264 ,  G06F17/227

Abstract: A method for extracting an association rule from XML(eXtensible Markup Language) data is provided to extract the association rule effectively with a reduced calculating quantity, a performance time and an efficient mode by extracting the frequent sub-tree from XML documents based on a newly designed cross filtering algorithm. An XML set or a tree set is converted into a pair set by generating the pair set while visiting all trees of the tree set one by one in a DFS(Depth First Search) mode, and adding an ID of a visited tree to a tree ID list corresponding to a key when a key of the visited node is found in the pair set of a corresponding depth while visiting all nodes from a root node in the DFS mode. The sub-tree frequently generated in the pair set is found by using the cross filtering algorithm. The association rule is extracted from the frequent set of the pair set after cross filtering.

Abstract translation: 提供一种从XML（可扩展标记语言）数据中提取关联规则的方法，通过基于新的XML文档从XML文档中提取频繁子树，从而有效减少计算量，执行时间和有效模式，提取关联规则 设计交叉过滤算法。 通过在DFS（深度优先搜索）模式中一个接一个地访问树中的树的所有树生成对集合，将XML集或树集转换成对，并将访问树的ID添加到树中 当在DFS模式下从根节点访问所有节点时，在对应深度的对集合中找到访问节点的密钥时，对应于密钥的ID列表。 通过使用交叉过滤算法，可以找到频繁生成的配对集中的子树。 关联规则是从交叉过滤后的对集合的频繁集合中提取的。