DocumentCode
2034425
Title
A new method of mining frequent closed trees in data streams
Author
Feng, Bo ; Xu, Yajing ; Zhao, Na ; Xu, Huimin
Author_Institution
Sch. of Inf. & Commun. Eng., Beijing Univ. of Posts & Telecommun., Beijing, China
Volume
5
fYear
2010
fDate
10-12 Aug. 2010
Firstpage
2245
Lastpage
2249
Abstract
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.
Keywords
data mining; set theory; trees (mathematics); FBMiner; closed labeled tree mining; closed sets principle; data stream mining; frequent subtree mining; time-decay module; Accuracy; Algorithm design and analysis; Data mining; Itemsets; Knowledge engineering; NASA; data streams; frequent subtree mining; labeled closed subtree; set mining; time decay;
fLanguage
English
Publisher
ieee
Conference_Titel
Fuzzy Systems and Knowledge Discovery (FSKD), 2010 Seventh International Conference on
Conference_Location
Yantai, Shandong
Print_ISBN
978-1-4244-5931-5
Type
conf
DOI
10.1109/FSKD.2010.5569534
Filename
5569534
Link To Document