Pith. sign in

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

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

1 Pith paper citing it
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.

fields

cs.CV 1

years

2019 1

verdicts

CONDITIONAL 1

representative citing papers

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

cs.CV · 2019-08-11 · conditional · novelty 4.0

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 assignment.

citing papers explorer

Showing 1 of 1 citing paper.

  • Efficiency and Scalability of Multi-Lane Capsule Networks (MLCN) cs.CV · 2019-08-11 · conditional · none · ref 12 · internal anchor

    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 assignment.