不训练模型,用模式挖掘构建可追溯的故障响应记忆系统
Incident Memory: Training-Free Operational Memory through Sequential Pattern Mining and Velocity-Stratified Retrieval

- 通过分速度老化机制,按类型分别管理知识的新旧程度
- 从成功案例中挖掘出39条有序操作手册,覆盖84.3%的未见故障
- 适合需要高可靠性、可追溯性的运维团队使用
故障响应本质是记忆问题:团队积累了大量工单、日志和复盘文档,但下次应对时所需的知识常缺失顺序、时效性与来源信息。我们提出Incident Memory,一种无需训练的确定性系统,结合三部分:(i) 分速度检索,对结构、行为、上下文及临时事实采用不同衰减速率;(ii) 指纹条件下的PrefixSpan挖掘,从成功调查中提取有序操作流程;(iii) 带溯源的指标定义,通过可执行检查发现矛盾。在包含24,918起事件的UCI ITSM日志上,系统提取23,110条有序轨迹,挖掘出39条操作手册,覆盖6,934个保留事件的84.3%。在已知真值的基准测试中,有序手册精确率达99.2%,相比扁平基线36%的过时返回,实现架构级过时保障,冲突检测F1达0.876。19组指纹的Claude Haiku基线仅得0.661精度,而PrefixSpan达0.985。核心结论并非语言模型弱,而是当以指纹和前序动作为条件时,重复故障历史熵极低,精确记忆比开放式生成更优。
原文摘要 · Abstract (English)
Incident response is a memory problem: teams accumulate tickets, traces, postmortems, and wiki pages, but the knowledge needed for the next incident is rarely stored with its order, freshness, and provenance intact. We present Incident Memory, a deterministic system that accumulates operational knowledge without model training. It combines (i) velocity-stratified retrieval, which ages structural, behavioral, contextual, and ephemeral facts at different rates; (ii) fingerprint-conditioned PrefixSpan mining, which extracts ordered playbooks from successful investigations; and (iii) provenance-aware metric definitions, which detect conflicting definitions through executable checks. On the UCI ITSM event log, containing 141,712 events across 24,918 incidents, Incident Memory extracts 23,110 ordered traces, mines 39 playbooks, and covers 84.3% of 6,934 held-out incidents. On controlled benchmarks with known ground truth, it achieves 99.2% ordered playbook precision (controlled), an architectural staleness guarantee versus 36% stale returns for a flat baseline, and conflict-detection F1 of 0.876. A direct Claude Haiku baseline on 19 fingerprint groups reaches 0.661 ordered precision, compared with 0.985 for PrefixSpan. The central result is not that language models are weak at incident response; it is that repeated incident histories are low-entropy once conditioned on fingerprint and previous action. In that regime, exact memory is a stronger primitive than open-ended generation.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。