A practical algorithm to find the best episode patterns

DOI10.1007/3-540-45650-3_37MaRDI QIDQ4736067zbMATH OpenFDO

Authors Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, S. Arikawa

Publication date 9 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2226/22260435.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• An algorithm for segmenting categorical time series into meaningful episodes
• Compact recognizers of episode sequences
• Discovery of core episodes from sequences. Using generalization for defragmentation of rule sets
• Discovering episodes with compact minimal windows
• Ranking episodes using a partition model

Cited in

(8)

• A practical algorithm to find the best subsequence patterns
• A survey of temporal data mining
• Finding best patterns practically
• Episode matching
• Discovering episodes with compact minimal windows
• scientific article; zbMATH DE number 2114411 (Why is no real title available?)
• Missing pattern discovery
• String Indexing with Compressed Patterns

This page was built for publication: A practical algorithm to find the best episode patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736067)