An efficient one-pass method for discovering bases of recently frequent episodes over online data streams


Autoria(s): Gan, Min; Dai, Honghua
Data(s)

01/07/2012

Resumo

<i>The knowledge embedded in an online data stream is likely to change over time due to the dynamic evolution of the stream. Consequently, infrequent episode mining over an online stream, frequent episodes should be adaptively extracted from recently generated stream segments instead of the whole stream. However, almost all existing frequent episode mining approaches find episodes frequently occurring over the whole sequence. This paper proposes and investigates a new problem: online mining of recently frequent episodes over data streams. In order to meet strict requirements of stream mining such as one-scan, adaptive result update and instant result return, we choose a novel frequency metric and define a highly condensed set called the base of recently frequent episodes. We then introduce a one-pass method for mining bases of recently frequent episodes. Experimental results show that the proposed method is capable of finding bases of recently frequent episodes quickly and adaptively. The proposed method outperforms the previous approaches with the advantages of one-pass, instant result update and return, more condensed resulting sets and less space usage.</i>

Identificador

http://hdl.handle.net/10536/DRO/DU:30047064

Idioma(s)

eng

Publicador

ICIC International

Relação

http://dro.deakin.edu.au/eserv/DU:30047064/gan-anefficientonepass-2012.pdf

Direitos

2012, ICIC International

Palavras-Chave #Data streams #Online mining #Recently frequent episodes
Tipo

Journal Article