计算机科学
数据挖掘
相似性(几何)
公制(单位)
假阳性悖论
事件(粒子物理)
相关性(法律)
门票
服务(商务)
假阳性和假阴性
情报检索
机器学习
人工智能
计算机安全
物理
经济
量子力学
经济
运营管理
政治学
法学
图像(数学)
作者
Wubai Zhou,Liang Tang,Chunqiu Zeng,Tao Li,Larisa Shwartz,Genady Ya. Grabarnik
标识
DOI:10.1109/tnsm.2016.2587807
摘要
In recent years, IT service providers have rapidly achieved an automated service delivery model. Software monitoring systems are designed to actively collect and signal event occurrences and, when necessary, automatically generate incident tickets. Repeating events generate similar tickets, which in turn have a vast number of repeated problem resolutions likely to be found in earlier tickets. In this paper, we develop techniques to recommend appropriate resolution for incoming events by making use of similarities between the events and historical resolutions of similar events. Built on the traditional k-nearest neighbor algorithm (KNN), our proposed algorithms take into account false positives often generated by monitoring systems. An additional penalty is incorporated into the algorithms to control the number of misleading resolutions in the recommendation results. Moreover, as the effectiveness of the KNN heavily relies on the underlying similarity measurement, we proposed two other approaches to significantly improve our recommendation with respect to resolution relevance. One approach uses topic-level features to incorporate resolution information into the similarity measurement; the other uses metric learning to learn a more effective similarity measure. Extensive empirical evaluations on three ticket data sets demonstrate the effectiveness and efficiency of our proposed methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI