{"id":"W2513061279","doi":"10.1007/s10115-016-0986-0","title":"EFIM: a fast and memory efficient algorithm for high-utility itemset mining","year":2016,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":239,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Moncton","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Computer science; Key (lock); Data mining; Projection (relational algebra); Database transaction; Task (project management); Tree (set theory); Algorithm; High memory; Database; Mathematics; Parallel computing","routes":{"ca_aff":true,"ca_fund":true,"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.002128504,0.001848496,0.002000174,0.005484755,0.001302347,0.001932655,0.004423071,0.001950544,0.008165998],"category_scores_gemma":[0.01012878,0.0009413406,0.001424512,0.007221487,0.0004804058,0.003943192,0.002838069,0.001691584,0.004507513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007999422,"about_ca_system_score_gemma":0.002295863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003248723,"about_ca_topic_score_gemma":0.005698227,"domain_scores_codex":[0.9985874,0.0002644389,0.0002229209,0.0002816058,0.0004789818,0.0001646483],"domain_scores_gemma":[0.9972329,0.001373022,0.0001545134,0.0005448204,0.0005814935,0.0001133296],"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.0008522374,0.0003128728,0.002929007,0.0004685944,0.0001886996,0.0002351143,0.0001192448,0.01661964,0.003935123,0.004598603,0.03019193,0.939549],"study_design_scores_gemma":[0.0004705612,0.0004178163,0.002324692,0.0002041119,0.0001981563,0.001326218,0.0002057489,0.893647,0.01904894,0.04372665,0.03832556,0.0001045901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01899075,0.001886892,0.9525266,0.0004182133,0.0002427152,0.0004443645,0.003413398,0.01990284,0.002174239],"genre_scores_gemma":[0.04341999,0.0003351131,0.948034,0.0001868907,0.00007432727,0.000337082,0.004750748,0.0004298192,0.002431891],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008165998,"threshold_uncertainty_score":0.02731794,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01286533636610831,"score_gpt":0.2381222319819108,"score_spread":0.2252568956158025,"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."}}