{"id":"W2797819729","doi":"10.1109/tkde.2018.2828095","title":"Fast Cosine Similarity Search in Binary Space with Angular Multi-Index Hashing","year":2018,"lang":"en","type":"preprint","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hamming distance; Nearest neighbor search; Binary code; Hash function; Hash table; Cosine similarity; Dynamic perfect hashing; Hamming space; Binary number; Computer science; Locality-sensitive hashing; Similarity (geometry); Linear search; Algorithm; Binary search algorithm; Hamming code; Search algorithm; Mathematics; Theoretical computer science; Double hashing; Data mining; Pattern recognition (psychology); Block code; Artificial intelligence; Decoding methods","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004035649,0.0003892228,0.0003771805,0.0005045964,0.0001302777,0.0002253938,0.001283567,0.0002355898,0.000004813353],"category_scores_gemma":[0.00001237489,0.0003745299,0.00004454037,0.000546904,0.00007237362,0.0009881258,0.000187842,0.001228492,0.000007764197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001094254,"about_ca_system_score_gemma":0.0001271798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006888327,"about_ca_topic_score_gemma":0.0001173933,"domain_scores_codex":[0.9980417,0.00004780371,0.0002681969,0.001031811,0.0002128674,0.0003976321],"domain_scores_gemma":[0.9978503,0.000112736,0.00004910166,0.001726447,0.000115979,0.0001454164],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004286121,0.003713286,0.0009849581,0.00499854,0.0006356263,0.001078733,0.006967257,0.5350186,0.01871399,0.0003990919,0.001144902,0.4259164],"study_design_scores_gemma":[0.0005018711,0.0001586687,0.0004469704,0.001065454,0.0000199687,0.00002455143,0.00001877791,0.9595731,0.0367051,0.0000250347,0.0009373077,0.0005231447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00333769,0.000776378,0.9944758,0.00008759024,0.000280687,0.0003915504,0.0001564319,0.0004501836,0.00004363638],"genre_scores_gemma":[0.7518883,0.000594169,0.2471617,0.00002033937,0.00009312478,0.00004052014,0.00004662952,0.00005349721,0.0001017522],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7485507,"threshold_uncertainty_score":0.9998707,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04571143733524703,"score_gpt":0.3195922724737524,"score_spread":0.2738808351385054,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}