{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001393001,0.0009703217,0.00267217,0.004834636,0.001350607,0.002408423,0.002609018,0.001378393,0.003733297],"category_scores_gemma":[0.01205774,0.0003871029,0.0006476219,0.01022619,0.0008563453,0.008546201,0.003713152,0.0009845091,0.003077471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001546414,"about_ca_system_score_gemma":0.00275187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004813671,"about_ca_topic_score_gemma":0.006008409,"domain_scores_codex":[0.9969187,0.0004473297,0.0003928435,0.000416457,0.001595642,0.0002289254],"domain_scores_gemma":[0.9968404,0.0007413898,0.0003405003,0.001121009,0.0007417689,0.0002150035],"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.0007811936,0.0004402541,0.003555095,0.0007489523,0.0001166644,0.0003356306,0.0005604387,0.06294864,0.01255728,0.0605268,0.04443836,0.8129907],"study_design_scores_gemma":[0.0001609082,0.000613584,0.001466325,0.0001293804,0.00008002616,0.001713043,0.0004664541,0.8167338,0.01014014,0.103314,0.06505273,0.0001296221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03240972,0.005587798,0.9426197,0.0005979618,0.0003137205,0.0004773714,0.00315973,0.006608453,0.008225646],"genre_scores_gemma":[0.2403183,0.001898319,0.7439339,0.0002868209,0.0002405959,0.0005382877,0.008246384,0.0005165019,0.004020991],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004834636,"threshold_uncertainty_score":0.01248914,"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."}}