{"id":"W2105347536","doi":"10.1109/icdm.2006.62","title":"DSTree: A Tree Structure for the Mining of Frequent Sets from Data Streams","year":2006,"lang":"en","type":"article","venue":"Proceedings","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":165,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Data stream mining; Computer science; STREAMS; Data mining; Tree (set theory); Flood myth; Data stream; Tree structure; Data structure; Computer network; 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.0001195992,0.00009825675,0.0001100055,0.00002650511,0.000124142,0.0001628495,0.001970128,0.00003742129,0.000005192855],"category_scores_gemma":[0.00004136396,0.00006861955,0.00002521344,0.0002094951,0.00004308062,0.0004269842,0.0004195703,0.00005949001,0.000001283864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001070911,"about_ca_system_score_gemma":0.00003062923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004533856,"about_ca_topic_score_gemma":0.00006692428,"domain_scores_codex":[0.9990915,0.000001548484,0.0001899941,0.0003833624,0.0001703289,0.000163245],"domain_scores_gemma":[0.999095,0.0001166786,0.0001443305,0.0005229378,0.0000927427,0.0000283205],"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.00000505573,0.00007250151,0.002841814,0.0000306135,0.00004839216,4.299276e-7,0.000946856,0.000009957803,0.009650298,0.03655718,0.0752696,0.8745673],"study_design_scores_gemma":[0.0007921148,0.0000878819,0.0196215,0.00008814884,0.00009546349,0.000009952766,0.0006619014,0.8553546,0.01951103,0.03311687,0.07027428,0.0003862806],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4838086,0.001035301,0.496957,0.007087819,0.0004393926,0.001206832,0.006506623,0.0003570286,0.002601437],"genre_scores_gemma":[0.5953814,0.00000553923,0.4039893,0.00006690396,0.0001908134,0.00003614688,0.0002620738,0.000009360727,0.00005839984],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.874181,"threshold_uncertainty_score":0.3661021,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03155954862587509,"score_gpt":0.269129729241148,"score_spread":0.2375701806152729,"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."}}