Pith. sign in

REVIEW 2 cited by

Text classification optimization algorithm based on graph neural network

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2408.15257 v1 pith:HOXOFYV5 submitted 2024-08-09 cs.CL cs.AI

classification cs.CLcs.AI
keywords textclassificationgraphalgorithmconstructionexistingmethodsmodel
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In the field of natural language processing, text classification, as a basic task, has important research value and application prospects. Traditional text classification methods usually rely on feature representations such as the bag of words model or TF-IDF, which overlook the semantic connections between words and make it challenging to grasp the deep structural details of the text. Recently, GNNs have proven to be a valuable asset for text classification tasks, thanks to their capability to handle non-Euclidean data efficiently. However, the existing text classification methods based on GNN still face challenges such as complex graph structure construction and high cost of model training. This paper introduces a text classification optimization algorithm utilizing graph neural networks. By introducing adaptive graph construction strategy and efficient graph convolution operation, the accuracy and efficiency of text classification are effectively improved. The experimental results demonstrate that the proposed method surpasses traditional approaches and existing GNN models across multiple public datasets, highlighting its superior performance and feasibility for text classification tasks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. An Improved Dung Beetle Optimizer for Random Forest Optimization

    math.OC 2024-11 reject novelty 3.0 of 10

    Adding circle mapping and crossover to the Dung Beetle Optimizer yields faster convergence and better accuracy on selected benchmark functions, and improved random forest hyperparameters on a retail dataset.

  2. Few-Shot Learning with Adaptive Weight Masking in Conditional GANs

    cs.CV 2024-12 reject novelty 2.0 of 10

    A CGAN with residual generator blocks and a heuristically computed weight mask on the discriminator reports better IS/FID on MNIST, but the paper lacks downstream few-shot evaluation and any code or training details.

Pith tools