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,693 records · Page 94Linked to original sources
PubMed1990

The effective learning of spatio temporal concepts of human structure.

The recent availability of increasingly powerful and user friendly computers is making a noticeable impact in the field of medical education. Over the past year, the power of the computer is being harnessed here in the field of anatomy to enable medical and dental students to learn the subject more effectively. Machines with excellent graphics, text and animation capabilities have made it possible to allow students to comprehend structural complexity as seen in gross anatomy or, temporal alterations of structure as seen in embryology by the use of computer based, tutorial style or self paced interactive style of learning. Positive student response to sample learning packages has encouraged the undertaking of courseware development for future use at computer workstations.

Anatomy↗
PubMedDate not supplied

Continuous positive airway pressure: patients' and caregivers' learning needs and barriers to use.

OBJECTIVE: To identify learning needs and factors related to postdischarge use of continuous positive airway pressure (CPAP) ventilation. DESIGN: Exploratory descriptive correlational. SETTING: Metropolitan and rural clinics. SUBJECTS: Adult patients (N = 21) and family caregivers, one half 60 years or older. INSTRUMENTS: Family interviews, life satisfaction and quality, family function and relationship, depression and learning preparedness. RESULTS: There were numerous learning needs related to CPAP machine management, monitoring illness severity, and recognizing depressive symptomology, oxygen deficits, and cardiovascular sequelae. Family members are involved in overcoming barriers interfering with nightly CPAP use. Interview and questionnaire data clearly indicate life satisfaction improves after CPAP treatment. CONCLUSION: Predischarge and teaching programs coordinated by expert nurses are needed to address families' learning needs and support habitual long-term CPAP use. Family problem solving and depression interventions, instruction on recognizing symptoms of cardiovascular complications, and long-term follow-up programs are currently being studied.

Adaptation, Psychological↗
PubMed2006

Confidence-based active learning.

This paper proposes a new active learning approach, confidence-based active learning, for training a wide range of classifiers. This approach is based on identifying and annotating uncertain samples. The uncertainty value of each sample is measured by its conditional error. The approach takes advantage of current classifiers' probability preserving and ordering properties. It calibrates the output scores of classifiers to conditional error. Thus, it can estimate the uncertainty value for each input sample according to its output score from a classifier and select only samples with uncertainty value above a user-defined threshold. Even though we cannot guarantee the optimality of the proposed approach, we find it to provide good performance. Compared with existing methods, this approach is robust without additional computational effort. A new active learning method for support vector machines (SVMs) is implemented following this approach. A dynamic bin width allocation method is proposed to accurately estimate sample conditional error and this method adapts to the underlying probabilities. The effectiveness of the proposed approach is demonstrated using synthetic and real data sets and its performance is compared with the widely used least certain active learning method.

Algorithms↗
PubMedDate not supplied

Effects of introducing an office chemistry machine.

An office chemistry machine was placed into service at the SIU Springfield Family Practice Center. After one year's use of the machine, a study was performed to learn whether there were changes in the methods, of costs, and of care for hypertensive patients compared to the year before introduction of the machine. After introduction of the machine, the physicians began to order individual tests performed in the office rather than chemistry panels performed by the reference laboratory. There was no change in the frequency or costs of testing. Frequency of visits for hypertension and visits for all other reasons did not differ. The level of blood pressure control was the same before and after introduction of the machine. Thus, in this study, introduction of an office chemistry machine resulted in greater revenues to the clinic without changing quality of care or increasing the overall cost of treatment.

Blood Chemical Analysis↗
PubMedDate not supplied

Granular support vector machines with association rules mining for protein homology prediction.

OBJECTIVE: Protein homology prediction between protein sequences is one of critical problems in computational biology. Such a complex classification problem is common in medical or biological information processing applications. How to build a model with superior generalization capability from training samples is an essential issue for mining knowledge to accurately predict/classify unseen new samples and to effectively support human experts to make correct decisions. METHODOLOGY: A new learning model called granular support vector machines (GSVM) is proposed based on our previous work. GSVM systematically and formally combines the principles from statistical learning theory and granular computing theory and thus provides an interesting new mechanism to address complex classification problems. It works by building a sequence of information granules and then building support vector machines (SVM) in some of these information granules on demand. A good granulation method to find suitable granules is crucial for modeling a GSVM with good performance. In this paper, we also propose an association rules-based granulation method. For the granules induced by association rules with high enough confidence and significant support, we leave them as they are because of their high "purity" and significant effect on simplifying the classification task. For every other granule, a SVM is modeled to discriminate the corresponding data. In this way, a complex classification problem is divided into multiple smaller problems so that the learning task is simplified. RESULTS AND CONCLUSIONS: The proposed algorithm, here named GSVM-AR, is compared with SVM by KDDCUP04 protein homology prediction data. The experimental results show that finding the splitting hyperplane is not a trivial task (we should be careful to select the association rules to avoid overfitting) and GSVM-AR does show significant improvement compared to building one single SVM in the whole feature space. Another advantage is that the utility of GSVM-AR is very good because it is easy to be implemented. More importantly and more interestingly, GSVM provides a new mechanism to address complex classification problems.

Algorithms↗
PubMed2002

Self-optimizing MPC of melt temperature in injection moulding.

The parameters in plastic injection moulding are highly nonlinear and interacting. Good control of plastic melt temperature for injection moulding is very important in reducing operator setup time, assuring consistent product quality, and preventing thermal degradation of the melt. Step response testing was performed on the barrel heating zones on an industrial injection moulding machine (IMM). The open loop responses indicated a high degree of process coupling between the heating zones. From these experimental step responses, a multiple-input-multiple-output model predictive control strategy was developed and practically implemented. The requirement of negligible overshoot is important to the plastics industry for preventing material overheating and wastage, and reducing machine operator setup time. A generic learning and self-optimizing MPC methodology was developed and implemented on the IMM to control melt temperature for any polymer to be moulded on any machine having different electrical heater capacities. The control performance was tested for varying setpoint trajectories typical of normal machine operations. The results showed that the predictive controller provided good control of melt temperature for all zones with negligible oscillations, and, therefore, eliminated material degradation and extended machine setup time.

Computer Simulation↗
PubMed2003

Classification of prostatic carcinoma with artificial neural networks using comparative genomic hybridization and quantitative stereological data.

Staging of prostate cancer is a mainstay of treatment decisions and prognostication. In the present study, 50 pT2N0 and 28 pT3N0 prostatic adenocarcinomas were characterized by Gleason grading, comparative genomic hybridization (CGH), and histological texture analysis based on principles of stereology and stochastic geometry. The cases were classified by learning vector quantization and support vector machines. The quality of classification was tested by cross-validation. Correct prediction of stage from primary tumor data was possible with an accuracy of 74-80% from different data sets. The accuracy of prediction was similar when the Gleason score was used as input variable, when stereological data were used, or when a combination of CGH data and stereological data was used. The results of classification by learning vector quantization were slightly better than those by support vector machines. A method is briefly sketched by which training of neural networks can be adapted to unequal sample sizes per class. Progression from pT2 to pT3 prostate cancer is correlated with complex changes of the epithelial cells in terms of volume fraction, of surface area, and of second-order stereological properties. Genetically, this progression is accompanied by a significant global increase in losses and gains of DNA, and specifically by increased numerical aberrations on chromosome arms 1q, 7p, and 8p.

Adenocarcinoma↗
PubMed1997

Factor analysis using delta-rule wake-sleep learning.

We describe a linear network that models correlations between real-valued visible variables using one or more real-valued hidden variables-a factor analysis model. This model can be seen as a linear version of the Helmholtz machine, and its parameters can be learned using the wake-sleep method, in which learning of the primary generative model is assisted by a recognition model, whose role is to fill in the values of hidden variables based on the values of visible variables. The generative and recognition models are jointly learned in wake and sleep phases, using just the delta rule. This learning procedure is comparable in simplicity to Hebbian learning, which produces a somewhat different representation of correlations in terms of principal components. We argue that the simplicity of wake-sleep learning makes factor analysis a plausible alternative to Hebbian learning as a model of activity-dependent cortical plasticity.

Factor Analysis, Statistical↗
PubMed2007

Oligonucleotide microarray identification of Bacillus anthracis strains using support vector machines.

The capability of a custom microarray to discriminate between closely related DNA samples is demonstrated using a set of Bacillus anthracis strains. The microarray was developed as a universal fingerprint device consisting of 390 genome-independent 9mer probes. The genomes of B. anthracis strains are monomorphic and therefore, typically difficult to distinguish using conventional molecular biology tools or microarray data clustering techniques. Using support vector machines (SVMs) as a supervised learning technique, we show that a low-density fingerprint microarray contains enough information to discriminate between B. anthracis strains with 90% sensitivity using a reference library constructed from six replicate arrays and three replicates for new isolates.

Algorithms↗
PubMed2004

Analysis of switching dynamics with competing support vector machines.

We present a framework for the unsupervised segmentation of switching dynamics using support vector machines. Following the architecture by Pawelzik et al., where annealed competing neural networks were used to segment a nonstationary time series, in this paper, we exploit the use of support vector machines, a well-known learning technique. First, a new formulation of support vector regression is proposed. Second, an expectation-maximization step is suggested to adaptively adjust the annealing parameter. Results indicate that the proposed approach is promising.

Artificial Intelligence↗
PubMed1976

Evaluation of an instruction programme on diabetes diet by means of a teaching machine.

In 119 patients with diabetes, student nurses, social workers, dietitians and medical students a pretest was carried out with multiple-choice questions on the subject of diabetes diet. The group was then exposed to programmed diet instruction with a teaching machine. There was a significant learning effect as measured by the score differences with identical and analogue post-tests. Programmed self-teaching with feed back by multiple-choice questions seems to be an efficient method of instruction of basic facts of nutrition for diabetics thus enabling the physician to spend more time on the patient's personal problems.

Diet, Diabetic↗
PubMed2001

Identifying marker genes in transcription profiling data using a mixture of feature relevance experts.

Transcription profiling experiments permit the expression levels of many genes to be measured simultaneously. Given profiling data from two types of samples, genes that most distinguish the samples (marker genes) are good candidates for subsequent in-depth experimental studies and developing decision support systems for diagnosis, prognosis, and monitoring. This work proposes a mixture of feature relevance experts as a method for identifying marker genes and illustrates the idea using published data from samples labeled as acute lymphoblastic and myeloid leukemia (ALL, AML). A feature relevance expert implements an algorithm that calculates how well a gene distinguishes samples, reorders genes according to this relevance measure, and uses a supervised learning method [here, support vector machines (SVMs)] to determine the generalization performances of different nested gene subsets. The mixture of three feature relevance experts examined implement two existing and one novel feature relevance measures. For each expert, a gene subset consisting of the top 50 genes distinguished ALL from AML samples as completely as all 7,070 genes. The 125 genes at the union of the top 50s are plausible markers for a prototype decision support system. Chromosomal aberration and other data support the prediction that the three genes at the intersection of the top 50s, cystatin C, azurocidin, and adipsin, are good targets for investigating the basic biology of ALL/AML. The same data were employed to identify markers that distinguish samples based on their labels of T cell/B cell, peripheral blood/bone marrow, and male/female. Selenoprotein W may discriminate T cells from B cells. Results from analysis of transcription profiling data from tumor/nontumor colon adenocarcinoma samples support the general utility of the aforementioned approach. Theoretical issues such as choosing SVM kernels and their parameters, training and evaluating feature relevance experts, and the impact of potentially mislabeled samples on marker identification (feature selection) are discussed.

Acute Disease↗
PubMed2003

[Application of support vector machines to classification of blood cells].

The support vector machine (SVM) is a new learning technique based on the statistical learning theory. It was originally developed for two-class classification. In this paper, the SVM approach is extended to multi-class classification problems, a hierarchical SVM is applied to classify blood cells in different maturation stages from bone marrow. Based on stepwise decomposition, a hierarchical clustering method is presented to construct the architecture of the hierarchical (tree-like) SVM, then the optimal control parameters of SVM are determined by some criterion for each discriminant step. To verify the performances of classifiers, the SVM method is compared with three classical classifiers using 3-fold cross validation. The preliminary results indicate that the proposed method avoids the curse of dimensionality and has greater generalization. Thus, the method can improve the classification correctness for blood cells from bone marrow.

Algorithms↗
PubMed2002

On the emergence of rules in neural networks.

A simple associationist neural network learns to factor abstract rules (i.e., grammars) from sequences of arbitrary input symbols by inventing abstract representations that accommodate unseen symbol sets as well as unseen but similar grammars. The neural network is shown to have the ability to transfer grammatical knowledge to both new symbol vocabularies and new grammars. Analysis of the state-space shows that the network learns generalized abstract structures of the input and is not simply memorizing the input strings. These representations are context sensitive, hierarchical, and based on the state variable of the finite-state machines that the neural network has learned. Generalization to new symbol sets or grammars arises from the spatial nature of the internal representations used by the network, allowing new symbol sets to be encoded close to symbol sets that have already been learned in the hidden unit space of the network. The results are counter to the arguments that learning algorithms based on weight adaptation after each exemplar presentation (such as the long term potentiation found in the mammalian nervous system) cannot in principle extract symbolic knowledge from positive examples as prescribed by prevailing human linguistic theory and evolutionary psychology.

Algorithms↗
PubMedDate not supplied

Handling missing values in support vector machine classifiers.

This paper discusses the task of learning a classifier from observed data containing missing values amongst the inputs which are missing completely at random. A non-parametric perspective is adopted by defining a modified risk taking into account the uncertainty of the predicted outputs when missing values are involved. It is shown that this approach generalizes the approach of mean imputation in the linear case and the resulting kernel machine reduces to the standard Support Vector Machine (SVM) when no input values are missing. Furthermore, the method is extended to the multivariate case of fitting additive models using componentwise kernel machines, and an efficient implementation is based on the Least Squares Support Vector Machine (LS-SVM) classifier formulation.

Algorithms↗
PubMed1998

Dynamic On-line Clustering and State Extraction: An Approach to Symbolic Learning.

Although recurrent neural nets have been moderately successful in learning to emulate finite-state machines (FSMs), the continuous internal state dynamics of a neural net are not well matched to the discrete behavior of an FSM. We describe an architecture, called DOLCE, that allows discrete states to evolve in a net as learning progresses. DOLCE consists of a standard recurrent neural net trained by gradient descent and an adaptive clustering technique that quantizes the state space. We describe two implementations of DOLCE. The first implementation, called DOLCE(u), uses an adaptive clustering scheme in an unsupervised mode to determine both the number of clusters and the partitioning of the state space as learning progresses. The second model, DOLCE(s), uses a Gaussian Mixture Model in a supervised learning framework to infer the states of an FSM. DOLCE(s) is based on the assumption that a finite set of discrete internal states is required for the task, and that the actual network state belongs to this set but has been corrupted by noise due to inaccuracy in the weights. DOLCE(s) learns to recover the discrete state with maximum a posteriori probability from the noisy state. Simulations show that both implementations of DOLCE lead to a significant improvement in generalization performance over earlier neural net approaches to FSM induction. The idea of adaptive quantization is not just applicable to DOLCE but can be applied to other domains as well.

Journal Article↗