Efficient support ticket resolution using Knowledge Graphs
Sherwin Varghese, James Tian

TL;DR
This paper presents a novel approach using Knowledge Graph embeddings to improve machine learning-based support engineer recommendations, significantly reducing resolution times for complex customer issues.
Contribution
It introduces a new method of modeling Knowledge Graph embeddings from diverse data sources to enhance learning-to-rank models for support ticket resolution.
Findings
Knowledge Graph embeddings improve ranking accuracy
Incorporating contextual data enhances recommendation quality
Significant performance gains over traditional methods like TF-IDF
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCognitive Computing and Networks
MethodsSparse Evolutionary Training · Balanced Selection
