{"id":"W2077382842","doi":"10.1007/s11590-013-0621-x","title":"A locally optimal hierarchical divisive heuristic for bipartite modularity maximization","year":2013,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Bipartite graph; Heuristic; Modularity (biology); Mathematics; Combinatorics; Maximization; Hierarchical clustering; Partition (number theory); Cluster analysis; Theoretical computer science; Computer science; Graph; Mathematical optimization; Statistics","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009900757,0.0001777938,0.0002102533,0.0001128691,0.0001755853,0.0001739955,0.0001758252,0.00003912908,0.000982434],"category_scores_gemma":[0.00001861875,0.0001823783,0.0001422723,0.0002654709,0.00006673807,0.0002728987,0.00006124392,0.0001131473,0.00002683411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003376734,"about_ca_system_score_gemma":0.00001915209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007874285,"about_ca_topic_score_gemma":8.148852e-7,"domain_scores_codex":[0.9988544,0.00006236179,0.0003080199,0.0003261246,0.0001594086,0.0002897056],"domain_scores_gemma":[0.9992453,0.00008551021,0.00013947,0.0002574739,0.0001786199,0.00009360701],"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.00001039029,0.00006461961,0.002734651,0.0000062697,0.00006246234,2.479512e-7,0.00005648236,0.9808543,0.0003056899,0.003316537,0.009189495,0.003398868],"study_design_scores_gemma":[0.0003425922,0.00002830896,0.0006081867,0.00001208668,0.00004857238,3.03444e-7,0.00001316297,0.9964663,0.0002081387,0.001455185,0.0006036331,0.000213578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01771396,0.000005668547,0.9788524,0.002257572,0.000050214,0.0006698633,0.00001815513,0.0001166198,0.0003155462],"genre_scores_gemma":[0.7037154,0.000001616018,0.294266,0.0007312426,0.0002613324,0.0003709048,0.0005103049,0.00003298802,0.0001102021],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6860015,"threshold_uncertainty_score":0.9999308,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007227211670618004,"score_gpt":0.2288604314752646,"score_spread":0.2216332198046465,"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."}}