{"id":"W1588921741","doi":"10.1007/978-3-642-37453-1_2","title":"PUF-Tree: A Compact Tree Structure for Frequent Pattern Mining of Uncertain Data","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Tree (set theory); Computer science; Data mining; Tree structure; Uncertain data; K-ary tree; Algorithm; Mathematics; Binary tree","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.001354448,0.0006621071,0.001309837,0.002831238,0.0007792064,0.001570813,0.001719761,0.001056265,0.00530022],"category_scores_gemma":[0.0109586,0.0005336254,0.001034104,0.005088409,0.0003795142,0.003778953,0.001432586,0.001165284,0.002385558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003915648,"about_ca_system_score_gemma":0.001367999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001363308,"about_ca_topic_score_gemma":0.002278148,"domain_scores_codex":[0.9991046,0.0001600735,0.0001393034,0.0001518783,0.0003928658,0.00005118503],"domain_scores_gemma":[0.9967796,0.001610283,0.0003113512,0.0005626605,0.0005892414,0.0001468639],"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.0008031389,0.0001828793,0.004160464,0.00140193,0.0002129661,0.0008130874,0.0005361533,0.02888991,0.009929457,0.03112645,0.05994149,0.862002],"study_design_scores_gemma":[0.0002536836,0.0004682561,0.002555156,0.0003992313,0.0002377485,0.002525632,0.0003297834,0.6675365,0.01046732,0.2111973,0.1039064,0.0001230009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01330365,0.001550391,0.9644827,0.0004028047,0.000167372,0.0002472277,0.009932318,0.008544936,0.001368513],"genre_scores_gemma":[0.07486285,0.001323905,0.9061422,0.0001712303,0.000134087,0.0003655648,0.01470696,0.0005786821,0.001714372],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00530022,"threshold_uncertainty_score":0.01773101,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04921570632610776,"score_gpt":0.2919843086638553,"score_spread":0.2427686023377476,"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."}}