用知识图谱匹配最合适的工程师团队,提升复杂工单解决效率。
Efficient support ticket resolution using Knowledge Graphs
- 构建多源数据融合的知识图谱,整合工单、工程师技能与历史协作信息。
- 在16万+工单上验证,相比传统方法推荐准确率显著提升。
- 适合需要跨团队协作的复杂技术支持场景,可降低客户等待时间。
对超过16万份客户工单的分析表明,约90%的处理时间用于解决仅占10%的复杂问题,这些难题常需多名工程师协同(称为“蜂群”)甚至开发团队介入。本文提出一种基于学习排序(LTR)的方法,根据工单描述、受影响组件、工程师技能评分、知识库文本及历史蜂群数据,为每个工单生成最优工程师/团队推荐列表。核心假设是整合工程师过往解决案例的完整上下文能显著提升推荐效果。研究提出一种从多源数据(含蜂群信息)构建知识图谱嵌入的新方法。实验结果证明,引入该上下文后,推荐性能显著优于传统TF-IDF等方法。
原文摘要 · Abstract (English)
A review of over 160,000 customer cases indicates that about 90% of time is spent by the product support for solving around 10% of subset of tickets where a trivial solution may not exist. Many of these challenging cases require the support of several engineers working together within a "swarm", and some also need to go to development support as bugs. These challenging customer issues represent a major opportunity for machine learning and knowledge graph that identifies the ideal engineer / group of engineers(swarm) that can best address the solution, reducing the wait times for the customer. The concrete ML task we consider here is a learning-to-rank(LTR) task that given an incident and a set of engineers currently assigned to the incident (which might be the empty set in the non-swarming context), produce a ranked list of engineers best fit to help resolve that incident. To calculate the rankings, we may consider a wide variety of input features including the incident description provided by the customer, the affected component(s), engineer ratings of their expertise, knowledge base article text written by engineers, response to customer text written by engineers, and historic swarming data. The central hypothesis test is that by including a holistic set of contextual data around which cases an engineer has solved, we can significantly improve the LTR algorithm over benchmark models. The article proposes a novel approach of modelling Knowledge Graph embeddings from multiple data sources, including the swarm information. The results obtained proves that by incorporating this additional context, we can improve the recommendations significantly over traditional machine learning methods like TF-IDF.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。