{"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/a-probabilistic-constrained-clustering-for","title":"A probabilistic constrained clustering for transfer learning and image category discovery","arxiv_id":"1806.11078","date":"2018-06-28","proceeding":null,"authors":["Yen-Chang Hsu","Zhaoyang Lv","Joel Schlosser","Phillip Odom","Zsolt Kira"],"abstract":"Neural network-based clustering has recently gained popularity, and in\nparticular a constrained clustering formulation has been proposed to perform\ntransfer learning and image category discovery using deep learning. The core\nidea is to formulate a clustering objective with pairwise constraints that can\nbe used to train a deep clustering network; therefore the cluster assignments\nand their underlying feature representations are jointly optimized end-to-end.\nIn this work, we provide a novel clustering formulation to address scalability\nissues of previous work in terms of optimizing deeper networks and larger\namounts of categories. The proposed objective directly minimizes the negative\nlog-likelihood of cluster assignment with respect to the pairwise constraints,\nhas no hyper-parameters, and demonstrates improved scalability and performance\non both supervised learning and unsupervised transfer learning.","url_abs":"http://arxiv.org/abs/1806.11078v1","url_pdf":"http://arxiv.org/pdf/1806.11078v1.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":[],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"constrained-clustering","task_name":"Constrained Clustering"},{"task_slug":"deep-clustering","task_name":"Deep Clustering"},{"task_slug":"ecg-risk-stratification","task_name":"Ecg Risk Stratification"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/ecg-risk-stratification-on-ngm","task":"Ecg Risk Stratification","dataset":"ngm","model":"Hareesh","rank_in_archive_order":1,"of":1,"metrics":{"520":"34.5"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1806.11078","atlas_url":"https://app.syntology.ai/?focus=1806.11078","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":"1806.11078"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1806.11078\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1806.11078"},"call":"get_concepts_for_paper(arxiv_id=\"1806.11078\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"6146e50f52e0208a4e94571274b4a8ae4481b6240590e809bdef3382f4fce8af","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}