{"id":"W2983727063","doi":"10.1371/journal.pone.0224307","title":"Clustering via hypergraph modularity","year":2019,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":81,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowa Agencja Wymiany Akademickiej","keywords":"Hypergraph; Modularity (biology); Cluster analysis; Computer science; Theoretical computer science; Clustering coefficient; Heuristic; Function (biology); Simple (philosophy); Graph; Graph theory; Algorithm; Mathematics; Combinatorics; Artificial intelligence","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001618855,0.0006809747,0.0007090414,0.00357807,0.0008872641,0.00187931,0.00126768,0.001450482,0.002339004],"category_scores_gemma":[0.006137147,0.0005169748,0.0008727497,0.002187429,0.001824287,0.003932618,0.002132786,0.001136356,0.0004999276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001930352,"about_ca_system_score_gemma":0.0008450291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001666087,"about_ca_topic_score_gemma":0.001960041,"domain_scores_codex":[0.9988607,0.0004844736,0.00003884691,0.0002628123,0.0002459974,0.0001071858],"domain_scores_gemma":[0.9972501,0.001331641,0.0004215723,0.000377637,0.000440765,0.0001781932],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006359362,0.00004411189,0.002535294,0.0001870882,0.0001303123,0.000165855,0.000350017,0.2620606,0.006515319,0.6547067,0.003378933,0.06986223],"study_design_scores_gemma":[0.000009904797,0.00003055895,0.0008550036,0.00003080394,0.00003107993,0.0001725591,0.00008227485,0.6310026,0.001595907,0.3630546,0.003108069,0.00002671777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0255319,0.0003993001,0.9700275,0.0003149481,0.00002422084,0.00004944559,0.000079468,0.0002284423,0.003344804],"genre_scores_gemma":[0.6079014,0.00101289,0.3837351,0.0002806098,0.0001222661,0.0002797866,0.0003348084,0.0002489663,0.006084239],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00357807,"threshold_uncertainty_score":0.01400578,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02184420045059696,"score_gpt":0.2148025363617362,"score_spread":0.1929583359111392,"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."}}