A Novel Coverage Pattern Mining Method for Unordered Tree

Abstract

Unordered tree is widely used for semi-structured data modeling, coverage pattern mining on it has benefit for finding frequent subtrees without redundant information, so that improve the efficiency of subsequent knowledge discovering. A coverage pattern mining method MCRP is proposed. Firstly, all candidate subtrees are generated on the basis of maximum prefix coding and edge extension.Then coverage patterns are output by introducing δ ᇱ -coverage concept. Compared with traditional algorithms such as mining frequent closed tree patterns and maximal frequent tree patterns, the proposed method can output fewer frequent subtrees in the case of preserving all the frequent subtree information, and has a certain superiority in processing efficiency.