{"id":"W2784105835","doi":"10.1109/tkde.2018.2793862","title":"A Two-Phase Algorithm for Differentially Private Frequent Subgraph Mining","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"ca_institutions":"International Development Research Centre","funders":"National Institutes of Health; National Institute of General Medical Sciences; National Natural Science Foundation of China; Deutsche Forschungsgemeinschaft; Patient-Centered Outcomes Research Institute","keywords":"Computer science; Differential privacy; Support vector machine; Pruning; Data mining; Graph; Algorithm; Theoretical computer science; Artificial intelligence","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.003269779,0.0008524488,0.001247405,0.001851451,0.001073364,0.001320412,0.002848475,0.001699951,0.002063695],"category_scores_gemma":[0.01620085,0.0005010224,0.001332848,0.002488927,0.001077179,0.003017615,0.003480574,0.001796874,0.0008521017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001181078,"about_ca_system_score_gemma":0.002647064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001127965,"about_ca_topic_score_gemma":0.001810236,"domain_scores_codex":[0.9957729,0.00124019,0.0003662546,0.0008457169,0.001479618,0.0002953327],"domain_scores_gemma":[0.9925324,0.003733408,0.0005848359,0.002194907,0.0007310361,0.0002233555],"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.001445448,0.0006717845,0.007160991,0.0003412129,0.0002203856,0.00056239,0.0005608528,0.171405,0.02063222,0.08366254,0.009716583,0.7036205],"study_design_scores_gemma":[0.0001853651,0.0001572963,0.0004748497,0.00001710918,0.00003319716,0.0004988054,0.00007734701,0.8968024,0.006621017,0.09195329,0.003154266,0.00002498137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01308808,0.0001001363,0.9848108,0.0003250996,0.00002741295,0.0002100559,0.0002462114,0.0007317441,0.0004605068],"genre_scores_gemma":[0.2472074,0.0001207621,0.7490875,0.0002619501,0.00006693995,0.0006055863,0.001336623,0.0001147459,0.001198613],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003269779,"threshold_uncertainty_score":0.01729244,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03871756589284604,"score_gpt":0.3077567980364951,"score_spread":0.2690392321436491,"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."}}