Kenneth Morton

Kenneth Morton

Auto-generated profile, based on publicly available information

Kenneth Morton

CoVar Applied Technologies, Durham, NC, United States

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 November 2019 in Journal of Chemical Information and Modeling
Verified
Journal Article
Closed access
CBChris Bizon
Chris Bizon
SCSteven Cox
Steven Cox
JBJames Balhoff
James Balhoff
YKYaphet Kebede
Yaphet Kebede
PWPatrick Wang
Patrick Wang
ATAlexander Tropsha
Alexander Tropsha

13 August 2019 in Bioinformatics
Verified
Journal Article
Open access
PDF file
KMKenneth Morton
Kenneth Morton
PWPatrick Wang
Patrick Wang
CBChris Bizon
Chris Bizon
SCSteven Cox
Steven Cox
JBJames Balhoff
James Balhoff
ATAlexander Tropsha
Alexander Tropsha
Knowledge graphs (KGs) are quickly becoming a common-place tool for storing relationships between entities from which higher-level reasoning can be conducted. KGs are typically stored in a graph-database format, and graph-database queries can be used to answer questions of interest that have been posed by users such as biomedical researchers. For simple queries, the inclusion of direct connections in the KG and the storage and analysis of query results are straightforward; however, for complex queries, these capabilities become exponentially more challenging with each increase in complexity of the query. For instance, one relatively complex query can yield a KG with hundreds of thousands of query results. Thus, the ability to efficiently query, store, rank and explore sub-graphs of a complex KG represents a major challenge to any effort designed to exploit the use of KGs for applications in biomedical research and other domains. We present Reasoning Over Biomedical Objects linked in Knowledge Oriented Pathways as an abstraction layer and user interface to more easily query KGs and store, rank and explore query results. An instance of the ROBOKOP UI for exploration of the ROBOKOP Knowledge Graph can be found at http://robokop.renci.org. The ROBOKOP Knowledge Graph can be accessed at http://robokopkg.renci.org. Code and instructions for building and deploying ROBOKOP are available under the MIT open software license from https://github.com/NCATS-Gamma/robokop. Supplementary data are available at Bioinformatics online.

20 July 2021 in JMIR Medical Informatics
Verified
Journal Article
Open access
KFKaramarie Fecho
Karamarie Fecho
CBChris Bizon
Chris Bizon
FMFrederick Miller
Frederick Miller
SSShepherd Schurman
Shepherd Schurman
CSCharles Schmitt
Charles Schmitt
ATAlexander Tropsha
Alexander Tropsha
Background: Knowledge graphs are a common form of knowledge representation in biomedicine and many other fields. We developed an open biomedical knowledge graph–based system termed Reasoning Over Biomedical Objects linked in Knowledge Oriented Pathways (ROBOKOP). ROBOKOP consists of both a front-end user interface and a back-end knowledge graph. The ROBOKOP user interface allows users to posit questions and explore answer subgraphs. Users can also posit questions through direct Cypher query of the underlying knowledge graph, which currently contains roughly 6 million nodes or biomedical entities and 140 million edges or predicates describing the relationship between nodes, drawn from over 30 curated data sources. Objective: We aimed to apply ROBOKOP to survey data on workplace exposures and immune-mediated diseases from the Environmental Polymorphisms Registry (EPR) within the National Institute of Environmental Health Sciences. Methods: We analyzed EPR survey data and identified 45 associations between workplace chemical exposures and immune-mediated diseases, as self-reported by study participants (n= 4574), with 20 associations significant at P<.05 after false discovery rate correction. We then used ROBOKOP to (1) validate the associations by determining whether plausible connections exist within the ROBOKOP knowledge graph and (2) propose biological mechanisms that might explain them and serve as hypotheses for subsequent testing. We highlight the following three exemplar associations: carbon monoxide-multiple sclerosis, ammonia-asthma, and isopropanol-allergic disease. Results: ROBOKOP successfully returned answer sets for three queries that were posed in the context of the driving examples. The answer sets included potential intermediary genes, as well as supporting evidence that might explain the observed associations. Conclusions: We demonstrate real-world application of ROBOKOP to generate mechanistic hypotheses for associations between workplace chemical exposures and immune-mediated diseases. We expect that ROBOKOP will find broad application across many biomedical fields and other scientific disciplines due to its generalizability, speed to discovery and generation of mechanistic hypotheses, and open nature.

23 November 2020 in JMIR Medical Informatics
Verified
Journal Article
Open access
SCSteven Cox
Steven Cox
SAStanley C Ahalt
Stanley C Ahalt
JBJames Balhoff
James Balhoff
CBChris Bizon
Chris Bizon
KFKaramarie Fecho
Karamarie Fecho
HXHao Xu
Hao Xu
Background: Efforts are underway to semantically integrate large biomedical knowledge graphs using common upper-level ontologies to federate graph-oriented application programming interfaces (APIs) to the data. However, federation poses several challenges, including query routing to appropriate knowledge sources, generation and evaluation of answer subsets, semantic merger of those answer subsets, and visualization and exploration of results. Objective: We aimed to develop an interactive environment for query, visualization, and deep exploration of federated knowledge graphs. Methods: We developed a biomedical query language and web application interphase—termed as Translator Query Language (TranQL)—to query semantically federated knowledge graphs and explore query results. TranQL uses the Biolink data model as an upper-level biomedical ontology and an API standard that has been adopted by the Biomedical Data Translator Consortium to specify a protocol for expressing a query as a graph of Biolink data elements compiled from statements in the TranQL query language. Queries are mapped to federated knowledge sources, and answers are merged into a knowledge graph, with mappings between the knowledge graph and specific elements of the query. The TranQL interactive web application includes a user interface to support user exploration of the federated knowledge graph. Results: We developed 2 real-world use cases to validate TranQL and address biomedical questions of relevance to translational science. The use cases posed questions that traversed 2 federated Translator API endpoints: Integrated Clinical and Environmental Exposures Service (ICEES) and Reasoning Over Biomedical Objects linked in Knowledge Oriented Pathways (ROBOKOP). ICEES provides open access to observational clinical and environmental data, and ROBOKOP provides access to linked biomedical entities, such as “gene,” “chemical substance,” and “disease,” that are derived largely from curated public data sources. We successfully posed queries to TranQL that traversed these endpoints and retrieved answers that we visualized and evaluated. Conclusions: TranQL can be used to ask questions of relevance to translational science, rapidly obtain answers that require assertions from a federation of knowledge sources, and provide valuable insights for translational research and clinical practice.

24 January 2020 in JMIR Medical Informatics
Verified
Journal Article
Open access
EPEmily R Pfaff
Emily R Pfaff
MCMiles Crosskey
Miles Crosskey
KMKenneth Morton
Kenneth Morton
AKAshok Krishnamurthy
Ashok Krishnamurthy
Journal of Medical Internet Research - International Scientific Journal for Medical Research, Information and Communication on the Internet #Preprint #PeerReviewMe: Warning: This is a unreviewed preprint. Readers are warned that the document has not been peer-reviewed by expert/patient reviewers or an academic editor, may contain misleading claims, and is likely to undergo changes before final publication, if accepted, or may have been rejected/withdrawn. Readers with interest and expertise are encouraged to sign up as peer-reviewer, if the paper is within an open peer-review period. Please cite this preprint only for review purposes or for grant applications and CVs (if you are the author). Introduction: Computable phenotypes are algorithms that translate clinical features into code that can be run against electronic health record (EHR) data to define patient cohorts. However, computable phenotypes that only make use of structured EHR data do not capture the full richness of a patient’s medical record. While natural language processing (NLP) methods have shown success in extracting clinical features from text, the use of such tools has generally been limited to research groups with substantial NLP expertise. Our goal was to develop open-source phenotyping software, Clinical Annotation Research Kit (CLARK), that enables clinical and translational researchers to use machine-learning based NLP for computable phenotyping without requiring deep informatics expertise. Methods: CLARK enables non-expert users to mine text using machine learning classifiers by specifying features for the software to match in clinical notes. Once the features are defined, the user-friendly CLARK interface allows the user to choose from a variety of standard machine learning algorithms (linear support vector machine, Gaussian Naïve Bayes, decision tree, and random forest), cross-validation methods, and the number of folds (cross-validation splits) to be used in evaluation of the classifier. Results: Example phenotypes where CLARK has been applied include pediatric diabetes (0.91/0.98 sensitivity/specificity), symptomatic uterine fibroids (0.81/0.54 PPV/NPV), nonalcoholic fatty liver disease (0.90/0.94 sensitivity/specificity), and primary ciliary dyskinesia (0.88 / 1.0 sensitivity/specificity). Discussion: In each of these use cases, CLARK allowed investigators to incorporate variables into their phenotype algorithm that would not be available as structured data. Moreover, the fact that non-expert users can get started with machine learning-based NLP with limited informatics involvement is a significant improvement over the status quo. Our hope is to disseminate CLARK to other organizations that may not have NLP or machine learning specialists available, enabling wider use of these methods.

13 May 2011
Verified
Conference Paper
Closed access
PDF file
CRChristopher R Ratto
Christopher R Ratto
KMKenneth D Morton
Kenneth D Morton
LCLeslie Marie Collins
Leslie Marie Collins
PTPeter A Torrione
Peter A Torrione
In landmine detection applications, fluctuation of environmental and operating conditions can limit the performance of sensors based on ground-penetrating radar (GPR) technology. As these conditions vary, the classification and fusion rules necessary for achieving high detection and low false alarm rates may change. Therefore, context-dependent learning algorithms that exploit contextual variations of GPR data to alter decision rules have been considered for improving the performance of landmine detection systems. Past approaches to contextual learning have used both generative and discriminative methods to learn a probabilistic mixture of contexts, such as a Gaussian mixture, fuzzy c-means clustering, or a mixture of random sets. However, in these approaches the number of mixture components is pre-defined, which could be problematic if the number of contexts in a data collection is unknown a priori. In this work, a generative context model is proposed which requires no a priori knowledge in the number of mixture components. This was achieved through modeling the contextual distribution in a physics-based feature space with a Gaussian mixture, while also incorporating a Dirichlet process prior to model uncertainty in the number of mixture components. This Dirichlet process Gaussian mixture model (DPGMM) was then incorporated in the previously-developed Context-Dependent Feature Selection (CDFS) framework for fusion of multiple landmine detection algorithms. Experimental results suggest that when the DPGMM was incorporated into CDFS, the degree of performance improvement over conventional fusion was greater than when a conventional fixed-order context model was used.