{"id":"W15173781","doi":"10.1007/978-3-642-32600-4_34","title":"Mining Frequent Itemsets Using Node-Sets of a Prefix-Tree","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Trie; Data mining; Prefix; Node (physics); Set (abstract data type); Tree (set theory); Construct (python library); Database; Tree structure; Data structure; Theoretical computer science; Algorithm; Binary tree; 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.001214534,0.0008445342,0.001638605,0.007425793,0.001087287,0.002463634,0.001517308,0.00132346,0.002319466],"category_scores_gemma":[0.009684575,0.0007676431,0.002123707,0.00966258,0.0005854002,0.004049035,0.001248386,0.00104451,0.001469204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004208909,"about_ca_system_score_gemma":0.001086993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001243457,"about_ca_topic_score_gemma":0.002048211,"domain_scores_codex":[0.9982721,0.0002295118,0.0003449351,0.0003787501,0.0006739075,0.000100736],"domain_scores_gemma":[0.994194,0.003723906,0.0004194155,0.0004819784,0.0009527041,0.0002279375],"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.001235354,0.0006642346,0.05418014,0.003083808,0.0008732632,0.003644316,0.001369733,0.06523246,0.02547621,0.02970944,0.01174118,0.8027899],"study_design_scores_gemma":[0.0001657284,0.0008789176,0.01412437,0.0008632307,0.0007591238,0.006874508,0.001265955,0.8089588,0.01481698,0.1271425,0.02400641,0.0001434482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2137965,0.004093731,0.7604329,0.0005163428,0.0002422225,0.0008220301,0.01382103,0.002269574,0.004005661],"genre_scores_gemma":[0.2062504,0.001597039,0.776827,0.00009561606,0.0001095442,0.0004038271,0.01354115,0.00009912447,0.001076414],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007425793,"threshold_uncertainty_score":0.007759333,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03921261607120276,"score_gpt":0.278510211730896,"score_spread":0.2392975956596932,"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."}}