{"id":"W4379530777","doi":"10.1016/j.trc.2023.104178","title":"Anti-circulant dynamic mode decomposition with sparsity-promoting for highway traffic dynamics analysis","year":2023,"lang":"en","type":"article","venue":"Transportation Research Part C Emerging Technologies","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Mode (computer interface); Dynamic mode decomposition; Matrix decomposition; Timestamp; Temporal database; Data mining; Dynamic data; Dimension (graph theory); Circulant matrix; Algorithm; Real-time computing; Mathematics; Machine learning","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003953565,0.0001764764,0.0002904015,0.0008555184,0.000542169,0.00006385782,0.0002632439,0.00008848398,0.00002928376],"category_scores_gemma":[0.000006862657,0.0001587278,0.0001628044,0.002747622,0.0001596527,0.0001684155,0.00001431603,0.0003640928,0.0000109133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005120151,"about_ca_system_score_gemma":0.00003813411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000100262,"about_ca_topic_score_gemma":0.0004438533,"domain_scores_codex":[0.9982001,0.0000476243,0.0003011604,0.000476583,0.0003928464,0.0005816899],"domain_scores_gemma":[0.9992136,0.0001161969,0.0001014142,0.0003099973,0.0002059546,0.00005284588],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000870849,0.0001624497,0.02369939,0.0001064864,0.0008387371,0.00001359139,0.0006600505,0.9070944,0.001859116,0.02142093,0.0006603701,0.04339734],"study_design_scores_gemma":[0.0003821963,0.00007989707,0.005596205,0.00005378624,0.0001581153,2.460489e-7,0.003313679,0.9857216,0.001506407,0.00264793,0.0003076708,0.0002322624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8991582,0.00001765988,0.09704079,0.001851388,0.00005745006,0.0004989321,0.0001828459,0.00114762,0.00004510038],"genre_scores_gemma":[0.9958818,0.00006455987,0.001260745,0.000002857831,0.00002821896,0.0002672549,0.002353864,0.00002725934,0.0001134723],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09672356,"threshold_uncertainty_score":0.647273,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04164255938735632,"score_gpt":0.3808776537893076,"score_spread":0.3392350944019513,"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."}}