{"id":"W1994599362","doi":"10.1016/j.ipl.2013.07.016","title":"P2P-FISM: Mining (recently) frequent item sets from distributed data streams over P2P network","year":2013,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Asynchronous communication; Distributed computing; Data stream mining; Overhead (engineering); File sharing; Data stream; Distributed database; Computer network; Network topology; Peer-to-peer; Data mining; Database; The Internet; World Wide Web","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.001399714,0.001361534,0.001291867,0.003157356,0.0009910502,0.001360912,0.002386088,0.001187527,0.002355558],"category_scores_gemma":[0.006426327,0.0004957913,0.0007356107,0.003945079,0.0004736847,0.002164984,0.001283776,0.001021637,0.001154756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004298483,"about_ca_system_score_gemma":0.001053551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003929589,"about_ca_topic_score_gemma":0.00451039,"domain_scores_codex":[0.9992782,0.0001078522,0.00007221284,0.0002045397,0.0002742819,0.00006285141],"domain_scores_gemma":[0.9977819,0.001158216,0.0001391336,0.000478859,0.0003506402,0.00009122211],"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.001650891,0.0003981417,0.01799147,0.0006668127,0.000431484,0.001583962,0.0002620409,0.07076203,0.01451611,0.005931465,0.02879498,0.8570105],"study_design_scores_gemma":[0.00007246486,0.0001047216,0.001885513,0.00001798182,0.00005278053,0.0005582116,0.0000935546,0.9724765,0.006790015,0.0136408,0.004288944,0.00001853117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06105518,0.001115693,0.91289,0.0007149157,0.0002908327,0.0005445084,0.004134221,0.01736344,0.00189123],"genre_scores_gemma":[0.3287144,0.0004837688,0.6625767,0.0002000871,0.0002120384,0.0004039531,0.005127199,0.000246208,0.002035794],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003929589,"threshold_uncertainty_score":0.007880092,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02056811636621254,"score_gpt":0.2455440367126644,"score_spread":0.2249759203464519,"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."}}