SEARCH · PubMed Health

Results for “Neural Networks, Computer”

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 775 records · Page 43Linked to original sources

PubMed2003

Breast lesions on sonograms: computer-aided diagnosis with nearly setting-independent features and artificial neural networks.

PURPOSE: To develop a computer-aided diagnosis (CAD) algorithm with setting-independent features and artificial neural networks to differentiate benign from malignant breast lesions. MATERIALS AND METHODS: Two sets of breast sonograms were evaluated. The first set contained 160 lesions and was stored directly on the magnetic optic disks from the ultrasonographic (US) system. Four different boundaries were delineated by four persons for each lesion in the first set. The second set comprised 111 lesions that were extracted from the hard-copy images. Seven morphologic features were used, five of which were newly developed. A multilayer feed-forward neural network was used as the classifier. Reliability, extendability, and robustness of the proposed CAD algorithm were evaluated. Results with the proposed algorithm were compared with those with two previous CAD algorithms. All performance comparisons were based on paired-samples t tests. RESULTS: The area under the receiver operating characteristic curve (A(z)) was 0.952 +/- 0.014 for the first set, 0.982 +/- 0.004 for the first set as the training set and the second set as the prediction set, 0.954 +/- 0.016 for the second set as the training set and the first set as the prediction set, and 0.950 +/- 0.005 for all 271 lesions. At the 5% significance level, the performance of the proposed CAD algorithm was shown to be extendible from one set of US images to the other set and robust for both small and large sample sizes. Moreover, the proposed CAD algorithm was shown to outperform the two previous CAD algorithms in terms of the A(z) value. CONCLUSION: The proposed CAD algorithm could effectively and reliably differentiate benign and malignant lesions. The proposed morphologic features were nearly setting independent and could tolerate reasonable variation in boundary delineation.

Adolescent↗

PubMed1997

Modeling neural mechanisms for genesis of respiratory rhythm and pattern. I. Models of respiratory neurons.

The general objectives of our research, presented in this series of papers, were to develop a computational model of the brain stem respiratory neural network and to explore possible neural mechanisms that provide the genesis of respiratory oscillations and the specific firing patterns of respiratory neurons. The present paper describes models of single respiratory neurons that have been used as the elements in our network models of the central respiratory pattern generator presented in subsequent papers. The models of respiratory neurons were developed in the Hodgkin-Huxley style employing both physiological and biophysical data obtained from brain stem neurons in mammals. Two single respiratory neuron models were developed to match the two distinct firing behaviors of respiratory neurons described in vivo: neuron type I shows an adapting firing pattern in response to synaptic excitation, and neuron type II shows a ramp firing pattern during membrane depolarization after a period of synaptic inhibition. We found that a frequency ramp firing pattern can result from intrinsic membrane properties, specifically from the combined influence of calcium-dependent K(AHP)(Ca), low-threshold Ca(T) and K(A) channels. The neuron models with these ionic channels (type II) demonstrated ramp firing patterns similar to those recorded from respiratory neurons in vivo. Our simulations show that K(AHP)(Ca) channels in combination with high-threshold Ca(L) channels produce spike frequency adaptation during synaptic excitation. However, in combination with low-threshold Ca(T) channels, they cause a frequency ramp firing response after release from inhibition. This promotes a testable hypothesis that the main difference between the respiratory neurons that adapt (for example, early inspiratory, postinspiratory, and decrementing expiratory) and those that show ramp firing patterns (for example, ramp inspiratory and augmenting expiratory) consists of a ratio between the two types of calcium channels: Ca(L) channels predominate in the former and Ca(T) channels in the latter respiratory neuron types. We have analyzed the dependence of adapting and ramp firing patterns on maximal conductances of different ionic channels and values of synaptic drive. The effect of adjusting specific membrane conductances and synaptic interactions revealed plausible neuronal mechanisms that may underlie modulatory effects on respiratory neuron firing patterns and network performances. The results of computer simulation provide useful insight into functional significance of specific intrinsic membrane properties and their interactions with phasic synaptic inputs for a better understanding of respiratory neuron firing behavior.

Adaptation, Physiological↗

PubMed2001

Neural network comparing two-rate-encoded inputs entering in parallel.

Presented computational model of a neural network is able to compare two regular input frequencies. The comparison is based on detection of inter-spike interval differences of the two frequencies. This detection is continuous and the network dynamically changes its output according to the changes in the input frequencies. The entire network is composed of biologically plausible parts. A combination of such simple comparators might be involved in the information processing in the central nervous system.

Animals↗

PubMed1997

Adaptation to the driver as part of a driver monitoring and warning system.

A driver monitoring and warning system called DAISY (Driver AssIsting SYstem) is presented, which adapts its warning messages to warning thresholds acceptable to the driver. This is achieved by the use of a model of the individual driving behaviour of the driver actually driving. Artificial neural networks based on the ART architectures were used for on-line learning to realize this model. Besides a brief survey of the main features of DAISY this paper emphasizes the modelling of the driving behaviour with ART networks. The way the ART networks are adapted to the problem is described. This includes the realization of a hierarchical ART structure and of a situation specific weighting of the components of the feature vector. The network parameters were adjusted through genetic algorithm optimization.

Accidents, Traffic↗

PubMed2002

Modelling large scale neuronal networks using 'average neurones'.

Large scale neuronal network models have become important tools in studying the information transmission within the CNS. In most cases, these models use simplifying assumptions because of unavailable data (e.g. unknown exact network connectivity), and for technical reasons (to preserve numerical stability of the model). Here, we present a novel approach, based on a probabilistic connectivity principle, to this modelling problem for which no knowledge of the exact network connectivity is required. This principle makes it sufficient to compute only the typical neuronal behaviour, represented by 'average neurones', in the network. As a consequence, detailed neurone models can be employed without seriously compromising computational efficiency. Our model thus provides a viable alternative to deterministic models.

Action Potentials↗

PubMed2004

A biologically motivated neural network for phase extraction from complex sounds.

We demonstrate that natural acoustic signals like speech or music contain synchronous phase information across multiple frequency bands and show how to extract this information using a spiking neural network. This network model is motivated by common neurophysiological findings in the auditory brainstem and midbrain of several species. A computer simulation of the model was tested by applying spoken vowels and organ pipe tones. As expected, spikes occurred synchronously in the activated frequency bands. This phase information may be used for sound separation with one microphone or sound localization with two microphones.

Acoustic Stimulation↗

PubMed2005

Global exponential convergence of Cohen-Grossberg neural networks with time delays.

In this paper, we derive a general sufficient condition ensuring global exponential convergence of Cohen-Grossberg neural networks with time delays by constructing a novel Lyapunov functional and smartly estimating its derivative. The proposed condition is related to the convex combinations of the column-sum and the row-sum of the connection matrices and also relaxes the constraints on the network coefficients. Therefore, the proposed condition generalizes some previous results in the literature.

Algorithms↗

PubMed2001

Introduction to artificial neural networks for physicians: taking the lid off the black box.

BACKGROUND: Over the past 5 years, a steady stream of publications has discussed the use of artificial neural networks (ANNs) for urologic and other medical applications. The pace of this research has increased recently, and deployed products based on this technology are now appearing. Before these tools can be widely accepted by clinicians and researchers, a deeper level of understanding of ANNs is necessary. This article attempts to lay some of the groundwork needed to facilitate this familiarity. METHODS: A short discussion of neural network history is included for background. This is followed by an in-depth discussion of how and why ANNs work. This discussion includes the relationship between ANNs and statistical regression. An investigation of issues associated with neural networks follows, applicable to both general and urologic-specific applications. RESULTS: Neural networks are computer models that have been studied extensively for over 50 years, with prostate cancer applications since 1994. From a biological viewpoint, ANNs are artificial analogues of data structures that exist in nervous systems. From a numeric viewpoint, ANNs are matrices of numbers whose values comprise knowledge that is distilled from historic databases. Many types of neural networks are analogous to well-known statistical methods. CONCLUSIONS: ANNs are complex numeric constructs, but no more complex than similar statistical methods. However, several issues associated with neural network derivation demand that developers apply rigorous engineering practices in their studies.

Humans↗

PubMed1995

Escherichia coli O157:H7 restriction pattern recognition by artificial neural network.

An artificial neural network model for the recognition of Escherichia coli O157:H7 restriction patterns was designed. In the training phase, images of two classes of E. coli isolates (O157:H7 and non-O157:H7) were digitized and transmitted to the neural network. The system was then tested for recognition of images not included in the training set. Promising results were achieved with the designed network configuration, providing a basis for further study. This application of a new generation of computation technology serves as an example of its usefulness in microbiology.

Animals↗

PubMed2006

Analytical integrate-and-fire neuron models with conductance-based dynamics for event-driven simulation strategies.

Event-driven simulation strategies were proposed recently to simulate integrate-and-fire (IF) type neuronal models. These strategies can lead to computationally efficient algorithms for simulating large-scale networks of neurons; most important, such approaches are more precise than traditional clock-driven numerical integration approaches because the timing of spikes is treated exactly. The drawback of such event-driven methods is that in order to be efficient, the membrane equations must be solvable analytically, or at least provide simple analytic approximations for the state variables describing the system. This requirement prevents, in general, the use of conductance-based synaptic interactions within the framework of event-driven simulations and, thus, the investigation of network paradigms where synaptic conductances are important. We propose here a number of extensions of the classical leaky IF neuron model involving approximations of the membrane equation with conductance-based synaptic current, which lead to simple analytic expressions for the membrane state, and therefore can be used in the event-driven framework. These conductance-based IF (gIF) models are compared to commonly used models, such as the leaky IF model or biophysical models in which conductances are explicitly integrated. All models are compared with respect to various spiking response properties in the presence of synaptic activity, such as the spontaneous discharge statistics, the temporal precision in resolving synaptic inputs, and gain modulation under in vivo-like synaptic bombardment. Being based on the passive membrane equation with fixed-threshold spike generation, the proposed gIF models are situated in between leaky IF and biophysical models but are much closer to the latter with respect to their dynamic behavior and response characteristics, while still being nearly as computationally efficient as simple IF neuron models. gIF models should therefore provide a useful tool for efficient and precise simulation of large-scale neuronal networks with realistic, conductance-based synaptic interactions.

Action Potentials↗

PubMed2005

Systematic identification of statistically significant network measures.

We present a graph embedding space (i.e., a set of measures on graphs) for performing statistical analyses of networks. Key improvements over existing approaches include discovery of "motif hubs" (multiple overlapping significant subgraphs), computational efficiency relative to subgraph census, and flexibility (the method is easily generalizable to weighted and signed graphs). The embedding space is based on scalars, functionals of the adjacency matrix representing the network. Scalars are global, involving all nodes; although they can be related to subgraph enumeration, there is not a one-to-one mapping between scalars and subgraphs. Improvements in network randomization and significance testing--we learn the distribution rather than assuming Gaussianity--are also presented. The resulting algorithm establishes a systematic approach to the identification of the most significant scalars and suggests machine-learning techniques for network classification.

Algorithms↗

PubMedDate not supplied

[Does the computer act like the braine, or like any biological cell?].

A new conception of computer functioning is proposed, which suggests that a computer is a reactor in which a unique enzymic reaction at a single operation mode occurs. The analogy between informatics and enzymology is considered. In the context of the parallelism proposed, the work of the brain is analogous to the work of a global computer network. Not the brain as a network of neuron processors but a network of computers as the brain!

Brain↗

PubMed2006

Computation of madalines' sensitivity to input and weight perturbations.

The sensitivity of a neural network's output to its input and weight perturbations is an important measure for evaluating the network's performance. In this letter, we propose an approach to quantify the sensitivity of Madalines. The sensitivity is defined as the probability of output deviation due to input and weight perturbations with respect to overall input patterns. Based on the structural characteristics of Madalines, a bottom-up strategy is followed, along which the sensitivity of single neurons, that is, Adalines, is considered first and then the sensitivity of the entire Madaline network. By means of probability theory, an analytical formula is derived for the calculation of Adalines' sensitivity, and an algorithm is designed for the computation of Madalines' sensitivity. Computer simulations are run to verify the effectiveness of the formula and algorithm. The simulation results are in good agreement with the theoretical results.

Animals↗

PubMedDate not supplied

The control of a parallel hybrid-electric propulsion system for a small unmanned aerial vehicle using a CMAC neural network.

A Simulink model, a propulsion energy optimization algorithm, and a CMAC controller were developed for a small parallel hybrid-electric unmanned aerial vehicle (UAV). The hybrid-electric UAV is intended for military, homeland security, and disaster-monitoring missions involving intelligence, surveillance, and reconnaissance (ISR). The Simulink model is a forward-facing simulation program used to test different control strategies. The flexible energy optimization algorithm for the propulsion system allows relative importance to be assigned between the use of gasoline, electricity, and recharging. A cerebellar model arithmetic computer (CMAC) neural network approximates the energy optimization results and is used to control the parallel hybrid-electric propulsion system. The hybrid-electric UAV with the CMAC controller uses 67.3% less energy than a two-stroke gasoline-powered UAV during a 1-h ISR mission and 37.8% less energy during a longer 3-h ISR mission.

Algorithms↗

PubMed2004

An efficient sequential learning algorithm for growing and pruning RBF (GAP-RBF) networks.

This paper presents a simple sequential growing and pruning algorithm for radial basis function (RBF) networks. The algorithm referred to as growing and pruning (GAP)-RBF uses the concept of "Significance" of a neuron and links it to the learning accuracy. "Significance" of a neuron is defined as its contribution to the network output averaged over all the input data received so far. Using a piecewise-linear approximation for the Gaussian function, a simple and efficient way of computing this significance has been derived for uniformly distributed input data. In the GAP-RBF algorithm, the growing and pruning are based on the significance of the "nearest" neuron. In this paper, the performance of the GAP-RBF learning algorithm is compared with other well-known sequential learning algorithms like RAN, RANEKF, and MRAN on an artificial problem with uniform input distribution and three real-world nonuniform, higher dimensional benchmark problems. The results indicate that the GAP-RBF algorithm can provide comparable generalization performance with a considerably reduced network size and training time.

Algorithms↗

PubMed1995

Prediction of protein folding class using global description of amino acid sequence.

We present a method for predicting protein folding class based on global protein chain description and a voting process. Selection of the best descriptors was achieved by a computer-simulated neural network trained on a data base consisting of 83 folding classes. Protein-chain descriptors include overall composition, transition, and distribution of amino acid attributes, such as relative hydrophobicity, predicted secondary structure, and predicted solvent exposure. Cross-validation testing was performed on 15 of the largest classes. The test shows that proteins were assigned to the correct class (correct positive prediction) with an average accuracy of 71.7%, whereas the inverse prediction of proteins as not belonging to a particular class (correct negative prediction) was 90-95% accurate. When tested on 254 structures used in this study, the top two predictions contained the correct class in 91% of the cases.

Amino Acid Sequence↗

PubMed2005

Exponential stability of impulsive high-order Hopfield-type neural networks with time-varying delays.

This paper considers the problems of global exponential stability and exponential convergence rate for impulsive high-order Hopfield-type neural networks with time-varying delays. By using the method of Lyapunov functions, some sufficient conditions for ensuring global exponential stability of these networks are derived, and the estimated exponential convergence rate is also obtained. As an illustration, an numerical example is worked out using the results obtained.

Algorithms↗

PubMed2003

A SOM projection technique with the growing structure for visualizing high-dimensional data.

The Self-Organizing Map (SOM) is an efficient tool for visualizing high-dimensional data. In this paper, an intuitive and effective SOM projection method is proposed for mapping high-dimensional data onto the two-dimensional grid structure with a growing self-organizing mechanism. In the learning phase, a growing SOM is trained and the growing cell structure is used as the baseline framework. In the ordination phase, the new projection method is used to map the input vector so that the input data is mapped to the structure of the SOM without having to plot the weight values, resulting in easy visualization of the data. The projection method is demonstrated on four different data sets, including a 118 patent data set and a 399 checical abstract data set related to polymer cements, with promising results and a significantly reduced network size.

Algorithms↗