{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002538986,0.001597223,0.00169866,0.001261105,0.0007338033,0.002625351,0.002157614,0.001858851,0.01579617],"category_scores_gemma":[0.02318051,0.0005783684,0.0009562703,0.0025172,0.001683436,0.006111455,0.00226952,0.003063312,0.002663711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001055806,"about_ca_system_score_gemma":0.002256014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002294174,"about_ca_topic_score_gemma":0.003499045,"domain_scores_codex":[0.9964826,0.0009446124,0.000160861,0.000504926,0.001504949,0.0004020882],"domain_scores_gemma":[0.9887521,0.006687867,0.0004695854,0.002197545,0.001575943,0.0003170675],"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.001260174,0.0004798182,0.001848008,0.0007733736,0.0001534656,0.0003720651,0.0001925129,0.2510021,0.008509047,0.4042142,0.04309357,0.2881018],"study_design_scores_gemma":[0.00004538038,0.00004865926,0.0001956847,0.00002655411,0.00001832648,0.00009983946,0.00003838369,0.758113,0.001765778,0.2381386,0.001490935,0.00001869677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01489283,0.0004413405,0.9763488,0.0007438933,0.000203872,0.00007578255,0.0006013102,0.0007364923,0.005955819],"genre_scores_gemma":[0.4336431,0.0007506523,0.5518216,0.0006629502,0.0005763057,0.0003436651,0.00235666,0.0004603017,0.009384796],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01579617,"threshold_uncertainty_score":0.05284339,"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."}}