We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Graph Convolutional Networks (GCN) have been effective at tasks that have rich relational structure and can preserve global structure information of a dataset in graph embeddings. Recently, many researchers focused on examining whether GCNs could handle different Natural Language Processing tasks, especially text classification. While applying GCNs to text classification is well-studied, its graph construction techniques, such as node/edge selection and their feature representation, and the optimal GCN learning mechanism in text classification is rather neglected. In this paper, we conduct a comprehensive analysis of the role of node and edge embeddings in a graph and its GCN learning techniques in text classification. Our analysis is the first of its kind and provides useful insights into the importance of each graph node/edge construction mechanism when applied at the GCN training/testing in different text classification benchmarks, as well as under its semi-supervised environment.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2203.16060")
get_code_for_paper("2203.16060")
have("2203.16060")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2203.16060.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2203.16060)
Connect an agent — have() is free.