Efficient serial episode mining with minimal occurrences

Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication, ICUIMC'09

Volumn , Issue , 2009, Pages 457-464

  Ohtani, Hideyuki ^a   Kida, Takuya ^a   Uno, Takeaki ^b   Arimura, Hiroki ^a  

^a HOKKAIDO UNIVERSITY   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

Closed sequences; Depth first algorithm; Frequent episode mining

Indexed keywords

CLOSED SEQUENCES; DEPTH-FIRST ALGORITHM; DEPTH-FIRST SEARCH ALGORITHM; EPISODE MINING; EVENT SEQUENCE; FREQUENT EPISODE MINING; FREQUENT EPISODES; KNOWLEDGE DISCOVERY; LARGE DATA; REAL DATA SETS; SEQUENCE OF EVENTS; TIME-SERIES DATA;

DATA MINING; LEARNING ALGORITHMS; MINING;

INFORMATION MANAGEMENT;

EID: 70349111841     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1516241.1516320     Document Type: Conference Paper

References (11)

1. S. Abiteboul, P. Buneman, D. Suciu, Data on the Web: From Relations to Semistructured Data and XML, Morgan Kaufmann, 1999.
2. A. V. Aho, J. E. Hopcroft, J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
3. H. Arimura, T. Uno, An Efficient Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence, J. Comb. Optim., Vol. 13, 243-262, 2006.
4. Hiroki Arimura and Takeaki Uno, Mining Maximal Flexible Patterns in a Sequence, Proc. LLLL2007, LNAI4914, Springer, 2008.
5. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, M. Hsu, PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth, Proc. IEEE ICDE 2001, 215-224, 2001.
6. Heikki Mannila, Hannu Toivonen, A. Inkeri Verkamo, Discovery of Frequent Episodes in Event Sequence, Data Mining and Knowledge Discovery, Vol. 1, 259-289, 1997.
7. Y. Uchida, An efficient algorithm for enumerating episodes in the window and closed episodes, Kyushu Univ ISEE, master thesis, 2004.
8. T. Uno, H. Arimura, Data intensive computing No. 2 - An algorithm for enumerating frequent item sets, Journal of the JSAE, Vol. 17(2), 2007.
9. Uno's Homepage, Nii, http://research.nii.ac.jp/uno/index-j.html
10. T. Uno, T. Asai, Y. Uchida, H. Arimura, An efficient algorithm for enumerating closed patterns in transaction databases, In DS'04, LNAI 3245, 16-30, 2004.
11. J. Wang, J. Han, BIDE: Efficient Mining of Frequent Closed Sequences, Proc. IEEE ICDE 2004, 79-90, 2004.