Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Machine learning.”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,675 records · Page 93Linked to original sources

Prediction of torsade-causing potential of drugs by support vector machine approach.

In an effort to facilitate drug discovery, computational methods for facilitating the prediction of various adverse drug reactions (ADRs) have been developed. So far, attention has not been sufficiently paid to the development of methods for the prediction of serious ADRs that occur less frequently. Some of these ADRs, such as torsade de pointes (TdP), are important issues in the approval of drugs for certain diseases. Thus there is a need to develop tools for facilitating the prediction of these ADRs. This work explores the use of a statistical learning method, support vector machine (SVM), for TdP prediction. TdP involves multiple mechanisms and SVM is a method suitable for such a problem. Our SVM classification system used a set of linear solvation energy relationship (LSER) descriptors and was optimized by leave-one-out cross validation procedure. Its prediction accuracy was evaluated by using an independent set of agents and by comparison with results obtained from other commonly used classification methods using the same dataset and optimization procedure. The accuracies for the SVM prediction of TdP-causing agents and non-TdP-causing agents are 97.4 and 84.6% respectively; one is substantially improved against and the other is comparable to the results obtained by other classification methods useful for multiple-mechanism prediction problems. This indicates the potential of SVM in facilitating the prediction of TdP-causing risk of small molecules and perhaps other ADRs that involve multiple mechanisms.

Algorithms↗

Prediction of estrogen receptor agonists and characterization of associated molecular descriptors by statistical learning methods.

Specific estrogen receptor (ER) agonists have been used for hormone replacement therapy, contraception, osteoporosis prevention, and prostate cancer treatment. Some ER agonists and partial-agonists induce cancer and endocrine function disruption. Methods for predicting ER agonists are useful for facilitating drug discovery and chemical safety evaluation. Structure-activity relationships and rule-based decision forest models have been derived for predicting ER binders at impressive accuracies of 87.1-97.6% for ER binders and 80.2-96.0% for ER non-binders. However, these are not designed for identifying ER agonists and they were developed from a subset of known ER binders. This work explored several statistical learning methods (support vector machines, k-nearest neighbor, probabilistic neural network and C4.5 decision tree) for predicting ER agonists from comprehensive set of known ER agonists and other compounds. The corresponding prediction systems were developed and tested by using 243 ER agonists and 463 ER non-agonists, respectively, which are significantly larger in number and structural diversity than those in previous studies. A feature selection method was used for selecting molecular descriptors responsible for distinguishing ER agonists from non-agonists, some of which are consistent with those used in other studies and the findings from X-ray crystallography data. The prediction accuracies of these methods are comparable to those of earlier studies despite the use of significantly more diverse range of compounds. SVM gives the best accuracy of 88.9% for ER agonists and 98.1% for non-agonists. Our study suggests that statistical learning methods such as SVM are potentially useful for facilitating the prediction of ER agonists and for characterizing the molecular descriptors associated with ER agonists.

Forecasting↗

Spatial Multiomics Reveal Insights Into ADC Efficacy.

Antibody-drug conjugates (ADCs) have transformed the therapeutic landscape of solid tumors; however, responses remain heterogeneous and complex to predict. In addition, a growing number of multiple ADC targets are either approved or in late-stage clinical development, such as NECTIN-4, HER2, or TROP2 for metastatic urothelial cancer. Spatial multiomics-representing next-generation methods that couple high-plex RNA sequencing and multiplex protein imaging with precise x-y-z coordinates within tissues-offer a direct way to correlate (ADC) antigen expression, cell state information, and micro-anatomical context with patient treatment outcomes. In this review, we highlight suitability and technological advancements in current spatial transcriptomics and proteomics approaches to decode modes of action and resistance to ADCs and extract biological insights, particularly in metastatic urothelial cancer-and propose an integrative framework that combines spatial readouts with machine and/or deep learning-driven analytics to stratify patients, forecast on- and off-target toxicities, and guide next-generation linker-payload designs or combination therapies.

Humans↗

Nonlinear estimation and modeling of fMRI data using spatio-temporal support vector regression.

This paper presents a new and general nonlinear framework for fMRI data analysis based on statistical learning methodology: support vector machines. Unlike most current methods which assume a linear model for simplicity, the estimation and analysis of fMRI signal within the proposed framework is nonlinear, which matches recent findings on the dynamics underlying neural activity and hemodynamic physiology. The approach utilizes spatio-temporal support vector regression (SVR), within which the intrinsic spatio-temporal autocorrelations in fMRI data are reflected. The novel formulation of the problem allows merging model-driven with data-driven methods, and therefore unifies these two currently separate modes of fMRI analysis. In addition, multiresolution signal analysis is achieved and developed. Other advantages of the approach are: avoidance of interpolation after motion estimation, embedded removal of low-frequency noise components, and easy incorporation of multi-run, multi-subject, and multi-task studies into the framework.

Algorithms↗

Computer prediction of allergen proteins from sequence-derived protein structural and physicochemical properties.

BACKGROUND: Computational methods have been developed for predicting allergen proteins from sequence segments that show identity, homology, or motif match to a known allergen. These methods achieve good prediction accuracies, but are less effective for novel proteins with no similarity to any known allergen. METHODS: This work tests the feasibility of using a statistical learning method, support vector machines, as such a method. The prediction system is trained and tested by using 1005 allergen proteins from the Allergome database and 22,469 non-allergen proteins from 7871 Pfam families. RESULTS: Testing results by an independent set of 229 allergen and 6717 non-allergen proteins from 7871 Pfam families show that 93.0% and 99.9% of these are correctly predicted, which are comparable to the best results of other methods. Of the 18 novel allergen proteins non-homologous to any other proteins in the Swissprot database, 88.9% is correctly predicted. A further screening of 168,128 proteins in the Swissprot database finds that 2.9% of the proteins are predicted as allergen proteins, which is consistent with the estimated numbers from motif-based methods. CONCLUSIONS: Our study suggests that SVM is a potentially useful method for predicting allergen proteins and it has certain capability for predicting novel allergen proteins. Our software can be accessed at .

Allergens↗

Assessment of hepatotoxic liabilities by transcript profiling.

Male Wistar rats were treated with various model compounds or the appropriate vehicle controls in order to create a reference database for toxicogenomics assessment of novel compounds. Hepatotoxic compounds in the database were either known hepatotoxicants or showed hepatotoxicity during preclinical testing. Histopathology and clinical chemistry data were used to anchor the transcript profiles to an established endpoint (steatosis, cholestasis, direct acting, peroxisomal proliferation or nontoxic/control). These reference data were analyzed using a supervised learning method (support vector machines, SVM) to generate classification rules. This predictive model was subsequently used to assess compounds with regard to a potential hepatotoxic liability. A steatotic and a non-hepatotoxic 5HT(6) receptor antagonist compound from the same series were successfully discriminated by this toxicogenomics model. Additionally, an example is shown where a hepatotoxic liability was correctly recognized in the absence of pathological findings. In vitro experiments and a dog study confirmed the correctness of the toxicogenomics alert. Another interesting observation was that transcript profiles indicate toxicologically relevant changes at an earlier timepoint than routinely used methods. Together, these results support the useful application of toxicogenomics in raising alerts for adverse effects and generating mechanistic hypotheses that can be followed up by confirmatory experiments.

Animals↗

Differentially expressed genes in gastric tumors identified by cDNA array.

Using cDNA fragments from the FAPESP/lICR Cancer Genome Project, we constructed a cDNA array having 4512 elements and determined gene expression in six normal and six tumor gastric tissues. Using t-statistics, we identified 80 cDNAs whose expression in normal and tumor samples differed more than 3.5 sample standard deviations. Using Self-Organizing Map, the expression profile of these cDNAs allowed perfect separation of malignant and non-malignant samples. Using the supervised learning procedure Support Vector Machine, we identified trios of cDNAs that could be used to classify samples as normal or tumor, based on single-array analysis. Finally, we identified genes with altered linear correlation when their expression in normal and tumor samples were compared. Further investigation concerning the function of these genes could contribute to the understanding of gastric carcinogenesis and may prove useful in molecular diagnostics.

Algorithms↗

Predicting functional family of novel enzymes irrespective of sequence similarity: a statistical learning approach.

The function of a protein that has no sequence homolog of known function is difficult to assign on the basis of sequence similarity. The same problem may arise for homologous proteins of different functions if one is newly discovered and the other is the only known protein of similar sequence. It is desirable to explore methods that are not based on sequence similarity. One approach is to assign functional family of a protein to provide useful hint about its function. Several groups have employed a statistical learning method, support vector machines (SVMs), for predicting protein functional family directly from sequence irrespective of sequence similarity. These studies showed that SVM prediction accuracy is at a level useful for functional family assignment. But its capability for assignment of distantly related proteins and homologous proteins of different functions has not been critically and adequately assessed. Here SVM is tested for functional family assignment of two groups of enzymes. One consists of 50 enzymes that have no homolog of known function from PSI-BLAST search of protein databases. The other contains eight pairs of homologous enzymes of different families. SVM correctly assigns 72% of the enzymes in the first group and 62% of the enzyme pairs in the second group, suggesting that it is potentially useful for facilitating functional study of novel proteins. A web version of our software, SVMProt, is accessible at http://jing.cz3.nus.edu.sg/cgi-bin/svmprot.cgi.

Artificial Intelligence↗

Experiences learned in the successful establishment of a nonheart beating donor program for renal transplantation.

PURPOSE: With the continuing shortage of suitable donors increasing interest is being shown in nonheart beating donation. Such a resource is a new and, therefore, an underused source of donor organs. However because of the nature of such donors, the kidneys so derived have been damaged by primary warm ischemia, and so potentially they may never function. We introduced viability testing to identify such organs and, thus, avoid transplantation. We reviewed sentinel cases in our developing program from which we have learned. MATERIALS AND METHODS: Machine perfusion was developed locally and used to test the kidneys derived from such donors. Flow characteristics and enzyme analysis were used to define usable kidneys. The definitions of acceptable criteria evolved through the study during a 3-year period. RESULTS: As previously defined, acceptable criteria were initially adhered with decreasing resistance and a glutathione S-transferase of less than 200 IU/l/100 gm. After the series described acceptable limits were changed in favor of a high perfusion flow index, low temperature, low weight increase and low glutathione S-transferase. CONCLUSIONS: If such criteria are adhered to, graft survival becomes reliable from such donors.

Adult↗

Multidimensional signal exploration using multiple correspondence analysis. An example of a load lifting study.

Most empirical studies concerning rehabilitation yield numerous multidimensional signals (dozens of time variables are obtained for dozens of empirical situations). The purpose of this paper is to suggest a statistical analysis procedure based on: 1) space-time fuzzy windowing; 2) signal behavior characterization within the windows using membership value averages (MVA); and 3) MVA analysis using the multiple correspondence analysis (MCA). A load lifting study provided an example of 78 multidimensional signals including 89 time variables (forces, energy indicators, linear and angular positions, speeds, and accelerations). The main goal of MCA was to compare and contrast biomechanical signals from two lifting modes: "free" and "isokinetic." In the first mode, three loads were tested--light, medium, and heavy. In the second, three speeds were tested--slow, medium, and fast. Thirteen male individuals without disabilities participated in this study. The MCA showed that most of the free load-lifting strategies cannot be used in isokinetic lifting because the constraints of the subject and the environment are different. In addition, as the level of difficulty increases, free lifting became more economical while isokinetic lifting became less economical. These results would appear to indicate that movement strategies used for free lifting cannot be learned using an isokinetic machine during rehabilitation sessions for chronic low back pain. MCA was also suggested as a tool for comparing patients with control individuals. To achieve this aim, the notion of "supplementary data" was introduced.

Adult↗

A computer method for validating traditional Chinese medicine herbal prescriptions.

Traditional Chinese medicine (TCM) has been widely practiced and is considered as an alternative to conventional medicine. TCM herbal prescriptions contain a mixture of herbs that collectively exert therapeutic actions and modulating effects. Traditionally defined herbal properties, related to the pharmacodynamic, pharmacokinetic and toxicological, as well as physicochemical properties of their principal ingredients, have been used as the basis for formulating TCM multi-herb prescriptions. These properties are used in this work to develop a computer program for predicting whether a multi-herb recipe is a valid TCM prescription. This program is based on a statistical learning method, support vector machine (SVM), and it is trained by using 575 well-known TCM prescriptions and 1961 non-TCM recipes generated by random combination of TCM herbs. Testing results by using 72 well-known TCM prescriptions and 5039 non-TCM recipes showed that 73.6% of the TCM prescriptions and 99.9% of non-TCM recipes are correctly classified by this system. A further test by using 48 TCM prescriptions published in recent years found that 68.7% of these are correctly classified. These accuracies are comparable to those of SVM classification of other biological systems. Our study indicates the potential of SVM for facilitating the analysis of TCM prescriptions.

Chemistry, Pharmaceutical↗

Boosted mixture of experts: an ensemble learning scheme.

We present a new supervised learning procedure for ensemble machines, in which outputs of predictors, trained on different distributions, are combined by a dynamic classifier combination model. This procedure may be viewed as either a version of mixture of experts (Jacobs, Jordan, Nowlan, & Hintnon, 1991), applied to classification, or a variant of the boosting algorithm (Schapire, 1990). As a variant of the mixture of experts, it can be made appropriate for general classification and regression problems by initializing the partition of the data set to different experts in a boostlike manner. If viewed as a variant of the boosting algorithm, its main gain is the use of a dynamic combination model for the outputs of the networks. Results are demonstrated on a synthetic example and a digit recognition task from the NIST database and compared with classifical ensemble approaches.

Algorithms↗

Discriminating different classes of toxicants by transcript profiling.

Male rats were treated with various model compounds or the appropriate vehicle controls. Most substances were either well-known hepatotoxicants or showed hepatotoxicity during preclinical testing. The aim of the present study was to determine if biological samples from rats treated with various compounds can be classified based on gene expression profiles. In addition to gene expression analysis using microarrays, a complete serum chemistry profile and liver and kidney histopathology were performed. We analyzed hepatic gene expression profiles using a supervised learning method (support vector machines; SVMs) to generate classification rules and combined this with recursive feature elimination to improve classification performance and to identify a compact subset of probe sets with potential use as biomarkers. Two different SVM algorithms were tested, and the models obtained were validated with a compound-based external cross-validation approach. Our predictive models were able to discriminate between hepatotoxic and nonhepatotoxic compounds. Furthermore, they predicted the correct class of hepatotoxicant in most cases. We provide an example showing that a predictive model built on transcript profiles from one rat strain can successfully classify profiles from another rat strain. In addition, we demonstrate that the predictive models identify nonresponders and are able to discriminate between gene changes related to pharmacology and toxicity. This work confirms the hypothesis that compound classification based on gene expression data is feasible.

Algorithms↗

Temporal sequence learning, prediction, and control: a review of different models and their relation to biological mechanisms.

In this review, we compare methods for temporal sequence learning (TSL) across the disciplines machine-control, classical conditioning, neuronal models for TSL as well as spike-timing-dependent plasticity (STDP). This review introduces the most influential models and focuses on two questions: To what degree are reward-based (e.g., TD learning) and correlation-based (Hebbian) learning related? and How do the different models correspond to possibly underlying biological mechanisms of synaptic plasticity? We first compare the different models in an open-loop condition, where behavioral feedback does not alter the learning. Here we observe that reward-based and correlation-based learning are indeed very similar. Machine control is then used to introduce the problem of closed-loop control (e.g., actor-critic architectures). Here the problem of evaluative (rewards) versus nonevaluative (correlations) feedback from the environment will be discussed, showing that both learning approaches are fundamentally different in the closed-loop condition. In trying to answer the second question, we compare neuronal versions of the different learning architectures to the anatomy of the involved brain structures (basal-ganglia, thalamus, and cortex) and the molecular biophysics of glutamatergic and dopaminergic synapses. Finally, we discuss the different algorithms used to model STDP and compare them to reward-based learning rules. Certain similarities are found in spite of the strongly different timescales. Here we focus on the biophysics of the different calcium-release mechanisms known to be involved in STDP.

Forecasting↗

[Re-signification of the human in the context of the "ciborgzation": a look at the human being-machine relationship in intensive care].

This study discusses the human being-machine relationship in the process called "cyborgzation" of the nurse who works in intensive care, based on post-structuralist Cultural Studies and highlighting Haraway's concept of cyborg. In it, manuals used by nurses in Intensive Care Units have been examined as cultural texts. This cultural analysis tries to decode the various senses of "human" and "machine", with the aim of recognizing processes that turn nurses into cyborgs. The argument is that intensive care nurses fall into a process of "technology embodiment" that turns the body-professional into a hybrid that makes possible to disqualify, at the same time, notions such as machine and body "proper", since it is the hybridization between one and the other that counts there. Like cyborgs, intensive care nurses learn to "be with" the machine, and this connection limits the specificity of their actions. It is suggested that processes of "cyborgzation" such as this are useful for questioning - and to deal with in different ways - the senses of "human" and "humanity" that support a major part of knowledge/action in health.

Critical Care↗

The dynamics of discrete-time computation, with application to recurrent neural networks and finite state machine extraction.

Recurrent neural networks (RNNs) can learn to perform finite state computations. It is shown that an RNN performing a finite state computation must organize its state space to mimic the states in the minimal deterministic finite state machine that can perform that computation, and a precise description of the attractor structure of such systems is given. This knowledge effectively predicts activation space dynamics, which allows one to understand RNN computation dynamics in spite of complexity in activation dynamics. This theory provides a theoretical framework for understanding finite state machine (FSM) extraction techniques and can be used to improve training methods for RNNs performing FSM computations. This provides an example of a successful approach to understanding a general class of complex systems that has not been explicitly designed, e.g., systems that have evolved or learned their internal structure.

Neural Networks, Computer↗

Recurrence methods in the analysis of learning processes.

The goal of most learning processes is to bring a machine into a set of "correct" states. In practice, however, it may be difficult to show that the process enters this target set. We present a condition that ensures that the process visits the target set infinitely often almost surely. This condition is easy to verify and is true for many well-known learning rules. To demonstrate the utility of this method, we apply it to four types of learning processes: the perceptron, learning rules governed by continuous energy functions, the Kohonen rule, and the committee machine.

Algorithms↗

Fuzzy support vector machines for adaptive Morse code recognition.

Morse code is now being harnessed for use in rehabilitation applications of augmentative-alternative communication and assistive technology, facilitating mobility, environmental control and adapted worksite access. In this paper, Morse code is selected as a communication adaptive device for persons who suffer from muscle atrophy, cerebral palsy or other severe handicaps. A stable typing rate is strictly required for Morse code to be effective as a communication tool. Therefore, an adaptive automatic recognition method with a high recognition rate is needed. The proposed system uses both fuzzy support vector machines and the variable-degree variable-step-size least-mean-square algorithm to achieve these objectives. We apply fuzzy memberships to each point, and provide different contributions to the decision learning function for support vector machines. Statistical analyses demonstrated that the proposed method elicited a higher recognition rate than other algorithms in the literature.

Algorithms↗