{"id":"W4402564288","doi":"10.48550/arxiv.2408.07650","title":"Exact Trajectory Similarity Search With N-tree: An Efficient Metric Index for kNN and Range Queries","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Nearest neighbor search; Similarity (geometry); Index (typography); Metric (unit); Range (aeronautics); Trajectory; Tree (set theory); Mathematics; Computer science; Range query (database); Data mining; Algorithm; Artificial intelligence; Combinatorics; Information retrieval; Search engine; Web search query; Engineering; Physics; World Wide Web; Sargable","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005323639,0.0003341281,0.0003245845,0.0007654962,0.0001888803,0.0005220794,0.00139824,0.0001624064,0.000008756167],"category_scores_gemma":[0.00001482098,0.0003190498,0.0001087354,0.001105968,0.0001764374,0.0004479906,0.002804967,0.0005266687,0.00001090032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001288385,"about_ca_system_score_gemma":0.000163753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002231985,"about_ca_topic_score_gemma":0.000182688,"domain_scores_codex":[0.9977535,0.0001064044,0.0001413139,0.001420961,0.0001746519,0.0004031498],"domain_scores_gemma":[0.9984439,0.0001233349,0.00008513529,0.001037587,0.0001190171,0.000191032],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000683568,0.001268155,0.01993717,0.00411159,0.001425322,0.002674661,0.003075839,0.3142641,0.00002196936,0.5938767,0.00203474,0.05662622],"study_design_scores_gemma":[0.0007403013,0.0002389526,0.007485706,0.0000899817,0.0001469148,0.000003365558,0.0002102331,0.9846135,0.00003400498,0.005085264,0.0008174943,0.0005342641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2993206,0.0001908559,0.6977856,0.0001053228,0.0003551729,0.0007317655,0.00009674818,0.000307443,0.001106528],"genre_scores_gemma":[0.9942345,0.00009831729,0.004246663,0.00004323753,0.00007750212,0.000003977641,0.00004456469,0.00002420819,0.001227028],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6949139,"threshold_uncertainty_score":0.9999261,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06774126754605381,"score_gpt":0.2100978507326794,"score_spread":0.1423565831866256,"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."}}