Sciweavers

41 search results - page 1 / 9
» A Breadth-First Algorithm for Mining Frequent Patterns from ...
Sort
View
INTELLCOMM
2004
Springer
13 years 10 months ago
A Breadth-First Algorithm for Mining Frequent Patterns from Event Logs
Abstract. Today, event logs contain vast amounts of data that can easily overwhelm a human. Therefore, the mining of frequent patterns from event logs is an important system and ne...
Risto Vaarandi
IDA
2011
Springer
12 years 11 months ago
A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
Annalisa Appice, Michelangelo Ceci, Antonio Turi, ...
DAWAK
2003
Springer
13 years 9 months ago
Comprehensive Log Compression with Frequent Patterns
In this paper we present a comprehensive log compression (CLC) method that uses frequent patterns and their condensed representations to identify repetitive information from large ...
Kimmo Hätönen, Jean-François Boul...
SSD
2001
Springer
218views Database» more  SSD 2001»
13 years 9 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
KDD
2008
ACM
217views Data Mining» more  KDD 2008»
14 years 5 months ago
Stream prediction using a generative model based on frequent episodes in event sequences
This paper presents a new algorithm for sequence prediction over long categorical event streams. The input to the algorithm is a set of target event types whose occurrences we wis...
Srivatsan Laxman, Vikram Tankasali, Ryen W. White