{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004690676,0.001673721,0.001810835,0.004312415,0.001274286,0.002801389,0.002469158,0.001675728,0.002337971],"category_scores_gemma":[0.03180594,0.0009439907,0.001597816,0.005396755,0.00101359,0.006794352,0.002222359,0.001891945,0.001008427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008563449,"about_ca_system_score_gemma":0.002400971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00357419,"about_ca_topic_score_gemma":0.003539474,"domain_scores_codex":[0.9940457,0.001790674,0.0007010201,0.0006920156,0.002479104,0.000291416],"domain_scores_gemma":[0.9775859,0.01651764,0.00151171,0.001782625,0.002368566,0.0002334471],"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.000500514,0.0002163918,0.005002375,0.0007267724,0.0002196055,0.001230601,0.0004723508,0.1828321,0.006213338,0.07130087,0.009889776,0.7213953],"study_design_scores_gemma":[0.00007073287,0.00009748056,0.0003325344,0.0001270546,0.00006486352,0.0007152213,0.0001077212,0.8250488,0.007830206,0.1574425,0.008111482,0.00005131341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00737023,0.0003073197,0.989903,0.0002476,0.00002936311,0.0001333499,0.0003866487,0.0008555032,0.0007670429],"genre_scores_gemma":[0.08521721,0.0004970855,0.9115506,0.0001632062,0.00005934118,0.0002926781,0.001543693,0.0001285799,0.0005476437],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004690676,"threshold_uncertainty_score":0.02480698,"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."}}