atlas

Research map / Label-efficient and robust learning / Recognition and long-tail

Online Hashing with Efficient Updating of Binary Codes

AAAI 2020 · Label-efficient and robust learning › Recognition and long-tail · approach: Learning from unlabeled and positive-unlabeled data · 15 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Process queries and database codes asymmetrically, using a separate query projection (ablation)OHWEU · MS-COCO and NUS-WIDEmAPHelped
Increase the aggressiveness parameter C initially, then continue increasing it beyond the performance threshold (ablation)OHWEU · MS-COCO and NUS-WIDEmAPMixed
Use fixed hash functions and update projection functions rather than recomputing codes from the whole databaseOHWEU · MS-COCO and NUS-WIDEtraining timeHelped
Use OHWEU instead of other online hashing methodsOnline hashing methods · MS-COCO, 32–128 bitsmAPHelped
Use OHWEU instead of other online hashing methodsOnline hashing methods · NUS-WIDE, 64–128 bitsmAPHelped
Use OHWEU instead of MIH or BSODHOnline hashing methods · NUS-WIDE, 32 bitsmAPNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy