Sciweavers

102 search results - page 17 / 21
» On the Complexity of Mining Temporal Trends
Sort
View
EDBT
2009
ACM
170views Database» more  EDBT 2009»
15 years 1 months ago
Efficient constraint evaluation in categorical sequential pattern mining for trajectory databases
The classic Generalized Sequential Patterns (GSP) algorithm returns all frequent sequences present in a database. However, usually a few ones are interesting from a user's po...
Leticia I. Gómez, Alejandro A. Vaisman
134
Voted
DMSN
2010
ACM
14 years 10 months ago
DEMS: a data mining based technique to handle missing data in mobile sensor network applications
In Mobile Sensor Network (MSN) applications, sensors move to increase the area of coverage and/or to compensate for the failure of other sensors. In such applications, loss or cor...
Le Gruenwald, Md. Shiblee Sadik, Rahul Shukla, Han...
155
Voted
GIS
2006
ACM
15 years 10 months ago
ST-ACTS: a spatio-temporal activity simulator
Creating complex spatio?temporal simulation models is a hot issue in the area of spatio?temporal databases [7]. While existing Moving Object Simulators (MOSs) address different ph...
Gyözö Gidófalvi, Torben Bach Pede...
107
Voted
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
15 years 10 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
ICALP
2009
Springer
15 years 9 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner