{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/compositional-coding-capsule-network-with-k","title":"Compositional Coding Capsule Network with K-Means Routing for Text Classification","arxiv_id":"1810.09177","date":"2018-10-22","proceeding":null,"authors":["Hao Ren","Hong Lu"],"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.","url_abs":"https://arxiv.org/abs/1810.09177v5","url_pdf":"https://arxiv.org/pdf/1810.09177v5.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"compositional-coding-capsule-network-with-k","repo_url":"https://github.com/leftthomas/CCCapsNet","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"sentiment-analysis","task_name":"Sentiment Analysis"},{"task_slug":"text-classification","task_name":"Text Classification"},{"task_slug":"text-classification-1","task_name":"text-classification"}],"methods":[{"method_slug":"fixcaps","method_name":"Capsule Network"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/sentiment-analysis-on-amazon-review-full","task":"Sentiment Analysis","dataset":"Amazon Review Full","model":"CCCapsNet","rank_in_archive_order":7,"of":9,"metrics":{"Accuracy":"60.95"},"uses_additional_data":false},{"leaderboard":"/sota/sentiment-analysis-on-amazon-review-polarity","task":"Sentiment Analysis","dataset":"Amazon Review Polarity","model":"CCCapsNet","rank_in_archive_order":7,"of":9,"metrics":{"Accuracy":"94.96"},"uses_additional_data":false},{"leaderboard":"/sota/sentiment-analysis-on-yelp-binary","task":"Sentiment Analysis","dataset":"Yelp Binary classification","model":"CCCapsNet","rank_in_archive_order":12,"of":20,"metrics":{"Error":"3.52"},"uses_additional_data":false},{"leaderboard":"/sota/sentiment-analysis-on-yelp-fine-grained","task":"Sentiment Analysis","dataset":"Yelp Fine-grained classification","model":"CCCapsNet","rank_in_archive_order":11,"of":17,"metrics":{"Error":"34.15"},"uses_additional_data":false},{"leaderboard":"/sota/text-classification-on-ag-news","task":"Text Classification","dataset":"AG News","model":"CCCapsNet","rank_in_archive_order":15,"of":24,"metrics":{"Error":"7.61"},"uses_additional_data":false},{"leaderboard":"/sota/text-classification-on-dbpedia","task":"Text Classification","dataset":"DBpedia","model":"CCCapsNet","rank_in_archive_order":16,"of":21,"metrics":{"Error":"1.28"},"uses_additional_data":false},{"leaderboard":"/sota/text-classification-on-sogou-news","task":"Text Classification","dataset":"Sogou News","model":"CCCapsNet","rank_in_archive_order":2,"of":3,"metrics":{"Accuracy":"97.25"},"uses_additional_data":false},{"leaderboard":"/sota/text-classification-on-yahoo-answers","task":"Text Classification","dataset":"Yahoo! Answers","model":"CCCapsNet","rank_in_archive_order":7,"of":10,"metrics":{"Accuracy":"73.85"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"leftthomas/CCCapsNet","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"a661bb5c70cddea74810b19d13f832eadd8d3c694faa0e39bb1d441aaad60caa","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}