Name
Abstract | ||
|---|---|---|
Tree structures are commonly used in the tasks of semantic analysis and understanding over the data of different modalities, such as natural language, 2D or 3D graphics and images, or Web pages. Previous studies model the structures in a bottom-up manner, where the leaf nodes (given in advance) are merged into internal nodes until they reach the root node. However, these models are not applicable when the leaf nodes are not explicitly specified ahead of prediction. Here, we introduce a neural machine for top-down generation of structures that aims to infer such structures without the specified leaf nodes. In this model, the history memories from ancestors are fed to a node to generate its (ordered) children in a recursive manner. This model can be utilized as a tree-structured decoder in the framework of to tree learning, where X stands for any structure (e.g. chain, etc.) that can be represented as a latent vector. By transforming the dialogue generation problem into a sequence-to-tree task, we demonstrate the proposed X2Tree framework achieves a 11.15% increase of response acceptance ratio over the baseline methods. |
Year | Venue | Field |
|---|---|---|
2017 | arXiv: Artificial Intelligence | Computer science,Vantage-point tree,Tree (data structure),K-ary tree,Binary tree,Theoretical computer science,Artificial intelligence,Tree structure,(a,b)-tree,Machine learning,Interval tree,Search tree |
DocType | Volume | Citations |
Journal | abs/1705.00321 | 2 |
PageRank | References | Authors |
0.36 | 19 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ganbin Zhou | 1 | 10 | 3.54 |
| Ping Luo | 2 | 839 | 53.92 |
| rongyu cao | 3 | 20 | 4.24 |
| Yijun Xiao | 4 | 23 | 3.54 |
| Fen Lin | 5 | 153 | 19.00 |
| Bo Chen | 6 | 146 | 28.26 |
| Qing He | 7 | 754 | 80.58 |