{"id":"W4407277142","doi":"10.1145/3716825","title":"Exact Trajectory Similarity Search With N-tree: An Efficient Metric Index for kNN and Range Queries","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Spatial Algorithms and Systems","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Fredericton; University of New Brunswick","funders":"","keywords":"Nearest neighbor search; Metric (unit); Similarity (geometry); Range (aeronautics); Trajectory; Index (typography); Tree (set theory); Computer science; Metric space; Range query (database); Cover tree; Mathematics; Algorithm; Theoretical computer science; Data mining; Combinatorics; Discrete mathematics; Artificial intelligence; Information retrieval; Search engine; Physics; Web search query; World Wide Web; Materials science","routes":{"ca_aff":true,"ca_fund":false,"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":[],"consensus_categories":[],"category_scores_codex":[0.0005895359,0.0002457608,0.0003331036,0.0005209459,0.0005102167,0.0005974612,0.0005315906,0.00009433339,0.000003443062],"category_scores_gemma":[0.00001409037,0.0001960307,0.00005361993,0.0007151955,0.0001102576,0.000515518,0.00003886134,0.0001931488,0.000001196729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004458614,"about_ca_system_score_gemma":0.00006612855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002010754,"about_ca_topic_score_gemma":0.0004597533,"domain_scores_codex":[0.9982409,0.0001156815,0.0002781326,0.0006637359,0.0003627707,0.0003387703],"domain_scores_gemma":[0.9987416,0.0002442538,0.00005814565,0.0006961576,0.0001196959,0.0001401949],"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.0001654723,0.0004774339,0.001035587,0.0003906877,0.0002359793,0.00001765991,0.0007846754,0.005233706,0.00002971812,0.002943758,0.00007705136,0.9886083],"study_design_scores_gemma":[0.002050799,0.0008566744,0.01428835,0.0001030798,0.00007535868,0.00001300704,0.0006041715,0.9787738,0.0001692974,0.0001104934,0.002576539,0.0003783918],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01145057,0.0003139189,0.9860128,0.0003820895,0.0005599033,0.0009148516,0.00009838158,0.0001363545,0.0001310898],"genre_scores_gemma":[0.9776101,0.00009965716,0.02132395,0.00008098083,0.00008490494,0.000197345,0.00001617047,0.00001652818,0.0005704213],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9882299,"threshold_uncertainty_score":0.79939,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02446961917894443,"score_gpt":0.2716018674505872,"score_spread":0.2471322482716428,"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."}}