One Graph is Worth a Thousand Logs: Uncovering Hidden Structures in Massive System Event Logs

author: Gilad Barash, Hewlet Packard
published: Oct. 20, 2009,   recorded: September 2009,   views: 5179
Categories

Slides

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Bibliography

Description

In this paper we describe our work on pattern discovery in system event logs. For discovering the patterns we developed two novel algorithms. The first is a sequential and efficient text clustering algorithm which automatically discovers the templates generating the messages. The second, the PARIS algorithm (Principle Atom Recognition In Sets), is a novel algorithm which discovers patterns of messages that represent processes occurring in the system. We demonstrate the usefulness of our analysis, on real world logs from various systems, for debugging of complex systems, efficient search and visualization of logs and characterization of system behavior.

See Also:

Download slides icon Download slides: ecmlpkdd09_barash_gwtluhsmsel_01.pdf (548.8 KB)

Download slides icon Download slides: ecmlpkdd09_barash_gwtluhsmsel_01.ppt (2.8 MB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: