{"id":"W2424687972","doi":"10.1007/s41060-016-0012-3","title":"Exact and approximate Boolean matrix decomposition with column-use condition","year":2016,"lang":"en","type":"article","venue":"International Journal of Data Science and Analytics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Univerzita Palackého v Olomouci","keywords":"Logical matrix; Matrix (chemical analysis); Complete Boolean algebra; Boolean function; Mathematics; Combinatorics; Discrete mathematics; Column (typography); Heuristic; Ideal (ethics); Maximum satisfiability problem; Heuristics; Boolean circuit; Algorithm; Two-element Boolean algebra; Algebra over a field; Pure mathematics; Mathematical optimization; Physics; Quantum mechanics","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.0008743068,0.00006800986,0.00009408638,0.0002348026,0.0001089638,0.0006498958,0.001087561,0.00001488606,0.000004243842],"category_scores_gemma":[0.0001487222,0.00004040332,0.00001145659,0.0001872847,0.0002501267,0.004932373,0.0003365715,0.00008136428,0.000001402775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003605966,"about_ca_system_score_gemma":0.0001302665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001133421,"about_ca_topic_score_gemma":0.000003424805,"domain_scores_codex":[0.9987486,0.00002213327,0.0001984017,0.0002166675,0.0006981124,0.0001161137],"domain_scores_gemma":[0.9988134,0.0001020894,0.0002452579,0.000213292,0.0005157458,0.0001102047],"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.0002018958,0.0003803363,0.09349795,0.00003503725,0.0003583928,0.0006943867,0.0007502618,0.000569386,0.03075271,0.07222739,0.003654578,0.7968777],"study_design_scores_gemma":[0.002998012,0.0008974992,0.06576397,0.0006960465,0.00007949986,0.004500992,0.0001620906,0.903047,0.002194612,0.005156609,0.01399702,0.0005067137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2535025,0.00005372925,0.7414649,0.004621658,0.0001994554,0.00003349662,0.00003615284,0.00001428401,0.00007384675],"genre_scores_gemma":[0.9567117,0.0002288848,0.04271202,0.0001617384,0.0001097059,1.8112e-7,0.000004099356,0.00000287484,0.00006878142],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9024776,"threshold_uncertainty_score":0.626696,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02182951033062821,"score_gpt":0.3398350894567677,"score_spread":0.3180055791261395,"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."}}