{"id":"W1484543036","doi":"10.1007/3-540-44466-1_35","title":"AIM: Approximate Intelligent Matching for Time Series Data","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Subsequence; Tree traversal; Graph traversal; Series (stratigraphy); Bottleneck; Matching (statistics); Data mining; Overhead (engineering); Sequence (biology); Curse of dimensionality; Theoretical computer science; Algorithm; Artificial intelligence","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","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001231318,0.0005844397,0.0007174122,0.0005573326,0.0004684257,0.00118456,0.0069974,0.0002389293,0.0001188702],"category_scores_gemma":[0.00005633933,0.0005165212,0.0001758211,0.0005249179,0.0004704437,0.001564116,0.003240949,0.0005136026,0.00008937036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001434223,"about_ca_system_score_gemma":0.0003189329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002541679,"about_ca_topic_score_gemma":0.00005181866,"domain_scores_codex":[0.9955993,0.00002310316,0.0007106969,0.002116408,0.000744861,0.0008056749],"domain_scores_gemma":[0.9961157,0.0003291159,0.0003473265,0.002878705,0.0001633061,0.0001658453],"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.00001311996,0.00001908469,0.00000195105,0.00005069692,0.00003052129,0.00002583528,0.0006548351,0.04209013,0.00004867618,0.01784785,0.00007528972,0.939142],"study_design_scores_gemma":[0.00009158861,0.0001104338,0.000001878018,0.0002390002,0.00001807781,0.00006210495,2.8265e-7,0.7869815,0.0003020072,0.1988408,0.01279228,0.0005600203],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001062924,0.0004490519,0.9937502,0.0006604418,0.0006148453,0.0004392504,0.00005173132,0.0001862062,0.003837657],"genre_scores_gemma":[0.003530768,0.0001378522,0.9921149,0.0008143188,0.0007836075,0.00001443383,0.0001245119,0.00007218005,0.002407427],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.938582,"threshold_uncertainty_score":0.9998523,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02841513791482825,"score_gpt":0.2503428419226876,"score_spread":0.2219277040078593,"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."}}