Pith. sign in

Graph-based Deep-Tree Recursive Neural Network (DTRNN) for Text Classification

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

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.

citation-role summary

background 1

citation-polarity summary

fields

cs.LG 1

years

2019 1

verdicts

REJECT 1

roles

background 1

polarities

background 1

representative citing papers

Graph Representation Learning: A Survey

cs.LG · 2019-09-03 · reject · novelty 2.0

A survey of graph embedding methods with a small benchmark comparison of seven methods on citation and social network data, and an advertised code library that is not provided.

citing papers explorer

Showing 1 of 1 citing paper.

  • Graph Representation Learning: A Survey cs.LG · 2019-09-03 · reject · none · ref 25 · internal anchor

    A survey of graph embedding methods with a small benchmark comparison of seven methods on citation and social network data, and an advertised code library that is not provided.