arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1911.04768cs.SE
收藏

使用连续对比集挖掘的崩溃分析

Debugging Crashes using Continuous Contrast Set Mining

Rebecca Qian, Yang Yu, Wonhee Park, Vijayaraghavan Murali, Stephen Fink, Satish Chandra

摘要:

Facebook运营着一系列服务,每天有超过20亿人在各种移动设备上使用。许多设备被配置为在应用程序因任何原因崩溃时上传崩溃报告。工程师们每天都会监控和分类数百万份崩溃报告,以检查错误、回归和任何其他质量问题。崩溃组的检查是一个手动密集型过程,需要深入的领域专业知识以及对跟踪和代码的密切检查,通常在时间限制下。我们使用对比集挖掘,一种形式的歧视性模式挖掘,学习区分一组崩溃从另一个。以前的工作集中在离散化应用对比挖掘连续数据。我们提出了第一个直接应用对比学习连续数据,而不需要离散化。我们还定义了一个加权异常分数,它统一了连续和分类对比集,同时减轻了偏差,以及向开发人员传达信心的不确定性措施。我们通过将其应用于Facebook生产日志中具有挑战性的数据集来展示我们新颖的统计改进的价值,在该数据集中,我们使用离散化实现了比基线方法快40倍的速度。

英文摘要:

Facebook operates a family of services used by over two billion people daily on a huge variety of mobile devices. Many devices are configured to upload crash reports should the app crash for any reason. Engineers monitor and triage millions of crash reports logged each day to check for bugs, regressions, and any other quality problems. Debugging groups of crashes is a manually intensive process that requires deep domain expertise and close inspection of traces and code, often under time constraints. We use contrast set mining, a form of discriminative pattern mining, to learn what distinguishes one group of crashes from another. Prior works focus on discretization to apply contrast mining to continuous data. We propose the first direct application of contrast learning to continuous data, without the need for discretization. We also define a weighted anomaly score that unifies continuous and categorical contrast sets while mitigating bias, as well as uncertainty measures that communicate confidence to developers. We demonstrate the value of our novel statistical improvements by applying it on a challenging dataset from Facebook production logs, where we achieve 40x speedup over baseline approaches using discretization.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑