Ranking episodes using a partition model

DOI10.1007/S10618-015-0419-9MaRDI QIDQ1715896zbMATH OpenOpenAlexFDO

Authors Nikolaj Tatti

Publication date 29 January 2019

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1902.01002

zbMATH Keywords

episode miningpartition modelpattern ranking

Mathematics Subject Classification ID

Statistical ranking and selection procedures (62F07) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Abstract: One of the biggest setbacks in traditional frequent pattern mining is that overwhelmingly many of the discovered patterns are redundant. A prototypical example of such redundancy is a freerider pattern where the pattern contains a true pattern and some additional noise events. A technique for filtering freerider patterns that has proved to be efficient in ranking itemsets is to use a partition model where a pattern is divided into two subpatterns and the observed support is compared to the expected support under the assumption that these two subpatterns occur independently. In this paper we develop a partition model for episodes, patterns discovered from sequential data. An episode is essentially a set of events, with possible restrictions on the order of events. Unlike with itemset mining, computing the expected support of an episode requires surprisingly sophisticated methods. In order to construct the model, we partition the episode into two subepisodes. We then model how likely the events in each subepisode occur close to each other. If this probability is high---which is often the case if the subepisode has a high support---then we can expect that when one event from a subepisode occurs, then the remaining events occur also close by. This approach increases the expected support of the episode, and if this increase explains the observed support, then we can deem the episode uninteresting. We demonstrate in our experiments that using the partition model can effectively and efficiently reduce the redundancy in episodes.

Recommendations

• Discovering episodes with compact minimal windows
• Statistical significance of episodes with general partial orders
• Mining closed strict episodes
• Discovering injective episodes with general partial orders
• scientific article; zbMATH DE number 1041844

Cites work

• Discovering episodes with compact minimal windows
• Discovering injective episodes with general partial orders
• Discovering significant patterns
• scientific article; zbMATH DE number 3241743 (Why is no real title available?)
• Mining closed strict episodes
• Mining Compressing Sequential Patterns

Cited in

(7)

• Skopus: mining top-\(k\) sequential patterns under leverage
• Discovering injective episodes with general partial orders
• SPEck: mining statistically-significant sequential patterns efficiently with exact sampling
• Efficiently mining cohesion-based patterns and rules in event sequences
• Discovering episodes with compact minimal windows
• scientific article; zbMATH DE number 2084855 (Why is no real title available?)
• Statistical significance of episodes with general partial orders

Describes a project that uses

Uses Software

• BIDE

This page was built for publication: Ranking episodes using a partition model

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