PRISM: A Prime-Encoding Approach for Frequent Sequence Mining
• 2007
Publication Information
Authors
Karam Gouda, Mosab Hassaan, and Mohammed J. Zaki†
Keywords
Not Available
Journal
Not Available
Publisher
Not Available
Volume
Not Available
Issue
Not Available
Pages
Not Available
publication.type
International
Paper Link
Not Available
Supplementary Materials
Not Available
Abstract
Sequence mining is one of the fundamental data mining
tasks. In this paper we present a novel approach called
PRISM, for mining frequent sequences. PRISM utilizes a
vertical approach for enumeration and support counting,
based on the novel notion of prime block encoding, which in
turn is based on prime factorization theory. Via an extensive
evaluation on both synthetic and real datasets, we show that
PRISM outperforms popular sequence mining methods like
SPADE [10], PrefixSpan [6] and SPAM [2], by an order of
magnitude or more.
tasks. In this paper we present a novel approach called
PRISM, for mining frequent sequences. PRISM utilizes a
vertical approach for enumeration and support counting,
based on the novel notion of prime block encoding, which in
turn is based on prime factorization theory. Via an extensive
evaluation on both synthetic and real datasets, we show that
PRISM outperforms popular sequence mining methods like
SPADE [10], PrefixSpan [6] and SPAM [2], by an order of
magnitude or more.
Staff Members - Benha University