{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001928315,0.0008666777,0.001089445,0.02027624,0.001081947,0.001485412,0.001475757,0.001067281,0.002917694],"category_scores_gemma":[0.01397889,0.0004406596,0.001936678,0.01553471,0.0006201303,0.003382256,0.001875613,0.0006020287,0.001404184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008071063,"about_ca_system_score_gemma":0.002470094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003570994,"about_ca_topic_score_gemma":0.007569564,"domain_scores_codex":[0.9975999,0.0005913055,0.0004400842,0.0006350658,0.0006305415,0.0001030701],"domain_scores_gemma":[0.9937499,0.003741361,0.0008642987,0.0007525758,0.0007629261,0.0001290032],"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.0004691332,0.0003100488,0.01477593,0.004826519,0.0008233372,0.002727797,0.001391635,0.0330655,0.04839749,0.02998382,0.02177407,0.8414547],"study_design_scores_gemma":[0.0002336893,0.0004230432,0.02442151,0.0007236454,0.001428156,0.007394872,0.001801379,0.5399427,0.05538285,0.2578472,0.1102143,0.0001864315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06786042,0.006179886,0.894072,0.001390268,0.0001401441,0.0009647954,0.01582321,0.008659272,0.004910041],"genre_scores_gemma":[0.1695218,0.002659732,0.7973913,0.0002179062,0.0001279632,0.0004428417,0.0279888,0.0002354546,0.001414192],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02027624,"threshold_uncertainty_score":0.010198,"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."}}