{"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-with-deep-aligned","title":"Discovering New Intents with Deep Aligned Clustering","arxiv_id":"2012.08987","date":"2020-12-16","proceeding":null,"authors":["Hanlei Zhang","Hua Xu","Ting-En Lin","Rui Lyu"],"abstract":"Discovering new intents is a crucial task in dialogue systems. Most existing methods are limited in transferring the prior knowledge from known intents to new intents. They also have difficulties in providing high-quality supervised signals to learn clustering-friendly features for grouping unlabeled intents. In this work, we propose an effective method, Deep Aligned Clustering, to discover new intents with the aid of the limited known intent data. Firstly, we leverage a few labeled known intent samples as prior knowledge to pre-train the model. Then, we perform k-means to produce cluster assignments as pseudo-labels. Moreover, we propose an alignment strategy to tackle the label inconsistency problem during clustering assignments. Finally, we learn the intent representations under the supervision of the aligned pseudo-labels. With an unknown number of new intents, we predict the number of intent categories by eliminating low-confidence intent-wise clusters. Extensive experiments on two benchmark datasets show that our method is more robust and achieves substantial improvements over the state-of-the-art methods. The codes are released at https://github.com/thuiar/DeepAligned-Clustering.","url_abs":"https://arxiv.org/abs/2012.08987v7","url_pdf":"https://arxiv.org/pdf/2012.08987v7.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-with-deep-aligned","repo_url":"https://github.com/hanleizhang/DeepAligned-Clustering","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"discovering-new-intents-with-deep-aligned","repo_url":"https://github.com/thuiar/DeepAligned-Clustering","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}}],"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-banking77","task":"Open Intent Discovery","dataset":"BANKING77","model":"DeepAligned","rank_in_archive_order":2,"of":2,"metrics":{"ACC":"64.9","ARI":"0.5364","NMI":"0.7956"},"uses_additional_data":false},{"leaderboard":"/sota/open-intent-discovery-on-clinc150","task":"Open Intent Discovery","dataset":"CLINC150","model":"DeepAligned","rank_in_archive_order":2,"of":2,"metrics":{"ACC":"86.49","ARI":"0.7975","NMI":"0.9389"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2012.08987","atlas_url":"https://app.syntology.ai/?focus=2012.08987","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":"2012.08987"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2012.08987\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2012.08987"},"call":"get_concepts_for_paper(arxiv_id=\"2012.08987\")"}],"by_repo":[{"repo":"hanleizhang/DeepAligned-Clustering","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"thuiar/DeepAligned-Clustering","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":"d4dc919281a02b4ca68e6e0823a0c86aac21d0eb7185944a45d57941e980689b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}