Abstract
In today's competitive business world, customer service is often at the heart of businesses that can help strengthen their brands. Customer complaint resolution in a timely and efficient manner is key to improving customer satisfaction. Moreover, customers’ complaints play important roles in identifying their requirements which offer a starting point for effective and efficient planning of the company's overall R&D and new product or service development activities. That said, businesses face challenges towards automatically identifying complaints buried deep in massive online content. In this paper, we propose a graph-based semi-supervised learning paradigm leveraging syntactic and semantic representations of tweets. Intrinsic evaluation results on a benchmark dataset illustrate that the proposed approach outperforms state-of-the-art supervised non-graph based classification models for solving the complaints identification task, and confirms the efficacy of the proposed approach. Experimental results also show that the performance of the state-of-the-art supervised complaint classification model trained over hand-crafted features extracted from several linguistic resources can be reached with less than 50% of the training data with the proposed approach.
Original language | English |
---|---|
Article number | 115668 |
Journal | Expert Systems with Applications |
Volume | 186 |
Early online date | 13 Sept 2021 |
DOIs | |
Publication status | Published - 30 Dec 2021 |
Externally published | Yes |
Bibliographical note
Funding Information:This publication is an outcome of the R&D work undertaken in the project under the Visvesvaraya Ph.D. Scheme of Ministry of Electronics & Information Technology, Government of India, being implemented by Digital India Corporation (Formerly Media Lab Asia).
Publisher Copyright:
© 2021 Elsevier Ltd
Keywords
- Complaint mining
- Max-flow mincut theorem
- Semi-supervised learning
ASJC Scopus subject areas
- General Engineering
- Computer Science Applications
- Artificial Intelligence