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

作者: Honghua Dai , Min Gan

DOI:

关键词: Computer scienceSequenceData miningMetric (mathematics)Space (commercial competition)One passData streamData stream miningSet (abstract data type)Base (topology)

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

参考文章(18)
Heikki Mannila, A. Inkeri Verkamo, Hannu Toivonen, Discovering Frequent Episodes in Sequences. knowledge discovery and data mining. pp. 210- 215 ,(1995)
Heikki Mannila, Hannu Toivonen, Discovering generalized episodes using minimal occurrences knowledge discovery and data mining. pp. 146- 151 ,(1996)
Honghua Dai, Min Gan, MINING CONDENSED SETS OF FREQUENT EPISODES WITH MORE ACCURATE FREQUENCIES FROM COMPLEX SEQUENCES International Journal of Innovative Computing Information and Control. ,vol. 8, pp. 453- 470 ,(2012)
Anny Ng, Ada Wai-Chee Fu, None, Mining frequent episodes for relating financial events and stock trends knowledge discovery and data mining. pp. 27- 39 ,(2003) , 10.5555/1760894.1760900
Honghua Dai, Min Gan, Obtaining accurate frequencies of sequential patterns over a single sequence ICIC express letters. ,vol. 5, pp. 1461- 1466 ,(2011)
Ramakrishnan Srikant, Rakesh Agrawal, Fast algorithms for mining association rules very large data bases. pp. 580- 592 ,(1998)
Ronnie Bathoorn, Monique Welten, Michael Richardson, Arno Siebes, Fons J. Verbeek, Frequent episode mining to support pattern analysis in developmental biology pattern recognition in bioinformatics. pp. 253- 263 ,(2010) , 10.1007/978-3-642-16001-1_22
Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal, Discovering Frequent Closed Itemsets for Association Rules international conference on database theory. ,vol. 1540, pp. 398- 416 ,(1999) , 10.1007/3-540-49257-7_25
Kuo-Yu Huang, Chia-Hui Chang, Efficient mining of frequent episodes from complex sequences Information Systems. ,vol. 33, pp. 96- 114 ,(2008) , 10.1016/J.IS.2007.07.003
K. Iwanuma, R. Ishihara, Yo Takano, H. Nabeshima, Extracting frequent subsequences from a single long data sequence a novel anti-monotonic measure and a simple on-line algorithm international conference on data mining. pp. 186- 193 ,(2005) , 10.1109/ICDM.2005.60