{"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/learning-a-metric-for-class-conditional-knn","title":"Learning a metric for class-conditional KNN","arxiv_id":"1607.03050","date":"2016-07-11","proceeding":null,"authors":["Daniel Jiwoong Im","Graham W. Taylor"],"abstract":"Naive Bayes Nearest Neighbour (NBNN) is a simple and effective framework\nwhich addresses many of the pitfalls of K-Nearest Neighbour (KNN)\nclassification. It has yielded competitive results on several computer vision\nbenchmarks. Its central tenet is that during NN search, a query is not compared\nto every example in a database, ignoring class information. Instead, NN\nsearches are performed within each class, generating a score per class. A key\nproblem with NN techniques, including NBNN, is that they fail when the data\nrepresentation does not capture perceptual (e.g.~class-based) similarity. NBNN\ncircumvents this by using independent engineered descriptors (e.g.~SIFT). To\nextend its applicability outside of image-based domains, we propose to learn a\nmetric which captures perceptual similarity. Similar to how Neighbourhood\nComponents Analysis optimizes a differentiable form of KNN classification, we\npropose \"Class Conditional\" metric learning (CCML), which optimizes a soft form\nof the NBNN selection rule. Typical metric learning algorithms learn either a\nglobal or local metric. However, our proposed method can be adjusted to a\nparticular level of locality by tuning a single parameter. An empirical\nevaluation on classification and retrieval tasks demonstrates that our proposed\nmethod clearly outperforms existing learned distance metrics across a variety\nof image and non-image datasets.","url_abs":"http://arxiv.org/abs/1607.03050v1","url_pdf":"http://arxiv.org/pdf/1607.03050v1.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":"learning-a-metric-for-class-conditional-knn","repo_url":"https://github.com/jiwoongim/CCML","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"metric-learning","task_name":"Metric Learning"},{"task_slug":"retrieval","task_name":"Retrieval"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"jiwoongim/CCML","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":"a5496eb742477ee138f53a6a1bee1bd3c1b599a96c0ac52b70ad43923664cdb2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}