{"id":"W4411403538","doi":"10.1145/3725325","title":"MIRAGE-ANNS: Mixed Approach Graph-based Indexing for Approximate Nearest Neighbor Search","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Management of Data","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Search engine indexing; Computer science; Graph; Nearest neighbor search; k-nearest neighbors algorithm; Data mining; Search engine; Context (archaeology); Search algorithm; Theoretical computer science; Machine learning; Artificial intelligence; Algorithm; Information retrieval","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009713725,0.001177634,0.001958652,0.003383806,0.001074827,0.001842184,0.002951786,0.001380574,0.005559051],"category_scores_gemma":[0.007208297,0.0005282782,0.00106915,0.004963316,0.000690302,0.004272624,0.003054677,0.001312413,0.003408729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001166225,"about_ca_system_score_gemma":0.001904601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01162437,"about_ca_topic_score_gemma":0.02488246,"domain_scores_codex":[0.9980995,0.0003727742,0.000170405,0.0003224144,0.0009103546,0.0001246376],"domain_scores_gemma":[0.9975682,0.0006891334,0.0001596941,0.0009910166,0.0004862581,0.0001056583],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007046199,0.0005144769,0.002821071,0.0005419258,0.0002130772,0.0001948666,0.0002712469,0.08542538,0.01225173,0.02590708,0.0562634,0.8148911],"study_design_scores_gemma":[0.00009499804,0.0002647561,0.0005505135,0.00003105924,0.00004486342,0.0002800091,0.0001059149,0.9449919,0.006976833,0.02442574,0.02217705,0.00005634715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02991495,0.003280116,0.9317886,0.0004552763,0.0003724673,0.0005306472,0.002818977,0.0219753,0.008863769],"genre_scores_gemma":[0.141462,0.0009515744,0.8417385,0.0003277295,0.0001727426,0.0003659627,0.008109569,0.0008215054,0.00605058],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01162437,"threshold_uncertainty_score":0.02311343,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08133916376663859,"score_gpt":0.3436731363883481,"score_spread":0.2623339726217095,"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."}}