EFoX: A Scalable Method for Extracting Frequent Subtrees

摘要

The more web data sources provide XML data, the greater information flood problem has been caused. Hence, there have been increasing demands for efficient methods of discovering desirable patterns from a large collection of XML data. In this paper, we propose a new and scalable algorithm, EFoX, to mine frequently occurring tree patterns from a set of labeled trees. The main contribution made by our algorithm is that there is no need to perform any tree join operation to generate candidate sets.