{"id":"W2532646564","doi":"10.1109/socialcom.2013.133","title":"Minimizing Social Data Overload through Interest-Based Stream Filtering in a P2P Social Network","year":2013,"lang":"en","type":"article","venue":"","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Filter (signal processing); Data stream; Social network (sociolinguistics); Construct (python library); Scheme (mathematics); Distributed computing; Mechanism (biology); Data stream mining; Computer network; World Wide Web; Social media; Data mining; Telecommunications","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.003742443,0.0006310621,0.0008407455,0.0009891386,0.001402136,0.001870697,0.001384135,0.0009928136,0.0006476402],"category_scores_gemma":[0.00980414,0.0002961635,0.000426472,0.0008638531,0.0007246545,0.003276836,0.001374191,0.0009461787,0.0002325194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007808261,"about_ca_system_score_gemma":0.00127549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003761111,"about_ca_topic_score_gemma":0.002698,"domain_scores_codex":[0.9980105,0.0007242208,0.0001304384,0.0003995059,0.0006123295,0.0001230567],"domain_scores_gemma":[0.9932308,0.003467359,0.0007484839,0.00137357,0.0008273114,0.0003523986],"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.002081115,0.002399603,0.03392918,0.0003715285,0.0002849673,0.00116812,0.004764428,0.1522971,0.11605,0.03798178,0.008305615,0.6403666],"study_design_scores_gemma":[0.0001572592,0.0006260832,0.006288841,0.00002254552,0.0001025711,0.0003834345,0.0005615675,0.9386492,0.02529452,0.01983964,0.008005066,0.00006926578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3385232,0.0003130203,0.6515958,0.0009008495,0.00007045838,0.0004736476,0.00009086508,0.003926562,0.004105621],"genre_scores_gemma":[0.8976358,0.0001124129,0.1003919,0.0001208657,0.0000549529,0.000104855,0.00008152062,0.0000657628,0.001431805],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003761111,"threshold_uncertainty_score":0.01979214,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.101010399379755,"score_gpt":0.3081211861390911,"score_spread":0.2071107867593361,"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."}}