PubMed Health⌕ Search

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 1,513 records · Page 84Linked to original sources

A competitive neural model of small number detection.

The ability to represent numbers is a key attribute for both humans and animals. Recent developments in the understanding of numerical processing has led to the proposal that humans utilise two independent representations of number, one for real numbers and another for integers. We describe a computational model of small number detection to explore the relationship between these core systems of number. We use a combination of unsupervised and supervised neural networks to simulate the interaction between the real and integer representations. For real values we use a self-organised spatial representation of number. For integer values we use a supervised network motivated by linguistic processing. During training and testing, the networks exhibit behavioural characteristics such as the number size and numerical distance effects. Each representation is combined using the mixture-of-experts architecture that allows us to model the subitization limit (the maximum number of visual stimuli that can be accurately quantified almost immediately) as the competitive allocation of representations for number detection, where the crossover point between deploying the real and integer representations of number is obtained through a process of learning. Our results suggest that the existence of two core systems of number is at least computationally plausible and further suggests that the subitization limit emerges through the interaction of spatial and linguistic numerical processing. This provides computational evidence for one way in which small and large numbers are related in humans.

Animals↗

2D Autocorrelation modeling of the negative inotropic activity of calcium entry blockers using Bayesian-regularized genetic neural networks.

Negative inotropic potency of 60 benzothiazepine-like calcium entry blockers (CEBs), Diltiazem analogs, was successfully modeled using Bayesian-regularized genetic neural networks (BRGNNs) and 2D autocorrelation vectors. This approach yielded reliable and robust models whilst by means of a linear genetic algorithm (GA) search routine no multilinear regression model was found describing more than 50% of the training set. On the contrary, the optimum neural network predictor with five inputs described about 84% and 65% variances of 50 randomly selected training and test sets. Autocorrelation vectors in the nonlinear model contained information regarding 2D spatial distributions on the CEB structure of van der Waals volumes, electronegativities, and polarizabilities. However, a sensitivity analysis of the network inputs pointed out to the electronegativity and polarizability 2D topological distributions at substructural fragments of sizes 3 and 4 as the most relevant features governing the nonlinear modeling of the negative inotropic potency.

Bayes Theorem↗

Global asymptotic stability analysis of bidirectional associative memory neural networks with time delays.

This paper presents a sufficient condition for the existence, uniqueness and global asymptotic stability of the equilibrium point for bidirectional associative memory (BAM) neural networks with distributed time delays. The results impose constraint conditions on the network parameters of neural system independently of the delay parameter, and they are applicable to all continuous nonmonotonic neuron activation functions. It is shown that in some special cases of the results, the stability criteria can be easily checked. Some examples are also given to compare the results with the previous results derived in the literature.

Algorithms↗

Pattern recognition for automated DNA sequencing: I. On-line signal conditioning and feature extraction for basecalling.

The massive scale of DNA sequencing for the Human Genome Initiative compels efforts to reduce the cost and increase the throughput of DNA sequencing technology. Contemporary automated DNA sequencing systems do not yet meet estimated performance requirements for cost-effective and timely completion of this project. Greater accuracy of basecalling software would minimize manual review and editing of basecalling results, and facilitate assembly of primary sequences to large contig(uous) arrays. In this report we describe a neural network model for photometric signal conditioning during raw data acquisition with an automated DNA sequencer. This network supports on-line extraction and evaluation of informative arrays of oligomer separations and yields, as a feature table for accurate, real-time basecalling.

Automation↗

[Collective properties of the mutual-learned neuronal net systems in the information field].

Model of neural networks system, in which networks interact by transmission and associative recognition of signals, is studied by computer simulation and qualitative approach. System behavior depends on the value of learning parameter epsilon, which determines the weight of writing in memory of each network every transmissible signal. Two different regimes are found: regime of auto-governed behavior, which depends only on initial networks characteristics, and regime of collective recognition of initial signal in form of a certain stable signals cycle. Analogy of this model and Aigen's hypercycle, the problem of creation of some new information in this model are discussed, too.

Artificial Intelligence↗

Effects of inhibitory feedback in a network model of avian brain stem.

The avian auditory brain stem consists of a network of specialized nuclei, including nucleus laminaris (NL) and superior olivary nucleus (SON). NL cells show sensitivity to interaural time difference (ITD), a critical cue that underlies spatial hearing. SON cells provide inhibitory feedback to the rest of the network. Empirical data suggest that feedback inhibition from SON could increase the ITD sensitivity of NL across sound level. Using a bilateral network model, we assess the effects of SON feedback inhibition. Individual cells are specified as modified leaky-integrate-and-fire neurons with time constants and thresholds that vary with inhibitory input. Acoustic sound level is reflected in the discharge rates of the model auditory-nerve fibers, which innervate the network. Simulations show that with SON inhibitory feedback, ITD sensitivity is maintained in model NL cells over a threefold range in auditory-nerve discharge rate. In contrast, without SON feedback inhibition, ITD sensitivity is significantly reduced as input rates are increased. Feedback inhibition is most beneficial in maintaining ITD sensitivity at high-input rates (simulating high sound levels). With SON inhibition, ITD sensitivity is maintained for both interaurally balanced inputs (simulating an on-center sound source) and interaurally imbalanced inputs (simulating a lateralized source). Further, the empirically observed temporal build-up of SON inhibition and the presence of reciprocal inhibitory connections between the ipsi- and contralateral SON both improve ITD sensitivity. In sum, our network model shows that inhibitory feedback can substantially increase the sensitivity and dynamic range of ITD coding in the avian auditory brain stem.

Action Potentials↗

Prediction of seizure onset in an in-vitro hippocampal slice model of epilepsy using Gaussian-based and wavelet-based artificial neural networks.

We propose that artificial neural networks (ANNs) can be used to predict seizure onsets in an in-vitro hippocampal slice model capable of generating spontaneous seizure-like events (SLEs) in their extracellular field recordings. This paper assesses the effectiveness of two ANN prediction schemes: Gaussian-based artificial neural network (GANN) and wavelet-based artificial neural network (WANN). The GANN prediction system consists of a recurrent network having Gaussian radial basis function (RBF) nonlinearities capable of extracting the estimated manifold of the system. It is able to classify the underlying dynamics of spontaneous in-vitro activities into interictal, preictal and ictal modes. It is also able to successfully predict the onsets of SLEs as early as 60 s before. Improvements can be made to the overall seizure predictor design by incorporating time-varying frequency information. Consequently, the idea of WANN is considered. The WANN design entails the assumption that frequency variations in the extracellular field recordings can be used to compute the times at which onsets of SLEs are most likely to occur in the future. Progressions of different frequency components can be captured by the ANN using appropriate frequency band adjustments via pruning, after the initial wavelet transforms. In the off-line processing comprised of 102 spontaneous SLEs generated from 14 in-vitro rat hippocampal slices, with half of them used for training and the other half for testing, the WANN is able to predict the forecoming ictal onsets as early as 2 min prior to SLEs with over 75% accuracy within a 30 s precision window.

Animals↗

Two-state membrane potential fluctuations driven by weak pairwise correlations.

Physiological experiments demonstrate the existence of weak pairwise correlations of neuronal activity in mammalian cortex (Singer, 1993). The functional implications of this correlated activity are hotly debated (Roskies et al., 1999). Nevertheless, it is generally considered a widespread feature of cortical dynamics. In recent years, another line of research has attracted great interest: the observation of a bimodal distribution of the membrane potential defining up states and down states at the single cell level (Wilson & Kawaguchi, 1996; Steriade, Contreras, & Amzica, 1994; Contreras & Steriade, 1995; Steriade, 2001). Here we use a theoretical approach to demonstrate that the latter phenomenon is a natural consequence of the former. In particular, we show that weak pairwise correlations of the inputs to a compartmental model of a layer V pyramidal cell can induce bimodality in its membrane potential. We show how this relationship can account for the observed increase of the power in the gamma-frequency band during up states, as well as the increase in the standard deviation and fraction of time spent in the depolarized state (Anderson, Lampl, Reichova, Carandini, & Ferster, 2000). In order to quantify the relationship between the correlation properties of a cortical network and the bistable dynamics of single neurons, we introduce a number of new indices. Subsequently, we demonstrate that a quantitative agreement with the experimental data can be achieved, introducing voltage-dependent mechanisms in our neuronal model such as Ca(2+)- and Ca(2+)-dependent K(+) channels. In addition, we show that the up states and down states of the membrane potential are dependent on the dendritic morphology of cortical neurons. Furthermore, bringing together network and single cell dynamics under a unified view allows the direct transfer of results obtained in one context to the other and suggests a new experimental paradigm: the use of specific intracellular analysis as a powerful tool to reveal the properties of the correlation structure present in the network dynamics.

Algorithms↗

The reentry hypothesis: the putative interaction of the frontal eye field, ventrolateral prefrontal cortex, and areas V4, IT for attention and eye movement.

Attention is known to play a key role in perception, including action selection, object recognition and memory. Despite findings revealing competitive interactions among cell populations, attention remains difficult to explain. The central purpose of this paper is to link up a large number of findings in a single computational approach. Our simulation results suggest that attention can be well explained on a network level involving many areas of the brain. We argue that attention is an emergent phenomenon that arises from reentry and competitive interactions. We hypothesize that guided visual search requires the usage of an object-specific template in prefrontal cortex to sensitize V4 and IT cells whose preferred stimuli match the target template. This induces a feature-specific bias and provides guidance for eye movements. Prior to an eye movement, a spatially organized reentry from occulomotor centers, specifically the movement cells of the frontal eye field, occurs and modulates the gain of V4 and IT cells. The processes involved are elucidated by quantitatively comparing the time course of simulated neural activity with experimental data. Using visual search tasks as an example, we provide clear and empirically testable predictions for the participation of IT, V4 and the frontal eye field in attention. Finally, we explain a possible physiological mechanism that can lead to non-flat search slopes as the result of a slow, parallel discrimination process.

Algorithms↗

Information-theoretic approach to network modularity.

Exploiting recent developments in information theory, we propose, illustrate, and validate a principled information-theoretic algorithm for module discovery and the resulting measure of network modularity. This measure is an order parameter (a dimensionless number between 0 and 1). Comparison is made with other approaches to module discovery and to quantifying network modularity (using Monte Carlo generated Erdös-like modular networks). Finally, the network information bottleneck (NIB) algorithm is applied to a number of real world networks, including the "social" network of co-authors at the 2004 APS March Meeting.

Algorithms↗

Patient-specific anatomic models. Geometric surface generation from three-dimensional medical images using a specified polygonal budget.

Virtual reality offers the promise of highly interactive, natural control of the visualization process, greatly enhancing the scientific value of the data produced by medical imaging systems. Due to the computational and real time update requirements of virtual reality interfaces, however, the complexity of polygonal surfaces which can be displayed is limited. In this paper, we present a novel method for the production of a polygonal surface containing a pre-specified number of polygons from volumetric data. To preserve surface detail, we extract a set of curvature weights from the volumetric data and use these weights as the input vectors to a 2-D Kohonen network. The adaptation of the network to the input vectors results in a display surface that preserves useful detail relative to the number of polygons used.

Computer Simulation↗

Modification of the mean-square error principle to double the convergence speed of a special case of Hopfield neural network used to segment pathological liver color images.

BACKGROUND: This paper analyzes the effect of the mean-square error principle on the optimization process using a Special Case of Hopfield Neural Network (SCHNN). METHODS: The segmentation of multidimensional medical and colour images can be formulated as an energy function composed of two terms: the sum of squared errors, and a noise term used to avoid the network to be stacked in early local minimum points of the energy landscape. RESULTS: Here, we show that the sum of weighted error, higher than simple squared error, leads the SCHNN classifier to reach faster a local minimum closer to the global minimum with the assurance of acceptable segmentation results. CONCLUSIONS: The proposed segmentation method is used to segment 20 pathological liver colour images, and is shown to be efficient and very effective to be implemented for use in clinics.

Algorithms↗

Convergence of stochastic learning in perceptrons with binary synapses.

The efficacy of a biological synapse is naturally bounded, and at some resolution, and is discrete at the latest level of single vesicles. The finite number of synaptic states dramatically reduce the storage capacity of a network when online learning is considered (i.e., the synapses are immediately modified by each pattern): the trace of old memories decays exponentially with the number of new memories (palimpsest property). Moreover, finding the discrete synaptic strengths which enable the classification of linearly separable patterns is a combinatorially hard problem known to be NP complete. In this paper we show that learning with discrete (binary) synapses is nevertheless possible with high probability if a randomly selected fraction of synapses is modified following each stimulus presentation (slow stochastic learning). As an additional constraint, the synapses are only changed if the output neuron does not give the desired response, as in the case of classical perceptron learning. We prove that for linearly separable classes of patterns the stochastic learning algorithm converges with arbitrary high probability in a finite number of presentations, provided that the number of neurons encoding the patterns is large enough. The stochastic learning algorithm is successfully applied to a standard classification problem of nonlinearly separable patterns by using multiple, stochastically independent output units, with an achieved performance which is comparable to the maximal ones reached for the task.

Algorithms↗

Estimation of distribution algorithms with Kikuchi approximations.

The question of finding feasible ways for estimating probability distributions is one of the main challenges for Estimation of Distribution Algorithms (EDAs). To estimate the distribution of the selected solutions, EDAs use factorizations constructed according to graphical models. The class of factorizations that can be obtained from these probability models is highly constrained. Expanding the class of factorizations that could be employed for probability approximation is a necessary step for the conception of more robust EDAs. In this paper we introduce a method for learning a more general class of probability factorizations. The method combines a reformulation of a probability approximation procedure known in statistical physics as the Kikuchi approximation of energy, with a novel approach for finding graph decompositions. We present the Markov Network Estimation of Distribution Algorithm (MN-EDA), an EDA that uses Kikuchi approximations to estimate the distribution, and Gibbs Sampling (GS) to generate new points. A systematic empirical evaluation of MN-EDA is done in comparison with different Bayesian network based EDAs. From our experiments we conclude that the algorithm can outperform other EDAs that use traditional methods of probability approximation in the optimization of functions with strong interactions among their variables.

Algorithms↗

Automatic recognition of small cell carcinoma based on the self-organizing neural network.

In this paper the recognition of Small Cell Carcinoma (SCC) is studied. For each type we select 128 samples for training, and randomly measure 200 cells in each sample. We introduce multi-scale morphology based on centroid coordinates to extract the boundaries of nuclei and obtain feature images of nuclei. The features of lung cancer cells are described by morphological and colorimetrical parameters, which is valuable to recognize SCC. Then the architecture of self-organizing feature mapping (SOFM) neural network is studied for recognition of SCC. The weights of the network are adjusted by self-organizing competition, and finally inputted patterns are classified. This algorithm has the advantage of parallelism and fast-convergence, and may simplify the analysis of SCC. Clinical experiment results show that the correctness ratio of this system may reach 95.3% while recognizing lung cancer cell types. Our work is significant to the pathological researches of lung cancer, assistant clinic diagnosis, and assessment of therapeutic effects. Meanwhile a software system named as SCC. LUNG is established for automatic analysis.

Adult↗

Synapse models for neural networks: from ion channel kinetics to multiplicative coefficient wij.

This paper relates different levels at which the modeling of synaptic transmission can be grounded in neural networks: the level of ion channel kinetics, the level of synaptic conductance dynamics, and the level of a scalar synaptic coefficient. The important assumptions to reduce a synapse model from one level to the next are explicitly exhibited. This coherent progression provides control on what is discarded and what is retained in the modeling process, and is useful to appreciate the significance and limitations of the resulting neural networks. This methodic simplification terminates with a scalar synaptic efficacy as it is very often used in neural networks, but here its conditions of validity are explicitly displayed. This scalar synapse also comes with an expression that directly relates it to basic quantities of synaptic functioning, and it can be endowed with meaningful physical units and realistic numerical values. In addition, it is shown that the scalar synapse does not receive the same expression in neural networks operating with spikes or with firing rates. These coherent modeling elements can help to improve, adjust, and refine the investigation of neural systems and their remarkable collective properties for information processing.

Action Potentials↗

Linear analysis of auto-organization in Hebbian neural networks.

The self-organization of neurotopies where neural connections follow Hebbian dynamics is framed in terms of linear operator theory. A general and exact equation describing the time evolution of the overall synaptic strength connecting two neural laminae is derived. This linear matricial equation, which is similar to the equations used to describe oscillating systems in physics, is modified by the introduction of non-linear terms, in order to capture self-organizing (or auto-organizing) processes. The behavior of a simple and small system, that contains a non-linearity that mimics a metabolic constraint, is analyzed by computer simulations. The emergence of a simple "order" (or degree of organization) in this low-dimensionality model system is discussed.

Computer Simulation↗

Neural networks in radiology: an introduction and evaluation in a signal detection task.

Neural networks are a computer architecture, implementable in software or hardware, that allow an entirely new approach to the computerized perception of data. These so-called connectionist models are inspired by what is known about the architecture of biological neurons, in which the "intelligence" or processing capability of the network is a result of the interconnection strengths between large arrays of nonlinear processing nodes. Neural networks are described and then are used to analyze the common radiological problem of pattern recognition on a noisy background. Classical signal detection theory is used to compare network performance against that of human observers, using computer-generated sets of very simple "nodules." The neural network performed with better accuracy, relative to human observer performance, in the detection of this elementary test object. Although these results may not scale up with more complex images, the favorable performance of neural networks at this level suggests that further investigation is warranted.

Artificial Intelligence↗