{"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/self-taught-convolutional-neural-networks-for","title":"Self-Taught Convolutional Neural Networks for Short Text Clustering","arxiv_id":"1701.00185","date":"2017-01-01","proceeding":null,"authors":["Jiaming Xu","Peng Wang","Suncong Zheng","Guanhua Tian","Jun Zhao","Bo Xu"],"abstract":"Short text clustering is a challenging problem due to its sparseness of text\nrepresentation. Here we propose a flexible Self-Taught Convolutional neural\nnetwork framework for Short Text Clustering (dubbed STC^2), which can flexibly\nand successfully incorporate more useful semantic features and learn non-biased\ndeep text representation in an unsupervised manner. In our framework, the\noriginal raw text features are firstly embedded into compact binary codes by\nusing one existing unsupervised dimensionality reduction methods. Then, word\nembeddings are explored and fed into convolutional neural networks to learn\ndeep feature representations, meanwhile the output units are used to fit the\npre-trained binary codes in the training process. Finally, we get the optimal\nclusters by employing K-means to cluster the learned representations. Extensive\nexperimental results demonstrate that the proposed framework is effective,\nflexible and outperform several popular clustering methods when tested on three\npublic short text datasets.","url_abs":"http://arxiv.org/abs/1701.00185v1","url_pdf":"http://arxiv.org/pdf/1701.00185v1.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":"self-taught-convolutional-neural-networks-for","repo_url":"https://github.com/jacoxu/STC2","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"dimensionality-reduction","task_name":"Dimensionality Reduction"},{"task_slug":"short-text-clustering","task_name":"Short Text Clustering"},{"task_slug":"text-clustering","task_name":"Text Clustering"},{"task_slug":"word-embeddings","task_name":"Word Embeddings"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/short-text-clustering-on-biomedical","task":"Short Text Clustering","dataset":"Biomedical","model":"STC2-LE","rank_in_archive_order":3,"of":4,"metrics":{"Acc":"43.62"},"uses_additional_data":false},{"leaderboard":"/sota/short-text-clustering-on-biomedical","task":"Short Text Clustering","dataset":"Biomedical","model":"STC2-LPI","rank_in_archive_order":4,"of":4,"metrics":{"Acc":"43"},"uses_additional_data":false},{"leaderboard":"/sota/short-text-clustering-on-searchsnippets","task":"Short Text Clustering","dataset":"Searchsnippets","model":"STC2-LE","rank_in_archive_order":3,"of":4,"metrics":{"Acc":"77.09"},"uses_additional_data":false},{"leaderboard":"/sota/short-text-clustering-on-searchsnippets","task":"Short Text Clustering","dataset":"Searchsnippets","model":"STC2-LPI","rank_in_archive_order":4,"of":4,"metrics":{"Acc":"77.01"},"uses_additional_data":false},{"leaderboard":"/sota/short-text-clustering-on-stackoverflow","task":"Short Text Clustering","dataset":"Stackoverflow","model":"Deep ECIC","rank_in_archive_order":4,"of":5,"metrics":{"Acc":"STC2-LE"},"uses_additional_data":false},{"leaderboard":"/sota/short-text-clustering-on-stackoverflow","task":"Short Text Clustering","dataset":"Stackoverflow","model":"Deep ECIC","rank_in_archive_order":5,"of":5,"metrics":{"Acc":"STC2-LPI"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1701.00185","atlas_url":"https://app.syntology.ai/?focus=1701.00185","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1701.00185"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1701.00185\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1701.00185"},"call":"get_concepts_for_paper(arxiv_id=\"1701.00185\")"}],"by_repo":[{"repo":"jacoxu/STC2","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":"0469226af869f72c4202d7f425b4c149ffd6621451189d6a2c1cf53d70febbb8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}