Pith. sign in

REVIEW 1 cited by

Compositional Coding Capsule Network with K-Means Routing for Text Classification

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 1810.09177 v5 pith:VTEBUITR submitted 2018-10-22 cs.LG cs.IRstat.ML

classification cs.LGcs.IRstat.ML
keywords codingcompositionalclassificationnetworktextembeddingsmethodparameters
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Text classification is a challenging problem which aims to identify the category of texts. In the process of training, word embeddings occupy a large part of parameters. Under the limitation of limited computing resources, it indirectly limits the ability of subsequent network designs. In order to reduce the number of parameters, the compositional coding mechanism has been proposed recently. Based on this, this paper further explores compositional coding and proposes a compositional weighted coding method. And we apply capsule network to model the relationship between word embeddings, a new routing algorithm, which is based on k-means clustering theory, is proposed to fully mine the relationship between word embeddings. Combined with our compositional weighted coding method and the routing algorithm, we design a neural network for text classification. Experiments conducted on eight challenging text classification datasets show that the proposed method achieves competitive accuracy compared to the state-of-the-art approach with significantly fewer parameters.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Efficiency and Scalability of Multi-Lane Capsule Networks (MLCN)

    cs.CV 2019-08 conditional novelty 4.0 of 10

    On multi-GPU systems, MLCN with model parallelism is about twice as efficient as original CapsNet with data parallelism, and a simple greedy lane-to-GPU heuristic reduces execution time by nearly half versus random as...

Pith tools