Proceedings of the 17th ACM Conference on Information and Knowledge Management 2008
DOI: 10.1145/1458082.1458240
|View full text |Cite
|
Sign up to set email alerts
|

Identification of class specific discourse patterns

Abstract: In this paper we address the problem of extracting important (and unimportant) discourse patterns from call center conversations. Call centers provide dialog based calling-in support for customers to address their queries, requests and complaints. A Call center is the direct interface between an organization and its customers and it is important to capture the voice-of-customer by gathering insights into the customer experience. We have observed that the calls received at a call center contain segments within … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
6
0

Year Published

2009
2009
2017
2017

Publication Types

Select...
2
2
1

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 13 publications
0
6
0
Order By: Relevance
“…By this we mean: constraints that can be imposed on features and structures without serious loss of expressive power; transformations of the featurediscovery problem to other tasks for which efficient algorithms are known; optimisation formulations that can be solved efficiently, learning and inferencing with structured output spaces and so on. We have pursued the following strategies: (a) pose the problem as a discrete optimisation problem and solve it heuristically [28,15,48,39,49], (b) pose the problem as a continuous (often convex) opti-misation problem with sparsity inducing regularizers and solves it optimally [27,36] and (c) study restrictions on the space of relational features and investigate empirically whether it is acceptable for a relational learner to examine a more restricted space of features than that actually necessary for the full statistical model [41,35,33] We have also looked at heuristics for speeding up inference algorithms in relational settings [34].…”
Section: Statistical Relational Learningmentioning
confidence: 99%
See 1 more Smart Citation
“…By this we mean: constraints that can be imposed on features and structures without serious loss of expressive power; transformations of the featurediscovery problem to other tasks for which efficient algorithms are known; optimisation formulations that can be solved efficiently, learning and inferencing with structured output spaces and so on. We have pursued the following strategies: (a) pose the problem as a discrete optimisation problem and solve it heuristically [28,15,48,39,49], (b) pose the problem as a continuous (often convex) opti-misation problem with sparsity inducing regularizers and solves it optimally [27,36] and (c) study restrictions on the space of relational features and investigate empirically whether it is acceptable for a relational learner to examine a more restricted space of features than that actually necessary for the full statistical model [41,35,33] We have also looked at heuristics for speeding up inference algorithms in relational settings [34].…”
Section: Statistical Relational Learningmentioning
confidence: 99%
“…The purpose here is to investigate the applicability of feature-based techniques to data analysis tasks of constructing discriminatory and generative models for problems such as information extraction and disambiguation [33,15,48,39,49,50].…”
Section: Statistical Relational Learningmentioning
confidence: 99%
“…These features are extracted from all utterances present in the transcripts by using the algorithm given in [11]. Agent and customer utterances are clustered separately.…”
Section: B Utterance Clusteringmentioning
confidence: 99%
“…have you rented a car from <a_rental_agency> before. We implemented an efficient algorithm described in [11] (an extension of the apriori algorithm [12]) for finding frequent patterns of non-consecutive tokens. The minSup value in apriori corresponds to the minimum number of times a non-consecutive n-gram should occur across all the sentences.…”
Section: B Utterance Clusteringmentioning
confidence: 99%
See 1 more Smart Citation