0


群集事件日志使用迭代分区

Clustering Event Logs Using Iterative Partitioning
课程网址: http://videolectures.net/kdd09_makanju_celuip/  
主讲教师: Adetokunbo A.O. Makanju
开课单位:
开课时间: 2009-09-14
课程语种: 英语
中文简介:
事件日志作为系统和网络管理中的信息来源, 其重要性怎么强调也不为过。随着当今事件日志的规模和复杂性不断增加, 手动执行事件日志的任务变得很繁琐。为此, 最近的研究重点是对这些日志文件的自动分析。本文提出了一种新的从事件日志中挖掘集群的算法--iplom (迭代分区日志挖掘)。通过三步分层分区进程, iplom 将数据分区到各自的集群中。在第4个也是最后一个阶段, iplom 为生成的每个群集生成群集说明或行格式。与其他类似算法不同, iplom 不是基于 apriri 算法的, 它能够在数据中查找群集, 无论其实例是否频繁出现。评价表明, ipkm 在统计上优于其他算法, 并且当最接近的其他算法实现10% 的 f-测量性能时, 它也能够实现平均的 f-测量性能78%。
课程简介: The importance of event logs, as a source of information in systems and network management cannot be overemphasized. With the ever increasing size and complexity of today's event logs, the task of analyzing event logs has become cumbersome to carry out manually. For this reason recent research has focused on the automatic analysis of these log files. In this paper we present IPLoM (Iterative Partitioning Log Mining), a novel algorithm for the mining of clusters from event logs. Through a 3-Step hierarchical partitioning process IPLoM partitions log data into its respective clusters. In its 4th and final stage IPLoM produces cluster descriptions or line formats for each of the clusters produced. Unlike other similar algorithms IPLoM is not based on the Apriori algorithm and it is able to find clusters in data whether or not its instances appear frequently. Evaluations show that IPLoM outperforms the other algorithms statistically significantly, and it is also able to achieve an average F-Measure performance 78% when the closest other algorithm achieves an F-Measure performance of 10%.
关 键 词: 计算机科学»数据挖掘»企业与金融
课程来源: 视频讲座网
最后编审: 2020-06-24:yumf
阅读次数: 90