Science & Engineering Research Support soCiety (SERSC)
Tree structures are used extensively in domains such as XML data management, web log analysis, biological computing, and so on. In this paper, the authors introduce the problem of mining frequent sequential trees in a large tree sequence database. They present a framework for mining frequent sequential trees in a so-called tree sequence database. Basically, this framework employs a transformation-based approach which converts the sequential tree mining problem into a traditional sequence mining problem. Their approach firstly mines frequent trees in the tree sequence database.