{"id":"W2150860159","doi":"10.1016/j.dam.2012.03.030","title":"Improving heuristics for network modularity maximization using an exact algorithm","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":29,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Heuristics; Merge (version control); Maximization; Algorithm; Heuristic; Merge algorithm; Partition (number theory); Mathematics; Modularity (biology); Computer science; Mathematical optimization; Parallel computing","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.003412829,0.002201309,0.002729849,0.002576281,0.001298094,0.001813705,0.003515116,0.002348079,0.008078421],"category_scores_gemma":[0.01972036,0.001504363,0.001533616,0.002852844,0.001694064,0.003735507,0.002369336,0.002455689,0.001483147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002452145,"about_ca_system_score_gemma":0.003349169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008723903,"about_ca_topic_score_gemma":0.01188677,"domain_scores_codex":[0.998061,0.0008156822,0.00008491995,0.0004263358,0.000349168,0.000262768],"domain_scores_gemma":[0.9864483,0.01086602,0.0004711739,0.001053152,0.0008668447,0.0002943976],"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.0002524123,0.000255357,0.0006694595,0.000215058,0.00009135032,0.00007177591,0.0001246758,0.8289914,0.001583558,0.02485667,0.005024024,0.1378644],"study_design_scores_gemma":[0.00005156466,0.00002226247,0.00007238764,0.000008623132,0.00001495349,0.00001527878,0.00001241935,0.9825212,0.0002624798,0.01672761,0.0002849346,0.000006227343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01511689,0.0003030519,0.9799001,0.0001985964,0.00008834061,0.0001500956,0.00009582856,0.0009337501,0.003213396],"genre_scores_gemma":[0.1794115,0.0002010071,0.8168587,0.0002135304,0.0001055065,0.0003206611,0.0002654119,0.0003318471,0.002291709],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008723903,"threshold_uncertainty_score":0.02702504,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02769404798303304,"score_gpt":0.2873221680629435,"score_spread":0.2596281200799104,"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."}}