Universal Model in Online Customer Service (2402.15666v1)
Abstract: Building machine learning models can be a time-consuming process that often takes several months to implement in typical business scenarios. To ensure consistent model performance and account for variations in data distribution, regular retraining is necessary. This paper introduces a solution for improving online customer service in e-commerce by presenting a universal model for predict-ing labels based on customer questions, without requiring training. Our novel approach involves using machine learning techniques to tag customer questions in transcripts and create a repository of questions and corresponding labels. When a customer requests assistance, an information retrieval model searches the repository for similar questions, and statistical analysis is used to predict the corresponding label. By eliminating the need for individual model training and maintenance, our approach reduces both the model development cycle and costs. The repository only requires periodic updating to maintain accuracy.
- Altman, N. S. (1992). An introduction to kernel and nearest-neighbor nonparametric regression. The American Statistician, 46(3):175–185.
- Research-paper recommender systems: a literature survey. International Journal on Digital Libraries, 17:305–338.
- Bert: Pre-training of deep bidirectional transformers for language understanding. Advances in neural information processing systems, 30.
- Discriminatory analysis. nonparametric discrimination: Consistency properties. USAF School of Aviation Medicine, Randolph Field, Texas.
- Ho, T. K. (1995). Random decision forests. Proceedings of 3rd international conference on document analysis and recognition, 1:278–282.
- Ho, T. K. (1998). The random subspace method for constructing decision forests. IEEE transactions on pattern analysis and machine intelligence, 20(8):832–844.
- Lstm can solve hard long time lag problems. Advances in neural information processing systems, 30:473–479.
- Matching questions and answers in dialogues from online forums. arXiv, page 2101.03064.
- A probabilistic model of information retrieval: development and comparative experiments: Part 1. Information Processing and Management, 36(6):779–808.
- A probabilistic model of information retrieval: development and comparative experiments: Part 2. Information Processing and Management, 36(6):809–840.
- Harvesting and refining question-answer pairs for unsupervised qa. Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, pages 6719–6728.
- A multi-mode modulator for multi-domain few-shot classification. IEEE/CVF International Conference on Computer Vision (ICCV), pages 8453–8462.
- Massive data mining. Cambridge University Press.
- Know what you don’t know: Unanswerable questions for squad. arXiv, page 1806.03822.
- Squad: 100,000+ questions for machine comprehension of text. arXiv, page 1606.05250.
- Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter. arXiv, (1910):01108.
- Attention is all you need. Advances in neural information processing systems, 30.
- Retrieval, re-ranking and multi-task learning for knowledge-base question answering. Conference of the European Chapter of the Association for Computational Linguistics, pages 347–357.
- End-to-end answer chunk extraction and ranking for reading comprehension. arXiv, page 1610.09996.