{"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/discovering-new-intents-via-constrained-deep","title":"Discovering New Intents via Constrained Deep Adaptive Clustering with Cluster Refinement","arxiv_id":"1911.08891","date":"2019-11-20","proceeding":null,"authors":["Ting-En Lin","Hua Xu","Hanlei Zhang"],"abstract":"Identifying new user intents is an essential task in the dialogue system. However, it is hard to get satisfying clustering results since the definition of intents is strongly guided by prior knowledge. Existing methods incorporate prior knowledge by intensive feature engineering, which not only leads to overfitting but also makes it sensitive to the number of clusters. In this paper, we propose constrained deep adaptive clustering with cluster refinement (CDAC+), an end-to-end clustering method that can naturally incorporate pairwise constraints as prior knowledge to guide the clustering process. Moreover, we refine the clusters by forcing the model to learn from the high confidence assignments. After eliminating low confidence assignments, our approach is surprisingly insensitive to the number of clusters. Experimental results on the three benchmark datasets show that our method can yield significant improvements over strong baselines.","url_abs":"https://arxiv.org/abs/1911.08891v1","url_pdf":"https://arxiv.org/pdf/1911.08891v1.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":"discovering-new-intents-via-constrained-deep","repo_url":"https://github.com/thuiar/CDAC-plus","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"open-intent-discovery","task_name":"Open Intent Discovery"},{"task_slug":"short-text-clustering","task_name":"Short Text Clustering"},{"task_slug":"text-clustering","task_name":"Text Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/open-intent-discovery-on-atis","task":"Open Intent Discovery","dataset":"ATIS","model":"CDAC+","rank_in_archive_order":1,"of":1,"metrics":{"ACC":"91.66","ARI":"89.41","NMI":"94.74"},"uses_additional_data":false},{"leaderboard":"/sota/open-intent-discovery-on-snips","task":"Open Intent Discovery","dataset":"SNIPS","model":"CDAC+","rank_in_archive_order":2,"of":2,"metrics":{"ACC":"93.63","ARI":"86.82","NMI":"89.3"},"uses_additional_data":false},{"leaderboard":"/sota/open-intent-discovery-on-stackoverflow","task":"Open Intent Discovery","dataset":"Stackoverflow","model":"CDAC+","rank_in_archive_order":2,"of":2,"metrics":{"ACC":"73.48","ARI":"52.59","NMI":"69.84"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1911.08891","atlas_url":"https://app.syntology.ai/?focus=1911.08891","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":"1911.08891"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1911.08891\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1911.08891"},"call":"get_concepts_for_paper(arxiv_id=\"1911.08891\")"}],"by_repo":[{"repo":"thuiar/CDAC-plus","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":"55a3188e447a2259e7a0e154075adfa7d13eba514ec74fe7bc88d1d7879a66c6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}