{"id":"W2911311653","doi":"10.1155/2019/9024745","title":"Approximating Betweenness Centrality to Identify Key Nodes in a Weighted Urban Complex Transportation Network","year":2019,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":61,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Science Foundation of Ningbo; Natural Science Foundation of Jiangsu Province; Government of Jiangsu Province","keywords":"Betweenness centrality; Centrality; Key (lock); Computer science; Node (physics); Flow network; Identification (biology); Complex network; Construct (python library); Data mining; Traffic flow (computer networking); Reliability (semiconductor); Network science; Computer network; Mathematical optimization; Mathematics; Engineering; Computer security; Statistics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001087034,0.0005507494,0.0004715392,0.00178941,0.0004962582,0.0008707141,0.0007377853,0.0004938843,0.0008567795],"category_scores_gemma":[0.006319434,0.0002314683,0.0004404797,0.001593761,0.0004633759,0.001594739,0.000639235,0.0005045124,0.0001803364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001011792,"about_ca_system_score_gemma":0.0008107202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009880634,"about_ca_topic_score_gemma":0.009362346,"domain_scores_codex":[0.9995223,0.0001751087,0.00002008352,0.0001160991,0.0001116726,0.00005468667],"domain_scores_gemma":[0.9978142,0.001386604,0.0002714241,0.0001162057,0.0003469423,0.00006451883],"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.00008608758,0.00003195561,0.00487711,0.00005485294,0.00004235837,0.00009499519,0.0001181644,0.9332884,0.003288403,0.01673615,0.0006108148,0.04077075],"study_design_scores_gemma":[0.000002431774,0.000008566114,0.0002986771,0.00000246959,0.000004556936,0.00001800786,0.00001620733,0.9964831,0.0002818823,0.00271879,0.0001613095,0.000004109263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09117636,0.0001449128,0.9074693,0.00007934267,0.00002010042,0.00004175869,0.00005650187,0.0001035425,0.0009082978],"genre_scores_gemma":[0.7960496,0.0002146241,0.2023852,0.00002242551,0.00001923781,0.00009085874,0.0001698226,0.00004104955,0.001007234],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009880634,"threshold_uncertainty_score":0.01964623,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01268089645452958,"score_gpt":0.2908432610882297,"score_spread":0.2781623646337001,"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."}}