一张图抵得上千个日志:揭开海量系统事件日志中的隐藏结构One Graph is Worth a Thousand Logs: Uncovering Hidden Structures in Massive System Event Logs |
|
课程网址: | http://videolectures.net/ecmlpkdd09_barash_gwtluhsmsel/ |
主讲教师: | Gilad Barash |
开课单位: | 休利特·帕卡德 |
开课时间: | 2009-10-20 |
课程语种: | 英语 |
中文简介: | 在本文中,我们描述了在系统事件日志中进行模式发现的工作。为了发现这些模式,我们开发了两种新的算法。第一种是一种连续高效的文本聚类算法,它自动发现生成消息的模板。第二种是PARIS算法(Principle Atom Recognition In Sets),它是一种新的算法,可以发现表示系统中发生的进程的消息模式。我们证明了我们对来自不同系统的真实日志的分析对于复杂系统的调试、日志的有效搜索和可视化以及系统行为的表征的有用性。 |
课程简介: | 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. |
关 键 词: | 系统事件; 文本聚类算法; 消息模式 |
课程来源: | 视频讲座网 |
数据采集: | 2023-03-05:chenjy |
最后编审: | 2023-03-05:chenjy |
阅读次数: | 25 |