A new method of mining frequent closed trees in data streams

In this paper, we present a closed labeled tree mining algorithm, FBMiner, based on the add-remove principle of closed sets which is newly introduced. Also, we propose a time-decay module to solve stream data mining which gives more attention on the latest data. Compared to the traditional mining algorithms in data stream, FBMiner performs well even that the data is of high complexity. The experiment shows that FBMiner is efficient in data streams mining by reducing consuming dramatically.