Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

INTELLCOMM
2004
Springer

favoriteEmaildiscussreport

117views Communications» more INTELLCOMM 2004»

A Breadth-First Algorithm for Mining Frequent Patterns from Event Logs

14 years 4 months ago

A Breadth-First Algorithm for Mining Frequent Patterns from Event Logs

Download ristov.users.sourceforge.net

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 network management task. This paper discusses the properties of event log data, analyses the suitability of popular mining algorithms for processing event log data, and proposes an eﬃcient algorithm for mining frequent patterns from event logs.

Risto Vaarandi

Real-time Traffic

Communications | Event Log Data | Event Logs | Event Logs Contain | INTELLCOMM 2004 |

claim paper

Related Content

» A parallel distributed algorithm for relational frequent pattern discovery from very large...

» Comprehensive Log Compression with Frequent Patterns

» Efficient Mining of Spatiotemporal Patterns

» Stream prediction using a generative model based on frequent episodes in event sequences

» Mining frequent item sets by opportunistic projection

» Clustering event logs using iterative partitioning

» FSMTree An Efficient Algorithm for Mining Frequent Temporal Patterns

» Relational Frequent Patterns Mining for Novelty Detection from Data Streams

» Significant Interval and Frequent Pattern Discovery in Web Log Data

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	INTELLCOMM
Authors	Risto Vaarandi

Comments (0)