{"id":"W2951813287","doi":"10.1016/j.ipm.2019.102054","title":"Compact group discovery in attributed graphs and social networks","year":2019,"lang":"en","type":"article","venue":"Information Processing & Management","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":42,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ontario Institute of Technology; Toronto Metropolitan University; University of Waterloo","funders":"","keywords":"Computer science; Task (project management); Node (physics); Set (abstract data type); Theoretical computer science; Group (periodic table); Time complexity; Combinatorics; Mathematics; Algorithm","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":[],"consensus_categories":[],"category_scores_codex":[0.0002082543,0.000114766,0.0001624131,0.0001880405,0.00009897684,0.0003365809,0.000105916,0.00002194201,0.00004309722],"category_scores_gemma":[2.860545e-7,0.0001118932,0.0000441419,0.0003485032,0.00002175695,0.001621861,0.00008210625,0.0001017449,0.00001112582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003215301,"about_ca_system_score_gemma":0.000005212124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005465416,"about_ca_topic_score_gemma":0.000004053134,"domain_scores_codex":[0.9992471,0.00001843237,0.0003021536,0.0001047263,0.0001405519,0.000187082],"domain_scores_gemma":[0.9996836,0.000009672707,0.0001679637,0.00009537143,0.00002596459,0.00001741574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00004404172,0.0001095272,0.1816524,0.0002475108,0.0001383555,5.974378e-7,0.001034443,0.006607389,0.000004885414,0.1589056,0.003391856,0.6478634],"study_design_scores_gemma":[0.002463958,0.00004981245,0.5546449,0.0003056269,0.000126014,6.257854e-7,0.002964316,0.3601961,0.00002250611,0.03771114,0.04069258,0.0008224116],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6324314,0.00007683792,0.3221322,0.0003317568,0.0001004642,0.0009428257,0.00001079326,0.0002467575,0.04372698],"genre_scores_gemma":[0.9991485,0.000003686604,0.0003528534,0.0001369174,0.00001923448,0.00001737988,0.0002176669,0.000005362975,0.00009835606],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.647041,"threshold_uncertainty_score":0.4562874,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006334680114128278,"score_gpt":0.2343614577232908,"score_spread":0.2280267776091625,"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."}}