{"id":"W2104293880","doi":"10.1103/physreve.83.056105","title":"Locally optimal heuristic for modularity maximization of networks","year":2011,"lang":"en","type":"article","venue":"Physical Review E","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":43,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Heuristics; Heuristic; Modularity (biology); Computer science; Consistent heuristic; Hierarchical clustering; Maximization; Mathematics; Mathematical optimization; Algorithm; Theoretical computer science; Artificial intelligence; Cluster analysis; Incremental heuristic search; Search algorithm; Beam search","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.002731841,0.0009272383,0.00115369,0.002376283,0.0008148987,0.001122631,0.001980382,0.001399255,0.002648428],"category_scores_gemma":[0.01076554,0.0006949738,0.0007713215,0.00152103,0.001478943,0.002241001,0.001610163,0.00111318,0.0005517866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00174144,"about_ca_system_score_gemma":0.00126423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001653412,"about_ca_topic_score_gemma":0.002305837,"domain_scores_codex":[0.9983336,0.0008061596,0.00006090492,0.0003061229,0.0003388888,0.0001541932],"domain_scores_gemma":[0.9963108,0.002331472,0.0003040154,0.0004192918,0.0004767819,0.0001576779],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002605323,0.0001254365,0.00123825,0.0002477309,0.0001220051,0.0001093943,0.0003209747,0.7354928,0.006803791,0.06393239,0.004448471,0.1868983],"study_design_scores_gemma":[0.00003728633,0.00004549608,0.0002082558,0.00001604595,0.00001627065,0.0000534236,0.00003404592,0.9597231,0.001986316,0.03688747,0.0009786895,0.00001367659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01852877,0.0003188817,0.9782178,0.0001466868,0.00002384288,0.00009338179,0.00004268063,0.0003824628,0.002245468],"genre_scores_gemma":[0.2780267,0.0002324897,0.7190599,0.0001543826,0.00006360621,0.0002490911,0.0001843771,0.0002458742,0.001783508],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002731841,"threshold_uncertainty_score":0.01444757,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03104031612887703,"score_gpt":0.3031708245835363,"score_spread":0.2721305084546593,"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."}}