{"id":"https://openalex.org/W7100293136","doi":null,"title":"Learning to hash with binary reconstructive embeddings. NIPS","display_name":"Learning to hash with binary reconstructive embeddings. NIPS","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W7100293136"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.821.9796","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.821.9796","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://papers.nips.cc/paper/3667-learning-to-hash-with-binary-reconstructive-embeddings.pdf","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049134079","display_name":"Brian Kulis","orcid":"https://orcid.org/0000-0002-1704-3838","observed_orcids":["https://orcid.org/0000-0002-1704-3838"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Brian Kulis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5029105520","display_name":"Trevor Darrell","orcid":"https://orcid.org/0000-0001-5453-8533","observed_orcids":["https://orcid.org/0000-0001-5453-8533"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Trevor Darrell","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.67370733,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.000699999975040555,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10824","display_name":"Image Retrieval and Classification Techniques","score":0.0003000000142492354,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hash-learning","display_name":"hash code learning","score":0.9319999814033508},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"nearest neighbor search","score":0.7250000238418579},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.7519999742507935},{"id":"https://openalex.org/keywords/reconstruction-error","display_name":"reconstruction error","score":0.800000011920929},{"id":"https://openalex.org/keywords/coordinate-descent","display_name":"coordinate descent","score":0.8960000276565552},{"id":"https://openalex.org/keywords/kernelization","display_name":"kernelization","score":0.7829999923706055},{"id":"https://openalex.org/keywords/fast-retrieval","display_name":"fast retrieval","score":0.5649999976158142},{"id":"https://openalex.org/keywords/semantic-hashing","display_name":"semantic hashing","score":0.8059999942779541},{"id":"https://openalex.org/keywords/spectral-hashing","display_name":"spectral hashing","score":0.9990000128746033}],"concepts":[{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.8248999714851379},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6011999845504761},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.5708000063896179},{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.5077999830245972},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.506600022315979},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.4812999963760376},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4781999886035919},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46700000762939453},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.44359999895095825},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.43689998984336853},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.42179998755455017},{"id":"https://openalex.org/C187062812","wikidata":"https://www.wikidata.org/wiki/Q6322840","display_name":"K-independent hashing","level":5,"score":0.37400001287460327},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.37040001153945923},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3540000021457672},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34929999709129333},{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.2890999913215637},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2856999933719635},{"id":"https://openalex.org/C116058348","wikidata":"https://www.wikidata.org/wiki/Q846912","display_name":"Universal hashing","level":5,"score":0.28209999203681946},{"id":"https://openalex.org/C133667856","wikidata":"https://www.wikidata.org/wiki/Q5439682","display_name":"Feature hashing","level":5,"score":0.27160000801086426},{"id":"https://openalex.org/C2779190172","wikidata":"https://www.wikidata.org/wiki/Q4913888","display_name":"Binary data","level":3,"score":0.2506999969482422}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.821.9796","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.821.9796","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://papers.nips.cc/paper/3667-learning-to-hash-with-binary-reconstructive-embeddings.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2164338181","https://openalex.org/W2057550055","https://openalex.org/W2081721244","https://openalex.org/W2592673077","https://openalex.org/W3021272084","https://openalex.org/W3125274250","https://openalex.org/W2301676334","https://openalex.org/W1507207255","https://openalex.org/W2791580258","https://openalex.org/W2752930373"],"abstract_inverted_index":{"Fast":[0],"retrieval":[1],"methods":[2,17,88],"are":[3],"increasingly":[4],"critical":[5],"for":[6,24,38,68],"many":[7],"large-scale":[8],"analysis":[9],"tasks,":[10],"and":[11,26,53,93,101],"there":[12],"have":[13],"been":[14],"several":[15],"recent":[16],"that":[18,73,122],"attempt":[19],"to":[20,76,120],"learn":[21,78],"hash":[22,40,79],"functions":[23,41,80],"fast":[25],"accurate":[27],"nearest":[28],"neighbor":[29],"searches.":[30],"In":[31],"this":[32],"paper,":[33],"we":[34],"develop":[35,63],"an":[36],"algorithm":[37,67],"learning":[39],"based":[42],"on":[43],"explicitly":[44],"minimizing":[45],"the":[46,50,54,58,108,112],"reconstruction":[47],"error":[48],"between":[49],"original":[51],"distances":[52,56],"Hamming":[55],"of":[57,84,111],"corresponding":[59],"binary":[60],"embeddings.":[61],"We":[62,114],"a":[64,82],"scalable":[65],"coordinate-descent":[66],"our":[69,96,123],"proposed":[70],"hashing":[71,92],"objective":[72],"is":[74,98],"able":[75],"efficiently":[77],"in":[81],"va-riety":[83],"settings.":[85],"Unlike":[86],"existing":[87,126],"such":[89],"as":[90],"semantic":[91],"spectral":[94],"hashing,":[95],"method":[97,124],"easily":[99],"kernelized":[100],"does":[102],"not":[103],"require":[104],"restrictive":[105],"assump-tions":[106],"about":[107],"underlying":[109],"distribution":[110],"data.":[113],"present":[115],"results":[116],"over":[117],"sev-eral":[118],"domains":[119],"demonstrate":[121],"outperforms":[125],"state-of-the-art":[127],"techniques.":[128],"1":[129]},"counts_by_year":[],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2025-10-27T00:00:00"}