Sciweavers

158 search results - page 11 / 32
» Discovering frequent patterns in sensitive data
Sort
View
DAWAK
2004
Springer
13 years 11 months ago
PROWL: An Efficient Frequent continuity Mining Algorithm on Event Sequences
Mining association rule in event sequences is an important data mining problem with many applications. Most of previous studies on association rules are on mining intra-transaction...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin
CIKM
1998
Springer
13 years 11 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
SSD
2001
Springer
218views Database» more  SSD 2001»
13 years 12 months ago
Efficient Mining of Spatiotemporal Patterns
The problem of mining spatiotemporal patterns is finding sequences of events that occur frequently in spatiotemporal datasets. Spatiotemporal datasets store the evolution of object...
Ilias Tsoukatos, Dimitrios Gunopulos
ICDM
2008
IEEE
130views Data Mining» more  ICDM 2008»
14 years 1 months ago
Mining Temporal Patterns with Quantitative Intervals
In this paper we consider the problem of discovering frequent temporal patterns in a database of temporal sequences, where a temporal sequence is a set of items with associated da...
Thomas Guyet, Rene Quiniou
IJAR
2011
118views more  IJAR 2011»
12 years 11 months ago
A sequential pattern mining algorithm using rough set theory
Sequential pattern mining is a crucial but challenging task in many applications, e.g., analyzing the behaviors of data in transactions and discovering frequent patterns in time se...
Ken Kaneiwa, Yasuo Kudo