Unsupervised Dialogue Act Classification with Optimum-Path Forest
| dc.contributor.author | Ribeiro, Luiz Carlos Felix [UNESP] | |
| dc.contributor.author | Papa, João Paulo [UNESP] | |
| dc.contributor.institution | Universidade Estadual Paulista (Unesp) | |
| dc.date.accessioned | 2019-10-06T17:03:44Z | |
| dc.date.available | 2019-10-06T17:03:44Z | |
| dc.date.issued | 2019-01-15 | |
| dc.description.abstract | Dialogue Act classification is a relevant problem for the Natural Language Processing field either as a standalone task or when used as input for downstream applications. Despite its importance, most of the existing approaches rely on supervised techniques, which depend on annotated samples, making it difficult to take advantage of the increasing amount of data available in different domains. In this paper, we briefly review the most commonly used datasets to evaluate Dialogue Act classification approaches and introduce the Optimum-Path Forest (OPF) classifier to this task. Instead of using its original strategy to determine the corresponding class for each cluster, we use a modified version based on majority voting, named M-OPF, which yields good results when compared to k-means and Hierarchical Density-Based Spatial Clustering of Applications with Noise (HDBSCAN), according to accuracy and V-measure. We also show that M-OPF, and consequently OPF, are less sensitive to hyper-parameter tuning when compared to HDBSCAN. | en |
| dc.description.affiliation | Department of Computing São Paulo State University - UNESP | |
| dc.description.affiliationUnesp | Department of Computing São Paulo State University - UNESP | |
| dc.description.sponsorship | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
| dc.description.sponsorship | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
| dc.description.sponsorshipId | FAPESP: #2013/07375-0 | |
| dc.description.sponsorshipId | FAPESP: #2014/12236-1 | |
| dc.description.sponsorshipId | FAPESP: #2014/16250-9 | |
| dc.description.sponsorshipId | FAPESP: #2016/19403-6 | |
| dc.description.sponsorshipId | CNPq: #307066/2017-7 | |
| dc.format.extent | 25-32 | |
| dc.identifier | http://dx.doi.org/10.1109/SIBGRAPI.2018.00010 | |
| dc.identifier.citation | Proceedings - 31st Conference on Graphics, Patterns and Images, SIBGRAPI 2018, p. 25-32. | |
| dc.identifier.doi | 10.1109/SIBGRAPI.2018.00010 | |
| dc.identifier.scopus | 2-s2.0-85062206998 | |
| dc.identifier.uri | http://hdl.handle.net/11449/190145 | |
| dc.language.iso | eng | |
| dc.relation.ispartof | Proceedings - 31st Conference on Graphics, Patterns and Images, SIBGRAPI 2018 | |
| dc.rights.accessRights | Acesso aberto | |
| dc.source | Scopus | |
| dc.subject | Clustering | |
| dc.subject | Dialog Act | |
| dc.subject | Optimum Path Forest | |
| dc.title | Unsupervised Dialogue Act Classification with Optimum-Path Forest | en |
| dc.type | Trabalho apresentado em evento | |
| unesp.campus | Universidade Estadual Paulista (Unesp), Faculdade de Ciências, Bauru | pt |
| unesp.department | Computação - FC | pt |