{"id":"W960842831","doi":"10.1007/978-3-319-10160-6_11","title":"BLIMP: A Compact Tree Structure for Uncertain Frequent Pattern Mining","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Compact space; Tree (set theory); Computer science; Tree structure; Data structure; Data mining; Upper and lower bounds; Algorithm; Mathematics; Binary tree; Combinatorics","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.001479908,0.0008554306,0.001214578,0.0030042,0.0008391016,0.002231103,0.002129642,0.001272861,0.007842291],"category_scores_gemma":[0.01089982,0.0007776645,0.00112139,0.004704691,0.0003915616,0.003829876,0.002065869,0.001791337,0.005036274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004196737,"about_ca_system_score_gemma":0.001118994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001276669,"about_ca_topic_score_gemma":0.001925222,"domain_scores_codex":[0.9989333,0.0001680061,0.0001527316,0.0001711306,0.000514542,0.00006029697],"domain_scores_gemma":[0.996651,0.001519026,0.0003052868,0.0006800734,0.0006685817,0.0001760587],"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.001121224,0.0002734069,0.00268231,0.001143114,0.0001726463,0.000640022,0.000382941,0.02405362,0.01303994,0.02201053,0.07348588,0.8609943],"study_design_scores_gemma":[0.0003044758,0.0004111951,0.001693024,0.0003134647,0.0001704216,0.001388645,0.0002261516,0.7470873,0.0129508,0.149905,0.08544158,0.0001079859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00739442,0.0009561953,0.9656154,0.0003421562,0.0001375381,0.0002268215,0.008577473,0.01519379,0.001556227],"genre_scores_gemma":[0.05394679,0.0007072275,0.9241646,0.0002268836,0.0001324178,0.0003907428,0.01740388,0.0009164361,0.002111065],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007842291,"threshold_uncertainty_score":0.0262351,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02609949428988451,"score_gpt":0.2715890096923017,"score_spread":0.2454895154024172,"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."}}