{"id":"W1956439169","doi":"10.3233/ifs-151936","title":"A fast Algorithm for mining fuzzy frequent itemsets","year":2015,"lang":"en","type":"article","venue":"Journal of Intelligent & Fuzzy Systems","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Moncton","funders":"Harbin Institute of Technology; National Natural Science Foundation of China; Tencent","keywords":"Tree traversal; Data mining; Computer science; Pruning; Apriori algorithm; Fuzzy logic; Set (abstract data type); Process (computing); Tree (set theory); Fuzzy set; A priori and a posteriori; Algorithm; Association rule learning; Artificial intelligence; 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.002263306,0.001177123,0.001755258,0.004794634,0.001376615,0.001366215,0.001952222,0.001412474,0.003406505],"category_scores_gemma":[0.007413309,0.0007303342,0.001410506,0.004789702,0.0003737241,0.002417078,0.001021891,0.001269204,0.00255091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005370268,"about_ca_system_score_gemma":0.001486136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001329837,"about_ca_topic_score_gemma":0.001646779,"domain_scores_codex":[0.9981007,0.0003255267,0.0002582991,0.0003965833,0.0008099984,0.0001088912],"domain_scores_gemma":[0.9971231,0.001529625,0.0002107803,0.0002365949,0.0008443838,0.00005549687],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003287565,0.0001622874,0.00224502,0.0006624908,0.0002041307,0.0004151673,0.0001765777,0.03142557,0.008981599,0.01298623,0.009873156,0.9325391],"study_design_scores_gemma":[0.0002409683,0.0005051471,0.002227933,0.0002486307,0.0001747236,0.003185675,0.0002396795,0.8742188,0.01885337,0.05048047,0.04948248,0.0001420435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004120123,0.0006914946,0.9923907,0.00010409,0.00008697255,0.0002324396,0.0005254403,0.00112319,0.0007255683],"genre_scores_gemma":[0.02421118,0.0004287346,0.9727916,0.00006482771,0.00004219361,0.0003180596,0.001221627,0.00004585519,0.0008760205],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004794634,"threshold_uncertainty_score":0.01196969,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05610564189806256,"score_gpt":0.2997849752522972,"score_spread":0.2436793333542346,"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."}}