{"id":"W2064299012","doi":"10.1371/journal.pone.0060954","title":"Approximate Subgraph Matching-Based Literature Mining for Biomedical Events and Relations","year":2013,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":61,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"U.S. National Library of Medicine; National Institutes of Health","keywords":"Biomedical text mining; Computer science; Subgraph isomorphism problem; Generalizability theory; Matching (statistics); Induced subgraph isomorphism problem; Data mining; Sentence; Relationship extraction; Graph; Information extraction; Natural language processing; Artificial intelligence; Machine learning; Theoretical computer science; Text mining; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0001074061,0.0001020252,0.0001287064,0.00004948636,0.0000903903,0.0000281185,0.00008982926,0.0002183613,0.00001898649],"category_scores_gemma":[0.000195765,0.00008459274,0.0000430526,0.00008198196,0.0001051951,0.000003229635,0.00004010837,0.00007721372,0.000005172267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003708563,"about_ca_system_score_gemma":0.00002355332,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004155435,"about_ca_topic_score_gemma":0.000002045836,"domain_scores_codex":[0.9992903,0.00002528929,0.000138281,0.0002356527,0.000117561,0.0001928965],"domain_scores_gemma":[0.9995915,0.00004637363,0.00004516795,0.0001516125,0.00006272578,0.0001025909],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001523863,0.001953138,0.02116472,0.0006984261,0.0005795896,0.000003658798,0.000725615,0.000003094754,0.9457086,0.0002077191,0.01204329,0.01675977],"study_design_scores_gemma":[0.03156541,0.01483389,0.1765395,0.00836676,0.002036765,0.00008038541,0.003149206,0.05214505,0.5838327,0.04974089,0.07099149,0.006717884],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9903294,0.0009843375,0.006565211,0.001661196,0.00003506228,0.0002626519,0.00004226664,0.00003459348,0.00008526307],"genre_scores_gemma":[0.9172603,0.00004453983,0.0810859,0.0003541886,0.000129532,0.0001594966,0.0004008911,0.00001643172,0.0005486725],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3618758,"threshold_uncertainty_score":0.3449592,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02248726278944564,"score_gpt":0.2393199723019218,"score_spread":0.2168327095124761,"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."}}