RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      Sequence clustering variable length customer service calls using HMM with global knowledge of call center dialogue acts

      한글로보기

      https://www.riss.kr/link?id=T16070879

      • 0

        상세조회
      • 0

        다운로드
      서지정보 열기
      • 내보내기
      • 내책장담기
      • 공유하기
      • 오류접수

      부가정보

      다국어 초록 (Multilingual Abstract)

      In this paper, we cluster customer service calls between the call center's agent and
      customer with an unsupervised clustering algorithm. Specifically, we focus on the fact that
      most customer calls follow certain common call flows because manual scripts are provided
      to the agents beforehand for specific circumstances.
      Taking this characteristic of customer calls into account, it seems natural to cluster the
      customer calls in a sequential manner to explore the calls with a similar flow. In order to
      cluster the dialogues sequentially, we split each call into utterances, and then express those - vi -
      utterances with topics by LDA topic modeling.
      In consequence, calls represented as the sequence of utterance topics have different
      lengths, which makes it reasonable to use HMM-Spectral Clustering, which is a method
      that is capable of clustering sequences with variable lengths. However, since not all topics
      are discussed in a single call, every call consists of a different set of topics provoking the
      sparsity issue when applied to traditional HMM-Spectral Clustering.
      This paper defines and arises the “sparsity issue” of HMM-Spectral Clustering, which
      is the problem of emission probability getting too sparse with discrete HMM fitting. We
      solve this limitation by giving global features of the entire dataset to HMM in the format
      of prior transition and emission probability knowledge. To send every discrete HMM to the
      same parameter space of transition, we fit entire dataset with one single HMM and defined
      this process as “Global HMM learning”.
      Putting global characteristics to model is possible because we introduce an underlying
      structure of customer call dialogues and use these acts as the hidden states of the HMM.
      We have verified that with the global knowledge gained from the fixed flow of dialogue
      acts, HMM-Spectral Clustering achieves the ability to cluster sequences with different sets
      of observable states without sparsity issue.
      번역하기

      In this paper, we cluster customer service calls between the call center's agent and customer with an unsupervised clustering algorithm. Specifically, we focus on the fact that most customer calls follow certain common call flows because manual scri...

      In this paper, we cluster customer service calls between the call center's agent and
      customer with an unsupervised clustering algorithm. Specifically, we focus on the fact that
      most customer calls follow certain common call flows because manual scripts are provided
      to the agents beforehand for specific circumstances.
      Taking this characteristic of customer calls into account, it seems natural to cluster the
      customer calls in a sequential manner to explore the calls with a similar flow. In order to
      cluster the dialogues sequentially, we split each call into utterances, and then express those - vi -
      utterances with topics by LDA topic modeling.
      In consequence, calls represented as the sequence of utterance topics have different
      lengths, which makes it reasonable to use HMM-Spectral Clustering, which is a method
      that is capable of clustering sequences with variable lengths. However, since not all topics
      are discussed in a single call, every call consists of a different set of topics provoking the
      sparsity issue when applied to traditional HMM-Spectral Clustering.
      This paper defines and arises the “sparsity issue” of HMM-Spectral Clustering, which
      is the problem of emission probability getting too sparse with discrete HMM fitting. We
      solve this limitation by giving global features of the entire dataset to HMM in the format
      of prior transition and emission probability knowledge. To send every discrete HMM to the
      same parameter space of transition, we fit entire dataset with one single HMM and defined
      this process as “Global HMM learning”.
      Putting global characteristics to model is possible because we introduce an underlying
      structure of customer call dialogues and use these acts as the hidden states of the HMM.
      We have verified that with the global knowledge gained from the fixed flow of dialogue
      acts, HMM-Spectral Clustering achieves the ability to cluster sequences with different sets
      of observable states without sparsity issue.

      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

      유사연구자 (20) 활용도상위20명

      이 자료와 함께 이용한 RISS 자료

      나만을 위한 추천자료

      해외이동버튼