{"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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0002492009,0.0002252525,0.0001986629,0.0002987168,0.0002171137,0.0001556014,0.00818061,0.0000884539,0.000007188075],"category_scores_gemma":[0.0001914781,0.0002257582,0.00004554562,0.0003925131,0.00007264027,0.0008154448,0.0009905339,0.0001873602,0.00001301686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003410969,"about_ca_system_score_gemma":0.00003212218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008176911,"about_ca_topic_score_gemma":0.00002483343,"domain_scores_codex":[0.9985452,0.00001556281,0.0002431565,0.0006957363,0.0001214101,0.0003789458],"domain_scores_gemma":[0.9945644,0.0001823002,0.00004222077,0.005043653,0.00006342562,0.0001039912],"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.00001303029,0.0003007593,0.000002881402,0.00006889689,0.000125542,0.000007198671,0.0001689998,0.00005493711,0.007956475,0.000580879,0.004846689,0.9858737],"study_design_scores_gemma":[0.001111142,0.0002189561,0.00000949943,0.00008308337,0.0000289864,0.00001495402,0.000007035458,0.9548575,0.03768294,0.000889477,0.004825789,0.0002705946],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005779073,0.0002101764,0.9910123,0.0002726426,0.001195009,0.0002459557,0.0004753407,0.0007758553,0.00003365443],"genre_scores_gemma":[0.2262995,0.00008532456,0.7733049,0.00002132545,0.0001311449,0.00006498567,0.00004678761,0.0000273368,0.00001868841],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9856031,"threshold_uncertainty_score":0.9971856,"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."}}