{"id":"W1983506100","doi":"10.1145/568574.568581","title":"Exploiting succinct constraints using FP-trees","year":2002,"lang":"en","type":"article","venue":"ACM SIGKDD Explorations Newsletter","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Pruning; Focus (optics); Succinctness; Set (abstract data type); Constraint (computer-aided design); Tree (set theory); Data mining; Search tree; Theoretical computer science; Algorithm; Search algorithm; Programming language; Mathematics","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001622011,0.0002107489,0.0001793139,0.0001721231,0.0005220603,0.0005072649,0.001364399,0.00006757799,0.0003183651],"category_scores_gemma":[0.0001679623,0.0002119119,0.00007756783,0.000653903,0.0001254407,0.002028766,0.000453727,0.0001911681,0.0008853036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004921568,"about_ca_system_score_gemma":0.00002651149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003029323,"about_ca_topic_score_gemma":0.00001164897,"domain_scores_codex":[0.9983338,0.00006214681,0.0003820605,0.0005448626,0.0002730034,0.0004041172],"domain_scores_gemma":[0.9978729,0.0002036635,0.0001311268,0.001567461,0.00009758143,0.0001272803],"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.000002548039,0.0006549568,0.002313134,0.00002598022,0.0001555339,0.0001347888,0.01042992,0.001513744,0.05311049,0.0605361,0.284113,0.5870098],"study_design_scores_gemma":[0.001302465,0.0001173687,0.00107487,0.0001351538,0.00006768561,0.0002432443,0.001198638,0.8644307,0.01012638,0.00726872,0.1123828,0.00165192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03246481,0.00007545909,0.9444664,0.02026837,0.000286302,0.0002432002,0.00002710666,0.0004313502,0.001737037],"genre_scores_gemma":[0.4756786,0.00002079952,0.5189343,0.004430177,0.0004357209,0.00012621,0.00003822991,0.00002941601,0.0003064811],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8629169,"threshold_uncertainty_score":0.9998927,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1028758920195478,"score_gpt":0.27695920445099,"score_spread":0.1740833124314422,"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."}}