<HashMap><database>biostudies-literature</database><scores/><additional><omics_type>Unknown</omics_type><volume>49(1)</volume><submitter>Hayes SMS</submitter><pubmed_abstract>Network inference is a valuable approach for gaining mechanistic insight from high-dimensional biological data. Existing methods for network inference focus on ranking all possible relations (edges) among all measured quantities such as genes, proteins, metabolites (features) observed, which yields a dense network that is challenging to interpret. Identifying a sparse, interpretable network using these methods thus requires an error-prone thresholding step which compromises their performance. In this article we propose a new method, DEKER-NET, that addresses this limitation by directly identifying a sparse, interpretable network without thresholding, improving real-world performance. DEKER-NET uses a novel machine learning method for feature selection in an iterative framework for network </pubmed_abstract><journal>Journal of pharmacokinetics and pharmacodynamics</journal><pagination>81-99</pagination><full_dataset_link>https://www.ebi.ac.uk/biostudies/studies/S-EPMC8837529</full_dataset_link><repository>biostudies-literature</repository><pubmed_title>From complex data to biological insight: 'DEKER' feature selection and network inference.</pubmed_title><pmcid>PMC8837529</pmcid><pubmed_authors>Sachs JR</pubmed_authors><pubmed_authors>Cho CR</pubmed_authors><pubmed_authors>Hayes SMS</pubmed_authors></additional><is_claimable>false</is_claimable><name>From complex data to biological insight: 'DEKER' feature selection and network inference.</name><description>Network inference is a valuable approach for gaining mechanistic insight from high-dimensional biological data. Existing methods for network inference focus on ranking all possible relations (edges) among all measured quantities such as genes, proteins, metabolites (features) observed, which yields a dense network that is challenging to interpret. Identifying a sparse, interpretable network using these methods thus requires an error-prone thresholding step which compromises their performance. In this article we propose a new method, DEKER-NET, that addresses this limitation by directly identifying a sparse, interpretable network without thresholding, improving real-world performance. DEKER-NET uses a novel machine learning method for feature selection in an iterative framework for network </description><dates><release>2022-01-01T00:00:00Z</release><publication>2022 Feb</publication><modification>2025-04-04T08:58:30.235Z</modification><creation>2025-04-04T08:58:30.235Z</creation></dates><accession>S-EPMC8837529</accession><cross_references><pubmed>34791577</pubmed><doi>10.1007/s10928-021-09792-7</doi></cross_references></HashMap>