Sciweavers

Share
SBBD
2004

An Apriori-based Approach for First-Order Temporal Pattern Mining

9 years 22 days ago
An Apriori-based Approach for First-Order Temporal Pattern Mining
Previous studies on mining sequential patterns have focused on temporal patterns specified by some form of propositional temporal logic. However, there are some interesting sequential patterns whose specification needs a more expressive formalism, the first-order temporal logic. In this paper, we focus on the problem of mining multisequential patterns which are first-order temporal patterns (not expressible in propositional temporal logic). We propose two Apriori-based algorithms to perform this mining task. The first one, the PM (Projection Miner) Algorithm adapts the key idea of the classical GSP algorithm for propositional sequential pattern mining by projecting the first-order pattern in two propositional components during the candidate generation and pruning phases. The second algorithm, the SM (Simultaneous Miner) Algorithm, executes the candidate generation and pruning phases without decomposing the pattern, that is, the mining process, in some extent, does not reduce itself to...
Sandra de Amo, Daniel A. Furtado, Arnaud Giacomett
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2004
Where SBBD
Authors Sandra de Amo, Daniel A. Furtado, Arnaud Giacometti, Dominique Laurent
Comments (0)
books