{"id":"W2948135333","doi":"10.1080/03155986.2019.1607715","title":"The maximum feasible subset problem (maxFS) and applications","year":2019,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cardinality (data modeling); Hyperplane; Mathematical optimization; Heuristic; Reduction (mathematics); Dimension (graph theory); Computer science; Range (aeronautics); Linear programming; Set (abstract data type); Mathematics; Matrix (chemical analysis); Algorithm; Combinatorics; Data mining","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":true,"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.0006465031,0.0000713705,0.00007551329,0.0001178908,0.0003652463,0.0007386016,0.0001016199,0.00005675059,0.000007074817],"category_scores_gemma":[0.0000157122,0.00005083775,0.00001128412,0.0001625466,0.00005703974,0.0008022105,0.00005336693,0.0001612393,0.0001372385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000326086,"about_ca_system_score_gemma":0.00004240367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006758629,"about_ca_topic_score_gemma":0.000008372651,"domain_scores_codex":[0.9991355,0.00002319415,0.0002517688,0.00006000927,0.0003551091,0.000174398],"domain_scores_gemma":[0.999282,0.0001394466,0.00002281845,0.0001600207,0.0003411831,0.00005453269],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003701671,0.00001064855,0.003989119,0.0004013184,0.00007671538,4.754961e-7,0.001264255,0.0159216,0.001069048,0.8670596,0.03647928,0.07369091],"study_design_scores_gemma":[0.00019806,0.00003376259,0.001325765,0.00004768346,0.000001398911,0.00002397634,0.001,0.08838241,0.0003373065,0.0009861578,0.9075545,0.0001089941],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2851464,0.005549462,0.03575986,0.001527473,0.0006938459,0.01115083,0.000175782,0.001128852,0.6588675],"genre_scores_gemma":[0.9983218,0.000415873,0.0002662007,0.00004194148,0.00006548931,0.0003370331,0.00004221811,0.000007019609,0.0005023894],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8710752,"threshold_uncertainty_score":0.7122352,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03147316578705273,"score_gpt":0.2982395335485961,"score_spread":0.2667663677615434,"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."}}