Discourse & Dialogue
Probabilistic Non-Negative Matrix Factorization and Its Robust Extensions for Topic Modeling
Luo, Minnan (Xi'an Jiaotong University) | Nie, Feiping (Northwestern Polytechnical University) | Chang, Xiaojun (University of Technology Sydney) | Yang, Yi (University of Technology Sydney) | Hauptmann, Alexander (Carnegie Mellon University) | Zheng, Qinghua (Xi'an Jiaotong University)
Traditional topic model with maximum likelihood estimate inevitably suffers from the conditional independence of words given the documentโs topic distribution. In this paper, we follow the generative procedure of topic model and learn the topic-word distribution and topics distribution via directly approximating the word-document co-occurrence matrix with matrix decomposition technique. These methods include: (1) Approximating the normalized document-word conditional distribution with the documents probability matrix and words probability matrix based on probabilistic non-negative matrix factorization (NMF); (2) Since the standard NMF is well known to be non-robust to noises and outliers, we extended the probabilistic NMF of the topic model to its robust versions using l21-norm and capped l21-norm based loss functions, respectively. The proposed framework inherits the explicit probabilistic meaning of factors in topic models and simultaneously makes the conditional independence assumption on words unnecessary. Straightforward and efficient algorithms are exploited to solve the corresponding non-smooth and non-convex problems. Experimental results over several benchmark datasets illustrate the effectiveness and superiority of the proposed methods.
Integrating Verbal and Nonvebval Input into a Dynamic Response Spoken Dialogue System
Hu, Ting-Yao (Carnegie Mellon University) | Raman, Chirag (Carnegie Mellon University) | Maza, Salvador Medina (Carnegie Mellon University) | Gui, Liangke (Carnegie Mellon University) | Baltrusaitis, Tadas ( Carnegie Mellon University ) | Frederking, Robert (Carnegie Mellon University) | Morency, Louis-Philippe (Carnegie Mellon University) | Black, Alan W. (Carnegie Mellon University) | Eskenazi, Maxine (Carnegie Mellon University)
In this work, we present a dynamic response spoken dialogue system (DRSDS). It is capable of understanding the verbal and nonverbal language of users and making instant, situation-aware response. Incorporating with two external systems, MultiSense and email summarization, we built an email reading agent on mobile device to show the functionality of DRSDS.
Cross-Domain Sentiment Classification via Topic-Related TrAdaBoost
Huang, Xingchang (Sun Yat-sen University) | Rao, Yanghui (Sun Yat-sen University) | Xie, Haoran (The Education University of Hong Kong) | Wong, Tak-Lam (The Education University of Hong Kong) | Wang, Fu Lee (Caritas Institute of Higher Education)
Cross-domain sentiment classification aims to tag sentiments for a target domain by labeled data from a source domain. Due to the difference between domains, the accuracy of a trained classifier may be very low. In this paper, we propose a boosting-based learning framework named TR-TrAdaBoost for cross-domain sentiment classification. We firstly explore the topic distribution of documents, and then combine it with the unigram TrAdaBoost. The topic distribution captures the domain information of documents, which is valuable for cross-domain sentiment classification. Experimental results indicate that TR-TrAdaBoost represents documents well and boost the performance and robustness of TrAdaBoost.
Building Task-Oriented Dialogue Systems for Online Shopping
Yan, Zhao (Beihang University) | Duan, Nan (Microsoft Research) | Chen, Peng (Microsoft) | Zhou, Ming (Microsoft Research) | Zhou, Jianshe (Capital Normal University) | Li, Zhoujun (Beihang University)
We present a general solution towards building task-oriented dialogue systems for online shopping, aiming to assist online customers in completing various purchase-related tasks, such as searching products and answering questions, in a natural language conversation manner. As a pioneering work, we show what & how existing NLP techniques, data resources, and crowdsourcing can be leveraged to build such task-oriented dialogue systems for E-commerce usage. To demonstrate its effectiveness, we integrate our system into a mobile online shopping app. To the best of our knowledge, this is the first time that an AI bot in Chinese is practically used in online shopping scenario with millions of real consumers. Interesting and insightful observations are shown in the experimental part, based on the analysis of human-bot conversation log. Several current challenges are also pointed out as our future directions.
Structural Correspondence Learning for Cross-Lingual Sentiment Classification with One-to-Many Mappings
Li, Nana (Hebei University of Technology) | Zhai, Shuangfei (Binghamton University) | Zhang, Zhongfei (Binghamton University) | Liu, Boying (Hebei University of Technology)
Structural correspondence learning (SCL) is an effective method for cross-lingual sentiment classification. This approach uses unlabeled documents along with a word translation oracle to automatically induce task specific, cross-lingual correspondences. It transfers knowledge through identifying important features, i.e., pivot features. For simplicity, however, it assumes that the word translation oracle maps each pivot feature in source language to exactly only one word in target language. This one-to-one mapping between words in different languages is too strict. Also the context is not considered at all. In this paper, we propose a cross-lingual SCL based on distributed representation of words; it can learn meaningful one-to-many mappings for pivot words using large amounts of monolingual data and a small dictionary. We conduct experiments on NLP&CC 2013 cross-lingual sentiment analysis dataset, employing English as source language, and Chinese as target language. Our method does not rely on the parallel corpora and the experimental results show that our approach is more competitive than the state-of-the-art methods in cross-lingual sentiment classification.
Learning Latent Sentiment Scopes for Entity-Level Sentiment Analysis
Li, Hao (Singapore University of Technology and Design) | Lu, Wei (Singapore University of Technology and Design)
In this paper, we focus on the task of extracting named entities together with their associated sentiment information in a joint manner. Our key observation in such an entity-level sentiment analysis (a.k.a. targeted sentiment analysis) task is that there exists a sentiment scope within which each named entity is embedded, which largely decides the sentiment information associated with the entity. However, such sentiment scopes are typically not explicitly annotated in the data, and their lengths can be unbounded. Motivated by this, unlike traditional approaches that cast this problem as a simple sequence labeling task, we propose a novel approach that can explicitly model the latent sentiment scopes. Our experiments on the standard datasets demonstrate that our approach is able to achieve better results compared to existing approaches based on conventional conditional random fields (CRFs) and a more recent work based on neural networks.
Unsupervised Sentiment Analysis with Signed Social Networks
Cheng, Kewei (Arizona State University) | Li, Jundong (Arizona State University) | Tang, Jiliang (Michigan State University) | Liu, Huan (Arizona State University)
Huge volumes of opinion-rich data is user-generated in social media at an unprecedented rate, easing the analysis of individual and public sentiments. Sentiment analysis has shown to be useful in probing and understanding emotions, expressions and attitudes in the text. However, the distinct characteristics of social media data present challenges to traditional sentiment analysis. First, social media data is often noisy, incomplete and fast-evolved which necessitates the design of a sophisticated learning model. Second, sentiment labels are hard to collect which further exacerbates the problem by not being able to discriminate sentiment polarities. Meanwhile, opportunities are also unequivocally presented. Social media contains rich sources of sentiment signals in textual terms and user interactions, which could be helpful in sentiment analysis. While there are some attempts to leverage implicit sentiment signals in positive user interactions, little attention is paid on signed social networks with both positive and negative links. The availability of signed social networks motivates us to investigate if negative links also contain useful sentiment signals. In this paper, we study a novel problem of unsupervised sentiment analysis with signed social networks. In particular, we incorporate explicit sentiment signals in textual terms and implicit sentiment signals from signed social networks into a coherent model SignedSenti for unsupervised sentiment analysis. Empirical experiments on two real-world datasets corroborate its effectiveness.
A Hierarchical Latent Variable Encoder-Decoder Model for Generating Dialogues
Serban, Iulian Vlad (University of Montreal) | Sordoni, Alessandro (Maluuba Inc) | Lowe, Ryan (McGill University) | Charlin, Laurent (HEC Montrรฉal) | Pineau, Joelle (McGill University ) | Courville, Aaron (University of Montreal) | Bengio, Yoshua (University of Montreal)
Sequential data often possesses hierarchical structures with complex dependencies between sub-sequences, such as found between the utterances in a dialogue. To model these dependencies in a generative framework, we propose a neural network-based generative architecture, with stochastic latent variables that span a variable number of time steps. We apply the proposed model to the task of dialogue response generation and compare it with other recent neural-network architectures. We evaluate the model performance through a human evaluation study. The experiments demonstrate that our model improves upon recently proposed models and that the latent variables facilitate both the generation of meaningful, long and diverse responses and maintaining dialogue state.
Coherent Dialogue with Attention-Based Language Models
Mei, Hongyuan (Johns Hopkins University) | Bansal, Mohit (The University of North Carolina at Chapel Hill) | Walter, Matthew R. (Toyota Technological Institute at Chicago)
We model coherent conversation continuation via RNN-based dialogue models equipped with a dynamic attention mechanism. Our attention-RNN language model dynamically increases the scope of attention on the history as the conversation continues, as opposed to standard attention (or alignment) models with a fixed input scope in a sequence-to-sequence model. This allows each generated word to be associated with the most relevant words in its corresponding conversation history. We evaluate the model on two popular dialogue datasets, the open-domain MovieTriples dataset and the closed-domain Ubuntu Troubleshoot dataset, and achieve significant improvements over the state-of-the-art and baselines on several metrics, including complementary diversity-based metrics, human evaluation, and qualitative visualizations. We also show that a vanilla RNN with dynamic attention outperforms more complex memory models (e.g., LSTM and GRU) by allowing for flexible, long-distance memory. We promote further coherence via topic modeling-based reranking.
Recurrent Attentional Topic Model
Li, Shuangyin (Hong Kong University of Science and Technology) | Zhang, Yu (Hong Kong University of Science and Technology) | Pan, Rong (Sun Yat-sen University) | Mao, Mingzhi (Sun Yat-sen University) | Yang, Yang (iPIN, Shen Zhen)
In a document, the topic distribution of a sentence depends on both the topics of preceding sentences and its own content, and it is usually affected by the topics of the preceding sentences with different weights. It is natural that a document can be treated as a sequence of sentences. Most existing works for Bayesian document modeling do not take these points into consideration. To fill this gap, we propose a Recurrent Attentional Topic Model (RATM) for document embedding. The RATM not only takes advantage of the sequential orders among sentence but also use the attention mechanism to model the relations among successive sentences. In RATM, we propose a Recurrent Attentional Bayesian Process (RABP) to handle the sequences. Based on the RABP, RATM fully utilizes the sequential information of the sentences in a document. Experiments on two copora show that our model outperforms state-of-the-art methods on document modeling and classification.