{"id":"W4206612087","doi":"10.1109/ickg52313.2021.00042","title":"UFreS: A New Technique for Discovering Frequent Subgraph Patterns in Uncertain Graph Databases","year":2021,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Subgraph isomorphism problem; Scalability; Graph database; Data mining; Graph; Embedding; Theoretical computer science; Database; Artificial intelligence","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002086458,0.0001320864,0.0001398449,0.0001831763,0.0000481391,0.0002431743,0.0007182125,0.00001994938,0.00003852527],"category_scores_gemma":[0.00003373866,0.0001188186,0.00007305325,0.0005923063,0.00001232935,0.001126258,0.0005704464,0.00006835849,0.000003983755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002414601,"about_ca_system_score_gemma":0.00007026789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001806642,"about_ca_topic_score_gemma":0.002589205,"domain_scores_codex":[0.9988112,0.00002648196,0.0002064025,0.0004888542,0.0001663599,0.0003006743],"domain_scores_gemma":[0.999082,0.00007018066,0.00003900028,0.0007159911,0.00002274288,0.00007013438],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000133072,0.0004633079,0.03213874,0.0003352368,0.00009375335,0.0005652775,0.0004894655,0.0001917653,0.01124047,0.8381176,0.02294271,0.09340834],"study_design_scores_gemma":[0.00852986,0.0006250159,0.03289166,0.00219564,0.000104174,0.0001136319,0.002725442,0.1124138,0.3594228,0.2197055,0.2562069,0.005065489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009677069,0.00009081809,0.9967464,0.0009919214,0.0001682073,0.0003567699,0.00006370329,0.0001062093,0.0005083115],"genre_scores_gemma":[0.0591671,0.0002726521,0.9358016,0.001249764,0.000129233,0.0003102165,0.0004275754,0.00002342736,0.00261838],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6184121,"threshold_uncertainty_score":0.4845282,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04361974597459232,"score_gpt":0.2913923747721751,"score_spread":0.2477726287975828,"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."}}