{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006698658,0.0006260034,0.000648206,0.000619763,0.0003953337,0.0008662152,0.004476617,0.0003143935,0.00001877828],"category_scores_gemma":[0.00008600877,0.0005530082,0.0001744915,0.0004851402,0.0004508522,0.0003674708,0.0007471347,0.000556368,0.00001667993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002696906,"about_ca_system_score_gemma":0.000425414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006466718,"about_ca_topic_score_gemma":0.0002310742,"domain_scores_codex":[0.9959486,0.00002764,0.0005911398,0.001844134,0.0007783141,0.0008102193],"domain_scores_gemma":[0.9964126,0.0007514776,0.0004040135,0.001940727,0.0002458686,0.0002452859],"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.000001796531,0.00001340679,0.00003822842,0.00003574425,0.00001331663,0.00001018463,0.0004580284,0.005642786,0.0001044376,0.008105134,0.0003335777,0.9852434],"study_design_scores_gemma":[0.0004101992,0.0002395168,0.0001509341,0.0003552946,0.00001558768,0.00006399393,3.643335e-7,0.9248852,0.0005261385,0.05955269,0.01300395,0.000796108],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001021045,0.0001530563,0.9954204,0.001636488,0.001123028,0.0006071532,0.0001432923,0.0001772303,0.0006372303],"genre_scores_gemma":[0.1029432,0.00001263349,0.8925111,0.002805708,0.001088575,0.0000315737,0.000113565,0.00006799659,0.0004256566],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9844472,"threshold_uncertainty_score":0.9996921,"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."}}