{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001690694,0.0002153172,0.0004450074,0.0002719146,0.0001250637,0.0005258284,0.001441144,0.00009104287,0.000001687732],"category_scores_gemma":[0.0001666468,0.0001744664,0.0001858064,0.0004567666,0.00003751362,0.0006492297,0.0001593351,0.0001919762,0.00005207603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002128317,"about_ca_system_score_gemma":0.0003120672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006629831,"about_ca_topic_score_gemma":0.000002252499,"domain_scores_codex":[0.9975095,0.00008128479,0.001082116,0.0003033857,0.0006521271,0.0003715355],"domain_scores_gemma":[0.9967509,0.0002003708,0.0008662182,0.0005427824,0.001197818,0.0004419352],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001376418,0.0004050666,0.0003012707,0.00007924578,0.0002809228,0.00008928209,0.004507276,0.001747642,0.0002596954,0.01732725,0.1032716,0.871717],"study_design_scores_gemma":[0.001972871,0.002137165,0.0001457777,0.001105833,0.0001283395,0.003434487,0.009092502,0.4865568,0.002647427,0.003646336,0.4880719,0.001060591],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002315634,0.001781827,0.9905348,0.0005433402,0.003201523,0.0003627116,0.00005224902,0.00005465734,0.001153239],"genre_scores_gemma":[0.09106833,0.0001488394,0.9039839,0.0002734335,0.002919223,0.0001105909,0.00003067237,0.00006343898,0.001401571],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8706564,"threshold_uncertainty_score":0.7114534,"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."}}