作者: Setsuo Arikawa , Shinji Kawasoe , Kenji Abe , Hiroki Arimura , Tatsuya Asai
DOI:
关键词:
摘要: In this paper, we study an online data mining problem from a stream of semi-structured such as XML data. Modeling and patterns labeled ordered trees, present algorithm StreamT that receives fragments unseen possibly infinite in the document order through stream, can return current set frequent immediately on request at any time. Moreover, discuss candidate management policy StreamT. We some policies empirically behavior algorithms with each policy. Experiments show forgetting model computes really without influenced by past events.