{"id":"W1969972789","doi":"10.1109/tkde.2011.260","title":"The Minimum Consistent Subset Cover Problem: A Minimization View of Data Mining","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Cluster analysis; Bipartite graph; Cardinality (data modeling); Clique; Set cover problem; Set (abstract data type); Theoretical computer science; Artificial intelligence; Graph; Mathematics; Data mining; Combinatorics","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.0003277354,0.0001326815,0.0001495842,0.00009470849,0.000178149,0.00006491318,0.001463047,0.00004046924,0.00001025204],"category_scores_gemma":[0.000009032425,0.0001086259,0.00002710816,0.0003330337,0.00006494248,0.0007431464,0.00006977437,0.0001165463,0.000007420953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008238702,"about_ca_system_score_gemma":0.00004544194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001262834,"about_ca_topic_score_gemma":0.00004076039,"domain_scores_codex":[0.9990095,0.00003068845,0.0002703101,0.0003959272,0.0001140336,0.0001794755],"domain_scores_gemma":[0.9979887,0.000248473,0.00005312383,0.001593827,0.00005272108,0.00006315496],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005626401,0.0008037898,0.00004511808,0.0005826129,0.0004206418,0.00001361357,0.00601497,0.00216276,0.0006600477,0.007693601,0.004426776,0.9771198],"study_design_scores_gemma":[0.0003336086,0.0000822724,0.0001024581,0.0001629814,0.00004956932,0.00002418338,0.00005463477,0.9746625,0.001387441,0.00009619036,0.02283376,0.0002104503],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005526001,0.001145323,0.9970045,0.00004308809,0.0004467821,0.0001450289,0.0002170069,0.00007236593,0.0003732739],"genre_scores_gemma":[0.7144791,0.001618296,0.2834699,0.00003583193,0.0000616835,0.00003088891,0.00009492569,0.00002844848,0.0001808457],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9769093,"threshold_uncertainty_score":0.4429636,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08975363559799747,"score_gpt":0.27409211179744,"score_spread":0.1843384761994425,"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."}}