{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002925122,0.0002692074,0.0003390868,0.0001224547,0.0002295387,0.0004621984,0.004135235,0.0001924309,0.00007148761],"category_scores_gemma":[0.00008288825,0.0002637233,0.00006383016,0.0009936373,0.0000937297,0.001292118,0.00386805,0.0003445136,0.0001553598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001237278,"about_ca_system_score_gemma":0.00008397351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004336771,"about_ca_topic_score_gemma":0.0005144483,"domain_scores_codex":[0.9975498,0.00007781452,0.0004078745,0.0008117872,0.0002974861,0.0008552835],"domain_scores_gemma":[0.9984853,0.0001649954,0.0001130653,0.001124592,0.00005497087,0.0000571227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000146543,0.0001225708,0.0008540095,0.00002106333,0.00003525307,0.00003769038,0.00105004,0.0008276967,0.0004890244,0.01247544,0.8291993,0.1548733],"study_design_scores_gemma":[0.003829809,0.0004869416,0.03901431,0.0004521146,0.00003601955,0.00001722091,0.001534009,0.7670768,0.003845282,0.05337674,0.1268726,0.003458058],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1223486,0.0001761203,0.8258994,0.03982399,0.001079861,0.0008932818,0.0000242848,0.002628148,0.007126317],"genre_scores_gemma":[0.6776693,0.000004139483,0.3164072,0.005155762,0.0004941016,0.00007661474,0.00002416725,0.00002472849,0.0001439559],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7662492,"threshold_uncertainty_score":0.9999815,"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."}}