Name
Abstract | ||
|---|---|---|
Memory networks model information and knowledge as memories that can be manipulated for prediction and reasoning about questions of interest. In many cases, there exists complicated relational structure in the data, by which the memories can be linked together into graphs to propagate information. Typical examples include tree structure of a sentence and knowledge graph in a dialogue system. In this paper, we present a novel graph enhanced memory network GEMN to integrate relational information between memories for prediction and reasoning. Our approach introduces graph attentions to model the relations, and couples them with content-based attentions via an additional neural network layer. It thus can better identify and manipulate the memories related to a given question, and provides more accurate prediction about the final response. We demonstrate the effectiveness of the proposed approach with aspect based sentiment classification. The empirical analysis on real data shows the advantages of incorporating relational dependencies into the memory networks. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-71249-9_23 | Lecture Notes in Artificial Intelligence |
Field | DocType | Volume |
Graph,Knowledge graph,Existential quantification,Sentiment analysis,Computer science,Relational structure,Theoretical computer science,Tree structure,Artificial neural network,Sentence | Conference | 10534 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.41 |
References | Authors | |
30 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhao Xu | 1 | 51 | 4.47 |
| Romain Vial | 2 | 1 | 0.41 |
| Kristian Kersting | 3 | 1932 | 154.03 |