Graph-based Deep-Tree Recursive Neural Network (DTRNN) for Text Classification
A novel graph-to-tree conversion mechanism called the deep-tree generation (DTG) algorithm is first proposed to predict text data represented by graphs. The DTG method can generate a richer and more accurate representation for nodes (or vertices) in graphs. It adds flexibility in exploring the vertex neighborhood information to better reflect the second order proximity and homophily equivalence in a graph. Then, a Deep-Tree Recursive Neural Network (DTRNN) method is presented and used to classify vertices that contains text data in graphs. To demonstrate the effectiveness of the DTRNN method, we apply it to three real-world graph datasets and show that the DTRNN method outperforms several state-of-the-art benchmarking methods.
Code (0)
등록된 구현이 없습니다.
Tasks
BenchmarkingGeneral Classificationtext-classificationText ClassificationSimilar Papers 제목 키워드 기반
Neural Tree Indexers for Text Understanding
Recurrent neural networks (RNNs) process input text sequentially and model the conditional transition between word tokens. In contrast, the advantages of recursive networks include that they explicitly model the composit…
Natural Language InferenceSentenceSentence ClassificationTensor Decompositions in Recursive Neural Networks for Tree-Structured Data
The paper introduces two new aggregation functions to encode structural knowledge from tree-structured data. They leverage the Canonical and Tensor-Train decompositions to yield expressive context aggregation while limit…
General ClassificationTree in Tree: from Decision Trees to Decision Graphs
Decision trees have been widely used as classifiers in many machine learning applications thanks to their lightweight and interpretable decision process. This paper introduces Tree in Tree decision graph (TnT), a framewo…
Recursive Tree Attention: Improving Semantic Representations with Syntactic Tree Structured Attention Mechanism
Attention mechanism has shown its effectiveness in state-of-the-art methods on various tasks in natural language processing (NLP). However, these methods are still using attention mechanism in plain, linear topological s…
Constituency ParsingRepresentation LearningSentencetext-classification+1Recursive Non-Autoregressive Graph-to-Graph Transformer for Dependency Parsing with Iterative Refinement
We propose the Recursive Non-autoregressive Graph-to-Graph Transformer architecture (RNGTr) for the iterative refinement of arbitrary graphs through the recursive application of a non-autoregressive Graph-to-Graph Transf…
Dependency Parsing