METHOD AND DEVICE FOR EXTRACTING MAXIMAL FREQUENT SUBTREES BASED LIST STRUCTURE

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:...

Full description

Saved in:
Bibliographic Details
Main Authors KIM, UNG MO, PAIK, JU RYON
Format Patent
LanguageEnglish
Published 10.12.2008
Subjects
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online AccessGet full text

Cover

More Information
Summary: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).
Bibliography:Application Number: KR20070054839