Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “Networks”

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 757 records · Page 42Linked to original sources

Recurrent neural networks for predicting outcomes after liver transplantation: representing temporal sequence of clinical observations.

OBJECTIVES: This paper investigates a version of recurrent neural network with the backpropagation through time (BPTT) algorithm for predicting liver transplant graft failure based on a time series sequence of clinical observations. The objective is to improve upon the current approaches to liver transplant outcome prediction by developing a more complete model that takes into account not only the preoperative risk assessment, but also the early postoperative history. METHODS: A 6-fold cross-validation procedure was used to measure the performance of the networks. The data set was divided into a learning set and a test set by maintaining the same proportion of positive and negative cases in the original set. The effects of network complexity on overfitting were investigated by constructing two types of networks with different numbers of hidden units. For each type of network, 10 individual networks were trained on the learning set and used to form a committee. The performance of the networks was measured exhaustively with respect to both the entire training and test sets. RESULTS: The networks were capable of learning the time series problem and achieved good performances of 90% correct classification on the learning set and 78% on the test set. The prediction accuracy increases as more information becomes progressively available after the operation with the daily improvement of 10% on the learning set and 5% on the test set. CONCLUSIONS: Recurrent neural networks trained with BPTT algorithm are capable of learning to represent temporal behavior of the time series prediction task. This model is an improvement upon the current model that does not take into account postoperative temporal information.

Adult↗

Entering the black box of neural networks.

OBJECTIVES: Artificial neural networks have proved to be accurate predictive instruments in several medical domains, but have been criticized for failing to specify the information upon which their predictions are based. We used methods of relevance analysis and sensitivity analysis to determine the most important predictor variables for a validated neural network for community-acquired pneumonia. METHODS: We studied a feed-forward, back-propagation neural network trained to predict pneumonia among patients presenting to an emergency department with fever or respiratory complaints. We used the methods of full retraining, weight elimination, constant substitution, linear substitution, and data permutation to identify a consensus set of important demographic, symptom, sign, and comorbidity predictors that influenced network output for pneumonia. We compared predictors identified by these methods to those identified by a weight propagation analysis based on the matrices of the network, and by logistic regression. RESULTS: Predictors identified by these methods were clinically plausible, and were concordant with those identified by weight analysis, and by logistic regression using the same data. The methods were highly correlated in network error, and led to variable sets with errors below bootstrap 95% confidence intervals for networks with similar numbers of inputs. Scores for variable relevance tended to be higher with methods that precluded network retraining (weight elimination) or that permuted variable values (data permutation), compared with methods that permitted retraining (full retraining) or that approximated its effects (constant and linear substitution). CONCLUSION: Methods of relevance analysis and sensitivity analysis are useful for identifying important predictor variables used by artificial neural networks.

Algorithms↗

Integrated service delivery networks for seniors: early perceptions of family physicians.

OBJECTIVE: To document the early perceptions of family physicians regarding integrated service delivery (ISD) networks a few weeks before and 6 months after establishing these networks and to identify obstacles to using case managers. DESIGN: Cross-sectional survey with two questionnaires mailed 6 months apart. SETTING: Three regional municipalities (one urban and two rural) in the Eastern Townships of Quebec. PARTICIPANTS: All family physicians in the three areas (n = 267). A total of 124 physicians (of 206 eligible; 60% response rate) answered the first questionnaire, and 104 of these the second (86% response rate). MAIN OUTCOME MEASURES: The first questionnaire asked what family physicians thought about ISD networks and the emerging case management function, and whether they were interested in participating in ISD networks. The second measured physicians' participation in ISD networks, asked whether their perceptions of case management had changed, and identified obstacles to using case managers. RESULTS: Nearly all (98%) respondents to the preimplementation questionnaire believed that family physicians will increasingly have to belong to ISD networks. Very few (8.2%), however, felt involved or consulted in decisions about developing and implementing these networks. More than one quarter (27%) did not know that an ISD network for older people would be established in their area, and 84.3% did not feel sufficiently informed to be involved. Most family physicians (85.7%) said they were interested in using case managers. Six months after implementation, 70.2% of physicians knew that case managers were available; 35.6% had used a case manager. During implementation, physicians' opinions about case management were slightly less positive than they had been. The three main obstacles to using case managers were forgetting to use them (69.1%), the habit of using social workers instead (63.6%), and not knowing how to contact them (59.4%). CONCLUSION: Physicians are interested in participating in ISD networks and working with case managers. They must be better informed, however, about the availability of case managers, how they can reach case managers, case managers' precise role, and the advantages to themselves and their patients of using these services.

Adult↗

Interpretation of automated perimetry for glaucoma by neural network.

PURPOSE: Neural networks were trained to interpret the visual fields from an automated perimeter. The authors evaluated the reliability of the trained neural networks to discriminate between normal eyes and eyes with glaucoma. METHODS: Inclusion criteria for glaucomatous and normal eyes were the intraocular pressure and the appearance of the optic nerve; previous visual fields were not used. The authors compared the backpropagation learning method used by automated neural networks to those used by two specialists in glaucoma to classify the central 24 degrees automated perimetric visual fields from 60 normal and 60 glaucomatous eyes. RESULTS: The glaucoma experts and a trained two-layered network were each correct at approximately 67%. The average sensitivity of this test was 59% for the two glaucoma specialists and 65% for the two-layered network. The corresponding specificities were 74% and 71% for the specialists and the two-layered network, respectively. The experts and the network were in agreement about 74% of the time, which indicated no significant disagreement between the methods of testing. Feature analysis with a one-layered network determined the most important visual field positions. CONCLUSIONS: The authors conclude that a neural network can be taught to be as proficient as a trained reader in interpreting visual fields for glaucoma.

Adult↗

Artificial neural networks for predicting failure to survive following in-hospital cardiopulmonary resuscitation.

BACKGROUND: Neural networks are an artificial intelligence technique that uses a set of nonlinear equations to mimic the neuronal connections of biological systems. They have been shown to be useful for pattern recognition and outcome prediction applications, and have the potential to bring artificial intelligence techniques to the personal computers of practicing physicians, assisting them with a variety of medical decisions. It is proposed that such an artificial neural network can be trained, using information available at the time of admission to the hospital, to predict failure to survive following in-hospital cardiopulmonary resuscitation (CPR). METHODS: The age, sex, heart rate, and 21 other clinical variables were collected on a consecutive series of 218 adult patients undergoing CPR at a 295-bed public acute-care hospital. The data set was divided into two groups. A neural network was trained to predict failure to survive to discharge following CPR, using one group as the training set and the other as the testing set. The procedure was then reversed, and the results of the two networks were combined to form an aggregate network. RESULTS: The trained aggregate neural network had a sensitivity of 52.1% and a positive predictive value of 97% for the prediction of failure to survive following CPR. The relative risk of actually failing to survive to discharge following CPR for a patient predicted not to survive was 11.3 (95% CI 3.3 to 38.2). CONCLUSIONS: Predicting failure to survive following CPR is but one possible application of neural network technology. It demonstrates how this technique can assist physicians in medical decision making. Future work should attempt to improve the positive predictive value of the neural network, to consider combining it with an expert system, and to compare it with other predictive tools. Once validated, the network can be distributed as a separate application for use by practicing physicians.

Adolescent↗

Extraction of fuzzy rules using neural networks with structure level adaptation and its application to diagnosis for hepatobiliary disorders.

First, this paper presents the reasoning and the learning method for fuzzy rules using structure level adaptation of neural networks. In a usual neural network's mechanism, during learning process of rules, we can observe the following two behaviors: Case 1: If a neural network does not have enough neurons to be satisfied to infer, then the input weight vector will have a tendency to fluctuate greatly, even after a certain long period the learning process. In this case, the network needs to generate a new neuron as its parent's attribute is inherited. Case 2: If a neural network has enough neurons to infer, and even if the input weight vector of each neuron will converge to a certain value, then we shall be able to turn out unnecessary neurons from the network in the calculation. In this case, because it is necessary to delete a redundant neuron to the calculation, the neuron is annihilated without affecting the performance of the network. By observing such behaviors, we can generate or annihilate the specified neuron respectively to achieve an overall good system. In the proposed method, we described a procedure to derive the neuron generation/annihilation automatically and applied the procedure to learning system. Next, we apply such procedure to the learning system in which the experimental data related to hepatobiliary disorders is used. We use a real medical database containing the results of ten biochemical terms test for four hepatobiliary disorders. We have 536 case data, including some errors. After the learning, by using 179 data chosen randomly from database, the proposed system converged to a certain small value and this constructed network has the optimal structure for these teaching data. In addition, we get that the fuzzy rules have some meanings related to the degree of the input weight vector, and the fuzzy rules for hepatobiliary disorders are extracted from the learned network with respect to the degree of input weight vector. Moreover, to verify the validity of the diagnosis of the proposed method, the feed-forward calculation was implemented using extracted fuzzy rules for all databases. As a result, the proposed system correctly diagnosed more than 70%.

Biliary Tract Diseases↗

Normative models and healthcare planning: network-based simulations within a geographic information system environment.

OBJECTIVES: Network analysis to integrate patient, transportation and hospital characteristics for healthcare planning in order to assess the role of geographic information systems (GIS). A normative model of base-level responses of patient flows to hospitals, based on estimated travel times, was developed for this purpose. DATA SOURCES/STUDY SETTING: A GIS database developed to include patient discharge data, locations of hospitals, US TIGER/Line files of the transportation network, enhanced address-range data, and U.S. Census variables. The study area included a 16-county region centered on the city of Charlotte and Mecklenburg County, North Carolina, and contained 25 hospitals serving nearly 2 million people over a geographic area of nearly 9,000 square miles. STUDY DESIGN: Normative models as a tool for healthcare planning were derived through a spatial Network analysis and a distance optimization model that was implemented within a GIS. Scenarios were developed and tested that involved patient discharge data geocoded to the five-digit zip code, hospital locations geocoded to their individual addresses, and a transportation network of varying road types and corresponding estimated travel speeds to examine both patient discharge levels and a doubling of discharge levels associated with total discharges and DRG 391 (Normal Newborns). The Network analysis used location/allocation modeling to optimize for travel time and integrated measures of supply, demand, and impedance. DATA COLLECTION/EXTRACTION METHODS: Patient discharge data from the North Carolina Medical Database Commission, address-ranges from the North Carolina Institute for Transportation Research and Education, and U.S. Census TIGER/Line files were entered-into the ARC/INFO GIS software system for analysis. A relational database structure was used to organize the information and to link spatial features to their attributes. PRINCIPAL FINDINGS: Advances in healthcare planning can be achieved by examining baseline responses of patient flows to distance optimization simulations and healthcare scenarios conducted within a spatial context that uses a normative model to integrate characteristics of population, patients, hospitals, and transportation networks. Model runs for the defined scenarios indicated that a doubling of the 1991 patient discharge levels resulted in an areal constriction of the service areas to those zip codes immediately adjacent to the hospitals, thereby leaving substantial areas unassigned to hospitals during the allocation process, but that doubling the demand for obstetrics care (DRG 391) resulted in little change in the pattern of accessibility to care as indicated by the size, orientation, and pattern of the service areas. CONCLUSIONS: The GIS-Network system supported "what if" simulations, portrayed service areas within a spatial context, integrated disparate data in the execution of the location/allocation model, and used estimated travel time along a transportation network instead of Euclidean distance for calculating accessibility. The results of the simulations suggest that the GIS-Network system is an effective approach for exploring a variety of healthcare scenarios where changes in the supply, demand, and impedance variables can be examined within a spatial context and where variations in system trajectories can be simulated and observed.

Computer Communication Networks↗

Neural networks for signal processing applications: ECG classification.

QRS complexes were classified using a Multi Layer Perceptron (MLP) using a modified version of the original Backpropagation (BP) algorithm. The input to the network were bitmaps of the QRS complexes represented in the form of a 20 x 20 matrix. A number of hidden layers (and neurons in each hidden layer) were experimented upon to observe the rate at which the network converged. Larger Networks were observed to find the minimum on the error curve with ease. Increasing the network size beyond a certain size did not improve the performance rate, rather it decreased the performance rate. It is evident that there exists an optimal neural network architecture for every given problem. The weights change rules in Backpropagation algorithm were modified to include a variation of the relationship between momentum and learning rate to observe any increase in network's performance rate. A learning rate adaptation factor was introduced into the learning algorithm to decrease the network's chances of missing a minimum on the error curve. The network was found to perform extremely well with the modified version of the algorithm. The network converged after only 9000 learning cycles when compared to 14,000 cycles with the original algorithm.

Algorithms↗

Genomic regulation modeled as a network with basins of attraction.

Many natural processes consist of networks of interacting elements which affect each other's state over time, the dynamics depending on the pattern of connections and the updating rules for each element. Genomic regulatory networks are arguably networks of this sort. An attempt to understand genomic networks would benefit from the context of a general theory of discrete dynamical networks which is currently emerging. A key notion here is global dynamics, whereby state-space is organized into basins of attraction, objects that have only recently become accessible by computer simulation of idealized models, in particular "random Boolean networks". Cell types have been explained as attractors in genomic networks, where the network architecture is biased to achieve a balance between stability and adaptability in response to perturbation. Based on computer simulations using the software Discrete Dynamics Lab (DDLab), these ideas are described, as well as order-chaos measures on typical trajectories that further characterize network dynamics.

Algorithms↗

Research interests of physicians in two practice-based primary care research networks.

Regional practice-based network research has grown significantly in the past 15 years. Previous studies have reported on characteristics of physicians who participate in network research, but little is known about the specific a priori research interests of practicing physicians. Knowledge of such interests could be useful in planning network research studies. We conducted a mail survey to assess the research interests of primary care physicians in two contiguous research networks at the University of California at San Francisco (UCSF) and at Stanford University. Among 120 respondents from the UCSF Collaborative Research Network and 85 from the Stanford Ambulatory Research Network, the most common topics of interest were disease prevention, communication and compliance, and managed care. Among specific conditions, heart disease, hypertension, and respiratory infection were of interest to the majority of respondents. Topics not of interest to network members were obstetrics, diagnostic procedures, alcoholism, drug abuse, tuberculosis, male genito-urinary problems, occupational hazards, domestic violence, and AIDS and HIV. Identification of network physician research interests can help focus research and recruitment efforts on topics of interest and provide estimates of participation levels for planning studies and preparing funding applications for research networks.

Acquired Immunodeficiency Syndrome↗

Quantitative analysis of cytokeratin network topology in the MCF7 cell line.

BACKGROUND: In the MCF7 human breast cancer cell line, several patterns of cytokeratin networks are observed, depending on the intracellular localization. Our hypothesis is that architectural variations of cytokeratin networks depend on local tensions or forces appearing spontaneously in the cytoplasm. The aim of this work was to discriminate between the different patterns and to quantitate these variations. MATERIALS AND METHODS: Image analysis procedures were developed to extract cytokeratin filament networks visualized by immunofluorescence and confocal microscopy. Two methods were used to segment sets of curvilinear objects. The first, the "mesh-approach," based on classical methods of mathematical morphology, takes into account global network topology. The second, the "filament-approach" (novel), is meant to account for individual element morphology. These methods and their combination allow the computation of several features at two levels of geometry: global (network topology) and local (filament morphology). RESULTS: Variations in cytokeratin networks are characterized by their connectivity, density, mesh structure, and filament shape. The connectivity and the density of a network describe its location in a local "stress-force" zone or in a "relaxed" zone. The mesh structure characterizes the intracellular localization of the network. Moreover, the filament shape reflects the intracellular localization and the occurrence of a "stress-force" zone. CONCLUSIONS: These features permitted the quantitation of differences within the network patterns and within the specific filament shapes according to the intracellular localization. Further experiments on cells submitted to external forces will test the hypothesis that the architectural variations of intermediate filaments reflect intracytoplasmic tensions.

Algorithms↗

Three-dimensional structure of tubular networks, presumably Golgi in nature, in various yeast strains: a comparative study.

BACKGROUND: In the yeast Saccharomyces cerevisiae, the Golgi apparatus consists of discrete units distributed throughout the cytoplasm. When such units are examined in three dimensions, in relatively thick sections prepared for the electron microscope, they usually appear as small tubular networks with a stained material accumulating in dilations located at the junctions of membranous tubules. To see whether such tubular networks are observed in other yeast species, the three-dimensional structure of organelles in eight additional yeast strains, endowed with diverse biological properties, are examined. METHODS: Yeast strains were grown at 24 degrees C in YPD medium (2% Bactopeptone, 1% Bactoyeast extract, and 2% glucose). Cells that were examined by electron microscopy came from exponentially growing cultures grown in a shaking water bath and maintained at a OD 600 (optical density at 600 nm) of 0.5. Cells were fixed in a fixative containing 2% glutaraldehyde in 0.1 M cacodylate buffer pH 7.4 and 0.8 M sorbitol. They were then treated for 15 min in 1% sodium metaperiodate and postfixed for 1 hr in potassium ferrocyanide-osmic acid. They were preembedded in agarose prior to dehydration and finally embedded in Epon. In these conditions, the preservation of cell organelles was improved and the cytoplasmic retraction from the cell wall was minimized. Photographs of sections tilted at +/- 15 degrees from the 0 degrees position of the goniometric stage were used to prepare stereopairs from which the three-dimensional configuration of the organelles was visualized. RESULTS: In all yeast strains, tubular networks appeared as separate elements or units disperse throughout the cytoplasm. Each unit consisted of anastomosed membranous tubules. In some strains such as Saccharomyces cerevisiae, Zygosaccharomyces rouxii, or Saccharomyces pombe, such units appeared mainly as polygonal networks of intensely stained membranous tubules. Along these networks, distensions filled with stained material were similar in size to nearby secretory granules, suggesting that the latter formed by fragmentation of the tubular networks. In Hansenula polymorpha, Pichia pastoris, and Debaryomyces hansenii, networks of anastomosed tubules were closely superposed to each other and formed parallel arrays reminiscent of the stacks of Golgi saccules seen in mammalian cells. However, in contrast to what is usually found in the latter, the layers making up the parallel arrays in yeasts, were clearly continuous to each other. In other strains, i.e., Kluyveromyces lactis, Candida albicans, and Candida parapsilosis, the situation was intermediate and their cytoplasm contained only arrays of small size with two or at most three superposed layers of membranous tubules. Small vesicles in the 30-50 nm range were rarely encountered in most yeast strains. CONCLUSIONS: It is therefore concluded that tubular networks, presumably Golgi in nature, are present in all yeasts examined so far. Yet, in some strains, these tubular networks may be arranged in parallel arrays or stacks.

Cell Membrane↗

Exploring the cell's network with molecular imaging.

Molecular imaging is already a powerful tool for investigating molecular interactions within the cell. Interpreting molecular imaging findings will, however, take us into the more unfamiliar, nonlinear realm of networks. The network class of interest is the "scale-free" network, which characterizes not only the cell, but also surprisingly, other real work networks such as the world wide web. This network topology yields insights in how the cell is functionally organized via motifs, modules, and different types of hubs. Additional organizational information is gained from the cell's evolutionary history. Interpretation of molecular images will be deepened by a both qualitative and quantitative knowledge of the cell's network. Importantly, cell network behavior can be independent of molecular detail. For this reason, the same molecule can serve different functions in different cells or even within the same cell. Since a scale-free network's behavior is likely to be nonlinear and exhibit emergent behavior, a degree of caution is prudent in assigning cause and effect to molecular imaging findings in our effort to reengineer some of the cell's functions. Molecular imagers will need to be cognizant of the level of organization in the cell's network they are interrogating.

Amino Acid Motifs↗

Pattern-recognition by an artificial network derived from biologic neuronal systems.

A novel artificial neural network, derived from neurobiological observations, is described and examples of its performance are presented. This DYnamically STable Associative Learning (DYSTAL) network associatively learns both correlations and anticorrelations, and can be configured to classify or restore patterns with only a change in the number of output units. DYSTAL exhibits some particularly desirable properties: computational effort scales linearly with the number of connections, i.e., it is O(N) in complexity; performance of the network is stable with respect to network parameters over wide ranges of their values and over the size of the input field; storage of a very large number of patterns is possible; patterns need not be orthogonal; network connections are not restricted to multi-layer feed-forward or any other specific structure; and, for a known set of deterministic input patterns, the network weights can be computed, a priori, in closed form. The network has been associatively trained to perform the XOR function as well as other classification tasks. The network has also been trained to restore patterns obscured by binary or analog noise. Neither global nor local feedback connections are required during learning; hence the network is particularly suitable for hardware (VLSI) implementation.

Animals↗

Neurofilamentous network and filamentous matrix preserved and isolated by different techniques from squid giant axon.

The contribution of the neurofilamentous network to the structure of the squid giant axon was analyzed electron-microscopically. Axial 10-nm filaments cross-linked by radial 5-nm bridges form a network that is present in preparations prepared by a variety of techniques. The axoplasm is differentiated into dense and less dense regions. In the presence of Co(II) ions, the neurofilamentous network was remarkably well preserved and appeared to be associated with a dense web of fine filament matrix, which also was identified in extracted axoplasm and in fractions enriched with neurofilament protein complex. In the presence of La(III) ions, the neurofilamentous network had a coarse and open appearance. The stereo images of extracted and critical-point dried axoplasm suggested that the neurofilamentous network contains ordered lattice-like regions. Extracted preparations of extruded axoplasm and fractions enriched with neurofilament protein complex suggested that the properties of the network are determined by the neurofilament protein complex. It is proposed that the neurofilamentous network is the essential determinant of the form of the axon, and that the order within the network is determined by the radial components of the network. The structures observed in the different preparations are not artifacts, but rather are related closely to their native state in the axon.

Animals↗

Self-stabilization of neuronal networks. I. The compensation algorithm for synaptogenesis.

Between the extreme views concerning ontogenesis (genetic vs. environmental determination), we use a moderate approach: a somehow pre-established neuronal model network reacts to activity deviations (reflecting input to be compensated), and stabilizes itself during a complex feed-back process. Morphogenesis is based on an algorithm formalizing the compensation theory of synaptogenesis (Wolff and Wagner 1983). This algorithm is applied to randomly connected McCulloch-Pitts networks that are able to maintain oscillations of their activity patterns over time. The algorithm can lead to networks which are morphogenetically stable but preserve self-maintained oscillations in activity. This is in contrast to most of the current models of synaptogenesis and synaptic modification based on Hebbian rules of plasticity. Hebbian networks are morphogenetically unstable without additional assumptions. The effects of compensation on structural and functional properties of the networks are described. It is concluded that the compensation theory of synaptogenesis can account for the development of morphogenetically stable neuronal networks out of randomly connected networks via selective stabilization and elimination of synapses. The logic of the compensation algorithm is based on experimental results. The present paper shows that the compensation theory can not only predict the behavior of synaptic populations (Wagner and Wolff, in preparation), but it can also describe the behavior of neurons interconnected in a network, with the resulting additional system properties. The neuronal interactions--leading to equilibrium in certain cases--are a self-organizing process in the sense that all decisions are performed on the individual cell level without knowing the overall network situation or goal.

Animals↗

Assessment of stress-buffering effects of social networks on psychological symptoms in an inner-city elderly population.

Social network researchers have been divided into two camps: those who propose that social networks have a direct effect on subsequent psychological symptoms and those who posit a stress-buffering effect as well. Previous research has been limited by rudimentary measures of social interaction and the absence of longitudinal data as well as by different approaches to the assessment of possible buffering effects. In the present study, using 19 social network variables, the authors followed 133 elderly residents of mid-Manhattan SRO hotels for 1 year. Three different methods of determining buffering effects were examined: Dividing the sample into high- and low-stress groups and contrasting differences in percentage variance accounted for by social networks between the two groups; Examining the group as a whole to assess if any Network Variable X Stress interactional terms are significant; Examining the group as a whole to assess whether there is a reduction in the beta value of stress with respect to psychological symptoms when network variables are added to the analysis. Method 1 indicated a direct network effect, but none of the methods indicated a buffering effect. Of clinical relevance was the nonlinearity of the network effects, that is, depending upon a person's stressor level, different network dimensions must be emphasized and strengthened.

Adaptation, Psychological↗

Role of prefrontal cortex in a network for arbitrary visuomotor mapping.

In arbitrary visuomotor mapping, an object instructs a particular action or target of action, but does so in a particular way. In other forms of visuomotor control, the object is either the target of action (termed standard mapping) or its location provides the information needed for targeting (termed transformational mapping). By contrast, in arbitrary mapping, the object's location bears no systematic spatial relationship with the action. Neuropsychological and neurophysiological investigation has, in large part, identified the neural network that underlies the rapid acquisition and performance of arbitrary visuomotor mappings. This network consists of parts of the premotor (PM) and prefrontal (PF) cortex, the hippocampal system (HS), and the basal ganglia (BG). Here, we propose specialized contributions of the network's different components to its overall function. To do so, we invoke the concept of distributed information-processing architectures, or modules, which may involve a variety of neural structures. According to this view, recurrent neural networks involving cortex, basal ganglia, and thalamus operate largely in parallel. Each of these interacting networks can be termed a cortical-BG module. A large number of these modules include PM neurons, and they can be termed PM cortical-BG modules. A comparable number include PF neurons, termed PF cortical-BG modules. We propose that PM and PF cortical-BG modules compute specific object-to-action mappings, in which the network learns the action associated with a given input. These mappings serve as specific solutions to arbitrary visuomotor mapping problems. However, they are also exemplars of more abstract rules, such as the knowledge that nonspatial visual information (e.g., color) can guide the choice of action. We propose that PF cortical-BG modules subserve abstract rules of this kind, along with other problem-solving strategies. This view should not be taken to imply that the PF network lacks the capacity to compute specific mappings, but rather that it has higher-order mapping functions in addition to its lower-order ones. Furthermore, it seems likely that PF provides PM with pertinent sensory information. The hippocampal system appears to play a role parallel to that of both neocortical-BG networks discussed here. However, in accord with several models, it operates mainly in the intermediate term, pending the consolidation of the relevant information in those neocortical-BG networks.

Animals↗