PubMed Health⌕ Search

SEARCH · PubMed Health

Results for “radial basis function network”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

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

At least 235 records · Page 13Linked to original sources

Three machine learning techniques for automatic determination of rules to control locomotion.

Automatic prediction of gait events (e.g., heel contact, flat foot, initiation of the swing, etc.) and corresponding profiles of the activations of muscles is important for real-time control of locomotion. This paper presents three supervised machine learning (ML) techniques for prediction of the activation patterns of muscles and sensory data, based on the history of sensory data, for walking assisted by a functional electrical stimulation (FES). Those ML's are: 1) a multilayer perceptron with Levenberg-Marquardt modification of backpropagation learning algorithm; 2) an adaptive-network-based fuzzy inference system (ANFIS); and 3) a combination of an entropy minimization type of inductive learning (IL) technique and a radial basis function (RBF) type of artificial neural network with orthogonal least squares learning algorithm. Here we show the prediction of the activation of the knee flexor muscles and the knee joint angle for seven consecutive strides based on the history of the knee joint angle and the ground reaction forces. The data used for training and testing of ML's was obtained from a simulation of walking assisted with an FES system [39]. The ability of generating rules for an FES controller was selected as the most important criterion when comparing the ML's. Other criteria such as generalization of results, computational complexity, and learning rate were also considered. The minimal number of rules and the most explicit and comprehensible rules were obtained by ANFIS. The best generalization was obtained by the IL and RBF network.

Algorithms↗

Classification of low back pain from dynamic motion characteristics using an artificial neural network.

STUDY DESIGN: Data were collected from 183 subjects who were randomly assigned to the training and test groups. During testing of the classification system, knowledge of the low back pain condition or motion characteristics of the patients in the test group was not made available to the system. OBJECTIVES: To determine specific characteristics of trunk motion associated with different categories of spinal disorders and to determine whether a neural network analysis system can be effective in distinguishing patterns. SUMMARY OF BACKGROUND DATA: Numerous studies have established the difficulty of evaluating lower back pain. Imaging techniques are expensive and ineffective in many cases. A technique for evaluation of lower back pain was developed on the basis of analysis of such dynamic motion features as shape, velocity, and symmetry of movements, using a neural network classification system. METHODS: Dynamic motion data were collected from 183 subjects using a triaxial goniometer. Features of the movement were extracted and provided as input to a two-stage neural network classifier governed by a radial basis function architecture. After training, the output of the classifier was compared with Québec Task Force pain classifications obtained for the patients. Linear and nonlinear classification techniques were compared. RESULTS: The system could determine low back pain classification from motion characteristics. The neural network classifier produced the best results with up to 85% accuracy on novel "validation" data. CONCLUSIONS: A neural network based on kinematic data is an excellent predictive model for classification of lower back pain. Such a system could markedly improve the management of lower back pain in the individual patient.

Adult↗

Training Dynamics and Neural Network Performance.

We use an analysis of a simple model of recurrent network dynamics to gain qualitative insights into the training dynamics of feedforward multilayer perceptrons (MLPs) used for classification. These insights suggest changes to the training methods used for MLPs that improve network performance significantly. In previous work, the probabilistic neural network (PNN) was shown to provide better zero-reject error performance on character and fingerprint classification problems than radial basis function and MLP-based neural network methods. We will show that performance equal to or better than PNN can be achieved with a single three-layer MLP by making fundamental changes in the network optimization strategy. These changes are: 1) use of neuron activation functions, which reduce the probability of singular Jacobians; 2) use of successive regularization to constrain the volume of the minimized weight space; 3) use of Boltzmann pruning to constrain the dimension of the weight space; 4) use of Prior class probabilities to normalize all error calculations, so that statistically significant samples of rare but important classes can be included without distorting the error surface. All four of these changes are made in the inner loop of a conjugate gradient optimization iteration and are intended to simplify the training dynamics of the optimization. On handprinted digits and fingerprint classification problems these modifications improve error-reject performance by factors between 2 and 4, and reduce network size by 40-60%. Copyright 1997 Elsevier Science Ltd.

Journal Article↗

Prediction of toxicity using a novel RBF neural network training methodology.

A neural network methodology based on the radial basis function (RBF) architecture is introduced in order to establish quantitative structure-toxicity relationship models for the prediction of toxicity. The dataset used consists of 221 phenols and their corresponding toxicity values to Tetrahymena pyriformis. Physicochemical parameters and molecular descriptors are used to provide input information to the models. The performance and predictive abilities of the RBF models are compared to standard multiple linear regression (MLR) models. The leave-one-out cross validation procedure and validation through an external test set produce statistically significant R2 and RMS values for the RBF models, which prove considerably more accurate than the MLR models. [Figure: see text].

Animals↗

A fast and accurate online sequential learning algorithm for feedforward networks.

In this paper, we develop an online sequential learning algorithm for single hidden layer feedforward networks (SLFNs) with additive or radial basis function (RBF) hidden nodes in a unified framework. The algorithm is referred to as online sequential extreme learning machine (OS-ELM) and can learn data one-by-one or chunk-by-chunk (a block of data) with fixed or varying chunk size. The activation functions for additive nodes in OS-ELM can be any bounded nonconstant piecewise continuous functions and the activation functions for RBF nodes can be any integrable piecewise continuous functions. In OS-ELM, the parameters of hidden nodes (the input weights and biases of additive nodes or the centers and impact factors of RBF nodes) are randomly selected and the output weights are analytically determined based on the sequentially arriving data. The algorithm uses the ideas of ELM of Huang et al. developed for batch learning which has been shown to be extremely fast with generalization performance better than other batch training methods. Apart from selecting the number of hidden nodes, no other control parameters have to be manually chosen. Detailed performance comparison of OS-ELM is done with other popular sequential learning algorithms on benchmark problems drawn from the regression, classification and time series prediction areas. The results show that the OS-ELM is faster than the other sequential algorithms and produces better generalization performance.

Algorithms↗

Applications of neural network analyses to in vivo 1H magnetic resonance spectroscopy of Parkinson disease patients.

PURPOSE: To apply neural network analyses to in vivo magnetic resonance spectra of controls and Parkinson disease (PD) patients for the purpose of classification. MATERIALS AND METHODS: Ninety-seven in vivo proton magnetic resonance spectra of the basal ganglia were recorded from 31 patients with (PD) and 14 age-matched healthy volunteers on a 1.5-T imager. The PD patients were grouped as follows: probable PD (N = 15), possible PD (N = 11), and atypical PD (N = 5). Total acquisition times of approximately five minutes were achieved with a TE (echo time) of 135 msec, a TR (repetition time) of 2000 msec, and 128 scan averages. Neural network (back propagation, Kohonen, probabilistic, and radial basis function) and related (generative topographic mapping) data analyses were performed. RESULTS: Conventional data analysis showed no statistically significant differences in metabolite ratios based on measuring signal intensities. The trained networks could distinguish control from PD with considerable accuracy (true positive fraction 0.971, true negative fraction 0.933). When four classes were defined, approximately 88% of the predictions were correct. The multivariate analysis indicated metabolic changes in the basal ganglia in PD. CONCLUSION: A variety of neural network and related approaches can be successfully applied to both qualitative visualization and classification of in vivo spectra of PD patients.

Aged↗

Clustering-neural network models for freeway work zone capacity estimation.

Two neural network models, called clustering-RBFNN and clustering-BPNN models, are created for estimating the work zone capacity in a freeway work zone as a function of seventeen different factors through judicious integration of the subtractive clustering approach with the radial basis function (RBF) and the backpropagation (BP) neural network models. The clustering-RBFNN model has the attractive characteristics of training stability, accuracy, and quick convergence. The results of validation indicate that the work zone capacity can be estimated by clustering-neural network models in general with an error of less than 10%, even with limited data available to train the models. The clustering-RBFNN model is used to study several main factors affecting work zone capacity. The results of such parametric studies can assist work zone engineers and highway agencies to create effective traffic management plans (TMP) for work zones quantitatively and objectively.

Cluster Analysis↗

General-purpose computation with neural networks: a survey of complexity theoretic results.

We survey and summarize the literature on the computational aspects of neural network models by presenting a detailed taxonomy of the various models according to their complexity theoretic characteristics. The criteria of classification include the architecture of the network (feedforward versus recurrent), time model (discrete versus continuous), state type (binary versus analog), weight constraints (symmetric versus asymmetric), network size (finite nets versus infinite families), and computation type (deterministic versus probabilistic), among others. The underlying results concerning the computational power and complexity issues of perceptron, radial basis function, winner-take-all, and spiking neural networks are briefly surveyed, with pointers to the relevant literature. In our survey, we focus mainly on the digital computation whose inputs and outputs are binary in nature, although their values are quite often encoded as analog neuron states. We omit the important learning issues.

Algorithms↗

Classification of impulse radar waveforms using neural networks.

In this paper, it is demonstrated that multilayer neural networks, trained with the backpropagation algorithm and radial basis functions, can classify impulse radar waveforms from three different asphalt-covered bridge decks, each with its own structure. It might be thought that the thickness of asphalt and the depth of concrete over the reinforcing bars would be nearly constant for any one bridge deck; however in practice this is not the case. There are often significant changes in the thickness of the asphalt and the cover over reinforcement. Furthermore, a certain amount of damage to the concrete caused by severe winter climate often produces a random variation in the reflected waveforms obtained from different locations. These factors lead to a significant number of combinations of waveforms that can be obtained from any given structural type of deck. The classification accuracies achieved ranged between 89.9% and 100%. The accuracies achieved after using principal components analysis to reduce the dimensionality of the input data ranged between 95.6% and 100%.

Algorithms↗

Regression techniques for the prediction of lower limb kinematics.

This work presents a novel and extensive investigation of mathematical regression techniques, for the prediction of laboratory-type kinematic measurements during human gait, from wearable measurement devices, such as gyroscopes and accelerometers. Specifically, we examine the hypothesis of predicting the segmental angles of the legs (left and right foot, shank and thighs), from rotational foot velocities and translational foot accelerations. This first investigation is based on kinematic data emulated from motion-capture laboratory equipment. We employ eight established regression algorithms with different properties, ranging from linear methods and neural networks with polynomial support and expanded nonlinearities, to radial basis functions, nearest neighbors and kernel density methods. Data from five gait cycles of eight subjects are used to perform both inter-subject and intra-subject assessments of the prediction capabilities of each algorithm, using cross-validation resampling methods. Regarding the algorithmic suitability to gait prediction, results strongly indicate that nonparametric methods, such as nearest neighbors and kernel density based, are particularly advantageous. Numerical results show high average prediction accuracy (rho = 0.98/0.99, RMS = 5.63 degrees/2.30 degrees, MAD = 4.43 degrees/1.52 degrees for inter/intra-subject testing). The presented work provides a promising and motivating investigation on the feasibility of cost-effective wearable devices used to acquire large volumes of data that are currently collected only from complex laboratory environments.

Adult↗

Classification of MCA stenosis in diabetes by MLP and RBF neural network.

For the classification of Middle Cerebral Artery (MCA) stenosis, Doppler signals have been received from the diabetes and control group by using 2 MHz Transcranial Doppler. After the Fast Fourier Transform (FFT) analyses of the Doppler signals, Power Spectrum Density (PSD) estimations have been made and Multilayer Perceptron (MLP) and Radial Basis Function (RBF) have been dealt to apply to the neural networks. PSD estimations of Doppler signals received from MCA of 104 subjects have been successfully classified by MLP (correct classification = 94.2%) and RBF (correct classification = 88.4%) neural network. As we have seen in the area under ROC curve (AUC), MLP neural network (AUC = 0.934) has classified more successfully when compared with RBF neural network (AUC = 0.873).

Brain↗

Boosting accuracy of automated classification of fluorescence microscope images for location proteomics.

BACKGROUND: Detailed knowledge of the subcellular location of each expressed protein is critical to a full understanding of its function. Fluorescence microscopy, in combination with methods for fluorescent tagging, is the most suitable current method for proteome-wide determination of subcellular location. Previous work has shown that neural network classifiers can distinguish all major protein subcellular location patterns in both 2D and 3D fluorescence microscope images. Building on these results, we evaluate here new classifiers and features to improve the recognition of protein subcellular location patterns in both 2D and 3D fluorescence microscope images. RESULTS: We report here a thorough comparison of the performance on this problem of eight different state-of-the-art classification methods, including neural networks, support vector machines with linear, polynomial, radial basis, and exponential radial basis kernel functions, and ensemble methods such as AdaBoost, Bagging, and Mixtures-of-Experts. Ten-fold cross validation was used to evaluate each classifier with various parameters on different Subcellular Location Feature sets representing both 2D and 3D fluorescence microscope images, including new feature sets incorporating features derived from Gabor and Daubechies wavelet transforms. After optimal parameters were chosen for each of the eight classifiers, optimal majority-voting ensemble classifiers were formed for each feature set. Comparison of results for each image for all eight classifiers permits estimation of the lower bound classification error rate for each subcellular pattern, which we interpret to reflect the fraction of cells whose patterns are distorted by mitosis, cell death or acquisition errors. Overall, we obtained statistically significant improvements in classification accuracy over the best previously published results, with the overall error rate being reduced by one-third to one-half and with the average accuracy for single 2D images being higher than 90% for the first time. In particular, the classification accuracy for the easily confused endomembrane compartments (endoplasmic reticulum, Golgi, endosomes, lysosomes) was improved by 5-15%. We achieved further improvements when classification was conducted on image sets rather than on individual cell images. CONCLUSIONS: The availability of accurate, fast, automated classification systems for protein location patterns in conjunction with high throughput fluorescence microscope imaging techniques enables a new subfield of proteomics, location proteomics. The accuracy and sensitivity of this approach represents an important alternative to low-resolution assignments by curation or sequence-based prediction.

Cell Line, Tumor↗

Mammographic masses characterization based on localized texture and dataset fractal analysis using linear, neural and support vector machine classifiers.

OBJECTIVE: Localized texture analysis of breast tissue on mammograms is an issue of major importance in mass characterization. However, in contrast to other mammographic diagnostic approaches, it has not been investigated in depth, due to its inherent difficulty and fuzziness. This work aims to the establishment of a quantitative approach of mammographic masses texture classification, based on advanced classifier architectures and supported by fractal analysis of the dataset of the extracted textural features. Additionally, a comparison of the information content of the proposed feature set with that of the qualitative characteristics used in clinical practice by expert radiologists is presented. METHODS AND MATERIAL: An extensive set of textural feature functions was applied to a set of 130 digitized mammograms, in multiple configurations and scales, constructing compact datasets of textural "signatures" for benign and malignant cases of tumors. These quantitative textural datasets were subsequently studied against a set of a thorough and compact list of qualitative texture descriptions of breast mass tissue, normally considered under a typical clinical assessment, in order to investigate the discriminating value and the statistical correlation between the two sets. Fractal analysis was employed to compare the information content and dimensionality of the textural features datasets with the qualitative information provided through medical diagnosis. A wide range of linear and non-linear classification architectures was employed, including linear discriminant analysis (LDA), least-squares minimum distance (LSMD), K-nearest-neighbors (K-nn), radial basis function (RBF) and multi-layer perceptron (MLP) artificial neural network (ANN), as well as support vector machine (SVM) classifiers. The classification process was used as the means to evaluate the inherent quality and informational content of each of the datasets, as well as the objective performance of each of the classifiers themselves in real classification of mammographic breast tumors against verified diagnosis. RESULTS: Textural features extracted at larger scales and sampling box sizes proved to be more content-rich than their equivalents at smaller scales and sizes. Fractal analysis on the dimensionality of the textural datasets verified that reduced subsets of optimal feature combinations can describe the original feature space adequately for classification purposes and at least the same detail and quality as the list of qualitative texture descriptions provided by a human expert. Non-linear classifiers, especially SVMs, have been proven superior to any linear equivalent. Breast mass classification of mammograms, based only on textural features, achieved an optimal score of 83.9%, through SVM classifiers.

Artificial Intelligence↗

Automatic synthesis of synergies for control of reaching--hierarchical clustering.

In this paper we describe a novel method for determining synergies between joint motions in reaching movements by hierarchical clustering. A set of recorded elbow and shoulder trajectories is used in a learning algorithm to determine the relationships between angular velocities at elbow and shoulder joints. The learning algorithm is based on optimal criteria for obtaining the hierarchy of descriptions of movement trajectories. We show that this method finds complex synergism between optimal joint trajectories for a given set of data and angular velocities at the shoulder and elbow joints. Three other machine learning techniques (ML) are used for comparison with our method of hierarchical clustering of trajectories. These MLs are: (1) radial basis functions (RBF), (2) inductive learning (IL), and (3) adaptive-network-based fuzzy inference system (ANFIS). Better error characteristics were obtained using the method of hierarchical clustering in comparison with the other techniques. The advantage of the method of hierarchical clustering with respect to the other MLs is in integrating the spatial and temporal elements of reaching movements. Determination and analysis of spatio-temporal events of movement trajectories is a useful tool in designing control systems for functional electrical stimulation (FES) assisted manipulation.

Algorithms↗

Neural networks with local receptive fields and superlinear VC dimension.

Local receptive field neurons comprise such well-known and widely used unit types as radial basis function (RBF) neurons and neurons with center-surround receptive field. We study the Vapnik-Chervonenkis (VC) dimension of feedforward neural networks with one hidden layer of these units. For several variants of local receptive field neurons, we show that the VC dimension of these networks is superlinear. In particular, we establish the bound Omega(W log k) for any reasonably sized network with W parameters and k hidden nodes. This bound is shown to hold for discrete center-surround receptive field neurons, which are physiologically relevant models of cells in the mammalian visual system, for neurons computing a difference of gaussians, which are popular in computational vision, and for standard RBF neurons, a major alternative to sigmoidal neurons in artificial neural networks. The result for RBF neural networks is of particular interest since it answers a question that has been open for several years. The results also give rise to lower bounds for networks with fixed input dimension. Regarding constants, all bounds are larger than those known thus far for similar architectures with sigmoidal neurons. The superlinear lower bounds contrast with linear upper bounds for single local receptive field neurons also derived here.

Algorithms↗

Detection and classification of organophosphate nerve agent simulants using support vector machines with multiarray sensors.

The need for rapid and accurate detection systems is expanding and the utilization of cross-reactive sensor arrays to detect chemical warfare agents in conjunction with novel computational techniques may prove to be a potential solution to this challenge. We have investigated the detection, prediction, and classification of various organophosphate (OP) nerve agent simulants using sensor arrays with a novel learning scheme known as support vector machines (SVMs). The OPs tested include parathion, malathion, dichlorvos, trichlorfon, paraoxon, and diazinon. A new data reduction software program was written in MATLAB V. 6.1 to extract steady-state and kinetic data from the sensor arrays. The program also creates training sets by mixing and randomly sorting any combination of data categories into both positive and negative cases. The resulting signals were fed into SVM software for "pairwise" and "one" vs all classification. Experimental results for this new paradigm show a significant increase in classification accuracy when compared to artificial neural networks (ANNs). Three kernels, the S2000, the polynomial, and the Gaussian radial basis function (RBF), were tested and compared to the ANN. The following measures of performance were considered in the pairwise classification: receiver operating curve (ROC) Az indices, specificities, and positive predictive values (PPVs). The ROC Az) values, specifities, and PPVs increases ranged from 5% to 25%, 108% to 204%, and 13% to 54%, respectively, in all OP pairs studied when compared to the ANN baseline. Dichlorvos, trichlorfon, and paraoxon were perfectly predicted. Positive prediction for malathion was 95%.

Journal Article↗

Use of artificial neural networks in near-infrared reflectance spectroscopy calibrations for predicting the inclusion percentages of wheat and sunflower meal in compound feedingstuffs.

The use of near-infrared reflectance spectroscopy (NIRS) calibrations to predict the ingredient composition in compound feeds (i.e., inclusion percentage of each ingredient) is a complex task, regarding both the nature of the parameters to be predicted, since they are not well-defined chemical entities, and the heterogeneousness of the matrices/formulas in which each ingredient participates. The present paper evaluates the use of nonlinear regression methods, such as artificial neural networks (ANN), for developing NIRS calibrations to predict these parameters. Two of the most representative ingredients in the Spanish compound feed formulations (wheat and sunflower meal) were selected for evaluating ANN possibilities, using a large spectral library comprising a total of 7523 commercial compound feed samples; 7423 were used as training set and 100 as validation set. Three general models of networks were studied: multilayer perceptron with back-propagation training (BP), multilayer perceptron with Levenberg-Maquartd training (LM), and radial basis function nets (RBF); moreover, in accordance with a factorial design, more complex architectures were evaluated gradually, changing the number of hidden layers and hidden neurons, for the determination of the optimal network topology. For both ingredients, the best results were obtained using ANN with BP training, showing prediction error values (SEP) of 2.72% and 0.66% for wheat and sunflower meal, respectively. These SEP values showed a significant improvement (19%-49% for sunflower meal and wheat, respectively) in comparison with those obtained using calibrations developed with linear methods.

Animal Feed↗

Indirect adaptive control for synchronous generator: comparison of MLP/RBF neural networks approach with Lyapunov stability analysis.

This paper compares two indirect adaptive neurocontrollers, namely a multilayer perceptron neurocontroller (MLPNC) and a radial basis function neurocontroller (RBFNC) to control a synchronous generator. The different damping and transient performances of two neurocontrollers are compared with those of conventional linear controllers, and analyzed based on the Lyapunov direct method.

Neural Networks, Computer↗