{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005001924,0.00137136,0.003040561,0.002578443,0.001032122,0.002830489,0.003220357,0.002302014,0.001868757],"category_scores_gemma":[0.01425662,0.0009332364,0.002073311,0.00524364,0.002866075,0.005972993,0.002560619,0.00270591,0.000388968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001574979,"about_ca_system_score_gemma":0.001524801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001311492,"about_ca_topic_score_gemma":0.001189096,"domain_scores_codex":[0.9931511,0.003166666,0.0003710716,0.001376939,0.001664158,0.0002701696],"domain_scores_gemma":[0.9899471,0.007770709,0.0005465847,0.001036696,0.000511146,0.000187757],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002620387,0.0003381659,0.004397931,0.001656972,0.0006726508,0.0004310679,0.0005439845,0.4507422,0.003900557,0.3316664,0.01302454,0.1923636],"study_design_scores_gemma":[0.00004830108,0.0001450423,0.0006379319,0.0001296844,0.000103373,0.000448216,0.0001594872,0.593562,0.002240426,0.3937638,0.008724886,0.0000367187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01200401,0.001744324,0.9817265,0.001744345,0.00005357345,0.0001897309,0.0003656025,0.0001334141,0.002038577],"genre_scores_gemma":[0.2141156,0.002613062,0.7775961,0.0006819157,0.0005299131,0.0007113318,0.001841475,0.0001793219,0.001731365],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005001924,"threshold_uncertainty_score":0.02645296,"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."}}