{"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/fast-supervised-hashing-with-decision-trees","title":"Fast Supervised Hashing with Decision Trees for High-Dimensional Data","arxiv_id":"1404.1561","date":"2014-04-06","proceeding":"CVPR 2014 6","authors":["Guosheng Lin","Chunhua Shen","Qinfeng Shi","Anton Van Den Hengel","David Suter"],"abstract":"Supervised hashing aims to map the original features to compact binary codes\nthat are able to preserve label based similarity in the Hamming space.\nNon-linear hash functions have demonstrated the advantage over linear ones due\nto their powerful generalization capability. In the literature, kernel\nfunctions are typically used to achieve non-linearity in hashing, which achieve\nencouraging retrieval performance at the price of slow evaluation and training\ntime. Here we propose to use boosted decision trees for achieving non-linearity\nin hashing, which are fast to train and evaluate, hence more suitable for\nhashing with high dimensional data. In our approach, we first propose\nsub-modular formulations for the hashing binary code inference problem and an\nefficient GraphCut based block search method for solving large-scale inference.\nThen we learn hash functions by training boosted decision trees to fit the\nbinary codes. Experiments demonstrate that our proposed method significantly\noutperforms most state-of-the-art methods in retrieval precision and training\ntime. Especially for high-dimensional data, our method is orders of magnitude\nfaster than many methods in terms of training time.","url_abs":"http://arxiv.org/abs/1404.1561v2","url_pdf":"http://arxiv.org/pdf/1404.1561v2.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":"fast-supervised-hashing-with-decision-trees","repo_url":"https://bitbucket.org/chhshen/fasthash","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"retrieval","task_name":"Retrieval"},{"task_slug":"high","task_name":"Vocal Bursts Intensity Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1404.1561","atlas_url":"https://app.syntology.ai/?focus=1404.1561","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":"1404.1561"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1404.1561\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1404.1561"},"call":"get_concepts_for_paper(arxiv_id=\"1404.1561\")"}],"by_repo":[{"repo":"bitbucket.org/chhshen/fasthash","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":"c4262911640bf4a3b45d99457adf71b033738c5d0523e13a12b31751c5e38c8e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}