A simple characterization on serially constructible episodes

Authors:
Takashi Katoh;Kouichi Hirata
Affiliations:
Graduate School of Computer Science and Systems Engineering, Kyushu Institute of Technology, Iizuka, Japan;Department of Artificial Intelligence, Kyushu Institute of Technology, Iizuka, Japan
Venue:
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Year:
2008

Citing 3
Cited 2

Discovery of Frequent Episodes in Event Sequences

Data Mining and Knowledge Discovery
Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach

IEEE Transactions on Knowledge and Data Engineering
Mining sectorial episodes from event sequences

DS'06 Proceedings of the 9th international conference on Discovery Science

Mining Frequent Bipartite Episode from Event Sequences

DS '09 Proceedings of the 12th International Conference on Discovery Science
Mining frequent k-partite episodes from event sequences

JSAI-isAI'09 Proceedings of the 2009 international conference on New frontiers in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a parallel-free episode that always has an arc between vertices with the same label and a serially constructible episode that is embedded into every parallel-free episode containing all of the serial episodes occurring in it. Then, we show that an episode is parallel-free if and only if it is serially constructible.