{"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/neural-network-based-clustering-using","title":"Neural network-based clustering using pairwise constraints","arxiv_id":"1511.06321","date":"2015-11-19","proceeding":null,"authors":["Yen-Chang Hsu","Zsolt Kira"],"abstract":"This paper presents a neural network-based end-to-end clustering framework.\nWe design a novel strategy to utilize the contrastive criteria for pushing\ndata-forming clusters directly from raw data, in addition to learning a feature\nembedding suitable for such clustering. The network is trained with weak\nlabels, specifically partial pairwise relationships between data instances. The\ncluster assignments and their probabilities are then obtained at the output\nlayer by feed-forwarding the data. The framework has the interesting\ncharacteristic that no cluster centers need to be explicitly specified, thus\nthe resulting cluster distribution is purely data-driven and no distance\nmetrics need to be predefined. The experiments show that the proposed approach\nbeats the conventional two-stage method (feature embedding with k-means) by a\nsignificant margin. It also compares favorably to the performance of the\nstandard cross entropy loss for classification. Robustness analysis also shows\nthat the method is largely insensitive to the number of clusters. Specifically,\nwe show that the number of dominant clusters is close to the true number of\nclusters even when a large k is used for clustering.","url_abs":"http://arxiv.org/abs/1511.06321v5","url_pdf":"http://arxiv.org/pdf/1511.06321v5.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":"neural-network-based-clustering-using","repo_url":"https://github.com/yenchanghsu/NNclustering","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"torch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"neural-network-based-clustering-using","repo_url":"https://github.com/GT-RIPL/L2C","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1511.06321","atlas_url":"https://app.syntology.ai/?focus=1511.06321","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":"1511.06321"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1511.06321\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1511.06321"},"call":"get_concepts_for_paper(arxiv_id=\"1511.06321\")"}],"by_repo":[{"repo":"yenchanghsu/NNclustering","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"GT-RIPL/L2C","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1901.00544"],"harvested_for_calls":[{"arxiv_id":"1901.00544","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1901.00544"},"call":"get_harvested_code_for_paper(arxiv_id=\"1901.00544\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"43cff0be84ae6dc2852efd2b3cc70a6712a12b2cfd811f62d5dde47748f7f53b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}