Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3590003.3590011acmotherconferencesArticle/Chapter ViewAbstractPublication PagescacmlConference Proceedingsconference-collections
research-article

Customer Service Hot event Discovery Based on Dynamic Dialogue Embedding

Published: 29 May 2023 Publication History

Abstract

Frequent customer service conversations focus on hot topics of communication users, and automatic hot topic discovery is critical to improving user experience. Traditionally, Customer service relies on operator to write traffic summaries. It leads to the source of the conversation difficult to analyze, which makes difficult to spot aggregated hotspot events. In this paper, we propose a Customer Service hot event Discovery based on dynamic dialogue embedding (CShe-D). This model includes dynamic semantic representation of customer service dialogue, clustering-based customer service hot event discovery and new hot event prediction. In the dialogue semantic embedding module, we obtain the dynamic embedding of each dialogue with combining word importance and word length based on the pre-trained language model to capture richer semantic information in different contexts. We further apply a clustering iterative algorithm with dynamic dialogue embedding to discover customer service hotspots. It can monitor the change trend of events in real time, optimize the accuracy of hot event discovery in operator customer service. Finally, the effectiveness of our CShe-D model is verified by experiments on real dialogue data in the field of customer service.

References

[1]
Abdi.H and Williams. 2010. Principal component analysis. Wiley Interdisciplinary Reviews: Computational Statistics 2 (2010), 433—-459.
[2]
Akter.S, Asa.A.S, and Uddin.M.P. 2017. An extractive text summarization technique for Bengali document (s) using K-means clustering algorithm. IcIVPR IEEE (2017), 1–6.
[3]
ALLAN.J. 2012. Introduction to topic detection and tracking. Topic detection and tracking Springer, Boston (2012), 1–16.
[4]
Devlin.J, Chang.M.W, and Lee.K. 2019. Pre-training of Deep Bidirectional Transformers for Language Understanding. Human Language Technologies 1 (2019), 4171–4186.
[5]
XU Feifei and CHEN Saihong. 2021. Summary of Research on Chinese Text Topic Clustering Algorithms. Shanghai University of Electric Power 37, 06 (2021), 613–619.
[6]
ZHANG Guofeng. 2019. Research and Implementation of Topic Hot Sorting in Article Clustering. Donghua University (2019).
[7]
Hadifar.A, Sterckx.L, and Demeester.T. 2019. A self-training approach for short text clustering. Proceedings of the 4th Workshop on Representation Learning for NLP RepL4NLP (2019), 194–199.
[8]
Haider.M.M, Hossin.M.A, and Mahi.H.R. 2020. Automatic text summarization using gensim word2vec and k-means clustering algorithm. TENSYMP IEEE (2020), 283–286.
[9]
SHAO Jie and ZHAO Qian. 2017. Hierarchical Adaptive Clustering Based Group Detection in the Crowd. Journal of Shanghai University of Electric Power 33, 1 (2017), 91–96.
[10]
CAI Jincheng and SUN Haojun. 2018. Relation Hierarchical Distance Clustering of Mixed Data Based on Mutual Information and Bayesian Networks. Journal of Shantou University 33, 02 (2018), 3–12+2.
[11]
JONES.K.S. 1972. A statistical interpretation of term specificity and its application in retrieval. Journal of documentation 28, 1 (1972), 11–21.
[12]
J.Pennington, R.Socher, and C.Manning. 2014. Global vectors for word representation. In Proceedings of the 2014 conference on empirical methods in natural language processing (2014), 1532–1543.
[13]
JIANG Jun, HUANG Hua, REN Tiaojuan, and ZHANG Denghui. 2019. Telecom complaint hot topic detection method based on density peaks clustering. Telecommunication Science 35, 05 (2019), 97–103.
[14]
Li.Q, Li.S, and Zhang.S. 2019. A review of text corpus-based tourism big data mining. Applied Sciences 9, 16 (2019), 3300.
[15]
L.Logeswaran and H.Lee. 2018. An efficient framework for learning sentence representations. ICLR (2018).
[16]
Macqueen.J. 1965. Some Methods for Classification and Analysis of Multi-Variate Observations. Proc of Berkeley Symposium on Mathematical Statistics Probability 344 (1965), 281–297.
[17]
Mikolov.T, Chen.K, and Corrado.G. 2013. Efficient estimation of word representations in vector space. International Conference on Learning Representations (2013).
[18]
Moradi.P, Ahmadian.S, and Akhlaghian.F. 2015. An effective trust-based recommendation method using a novel graph clustering algorithm. Statistical mechanics and its applications 436 (2015), 462–481.
[19]
Peters.M, Neumann.M, and Iyyer.M. 2018. Deep Contextualized Word Representations. Human Language Technologies 1 (2018), 2227–2237.
[20]
Radford. 2018. Improving Language Understanding by Generative Pre-Training. (2018).
[21]
Rodriguez.A and Laio.A. 2014. Clustering by Fast Search and Find of Density Peaks. Science 344 (2014), 1492–1496.
[22]
WeiBer.T, SaBmannshausen.T, and Ohrndorf.D. 2020. A cluster- ing approach for topic filtering within systematic literature reviews. MethodsX 7 (2020), 100831.
[23]
GUO Wenjuan. 2022. K-means Clustering Algorithm Based on Optimized Initial Custering Center. Technology Wind 04 (2022), 63–65.
[24]
DAI Xiang, HUANG Xifeng, TANG Rui, JIANG Mengting, CHEN Xingshu, WANG Haizhou, and LUO Liang. 2019. Sub Topic Detection Algorithm Based on Hierarchical Clustering. Journal of South China University of Technology 47, 08 (2019), 84–95.
[25]
ZHANG Yanbo and GUO Kai. 2021. Text Classification Model Based on Fasttext and Multi-Feature Fusion. Computer simulation 38, 07 (2021), 461–466.
[26]
Zhang.T, Ramakrishnan.R, and Livny.M. 1996. An Efficient Data Clustering Method for Very Large Databases. Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data (Jun 1996), 103–114.
[27]
Zhang.Z, Han.X, and Liu.Z. 2019. Enhanced Language Representation with Informative Entities. Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics (2019), 1441–1451.
[28]
Zhu.X, Li.Y, and Wang.J. 2020. Automatic Recommendation of a Distance Measure for Clustering Algorithms. ACM Transactions on Knowledge Discovery from Data 15, 1 (2020), 1–22.

Index Terms

  1. Customer Service Hot event Discovery Based on Dynamic Dialogue Embedding
        Index terms have been assigned to the content through auto-classification.

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Other conferences
        CACML '23: Proceedings of the 2023 2nd Asia Conference on Algorithms, Computing and Machine Learning
        March 2023
        598 pages
        ISBN:9781450399449
        DOI:10.1145/3590003
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 29 May 2023

        Permissions

        Request permissions for this article.

        Check for updates

        Author Tags

        1. Customer service
        2. Dialogue embedding
        3. Hot event discovery
        4. Semantic representation

        Qualifiers

        • Research-article
        • Research
        • Refereed limited

        Conference

        CACML 2023

        Acceptance Rates

        CACML '23 Paper Acceptance Rate 93 of 241 submissions, 39%;
        Overall Acceptance Rate 93 of 241 submissions, 39%

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • 0
          Total Citations
        • 37
          Total Downloads
        • Downloads (Last 12 months)23
        • Downloads (Last 6 weeks)1
        Reflects downloads up to 23 Dec 2024

        Other Metrics

        Citations

        View Options

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format.

        HTML Format

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media