732 resultados para Neural classifiers
Resumo:
Prion protein (PrPC), when associated with the secreted form of the stress-inducible protein 1 (STI1), plays an important role in neural survival, neuritogenesis, and memory formation. However, the role of the PrP(C)-STI1 complex in the physiology of neural progenitor/stem cells is unknown. In this article, we observed that neurospheres cultured from fetal forebrain of wild-type (Prnp(+/+)) and PrP(C)-null (Prnp(0/0)) mice were maintained for several passages without the loss of self-renewal or multipotentiality, as assessed by their continued capacity to generate neurons, astrocytes, and oligodendrocytes. The homogeneous expression and colocalization of STI1 and PrP(C) suggest that they may associate and function as a complex in neurosphere-derived stem cells. The formation of neurospheres from Prnp(0/0) mice was reduced significantly when compared with their wild-type counterparts. In addition, blockade of secreted STI1, and its cell surface ligand, PrP(C), with specific antibodies, impaired Prnp(+/+) neurosphere formation without further impairing the formation of Prnp(0/0) neurospheres. Alternatively, neurosphere formation was enhanced by recombinant STI1 application in cells expressing PrP(C) but not in cells from Prnp(0/0) mice. The STI1-PrP(C) interaction was able to stimulate cell proliferation in the neurosphere-forming assay, while no effect on cell survival or the expression of neural markers was observed. These data suggest that the STI1-PrP(C) complex may play a critical role in neural progenitor/stem cells self-renewal via the modulation of cell proliferation, leading to the control of the stemness capacity of these cells during nervous system development. STEM CELLS 2011;29:1126-1136
Resumo:
In this study we evaluated whether administration of stem cells of neural origin (neural precursor cells, NPCs) could be protective against renal ischemia-reperfusion injury (IRI). We hypothesized that stem cell outcomes are not tissue-specific and that NPCs can improve tissue damage through paracrine mechanisms, especially due to immunomodulation. To this end, Wistar rats (200-250 g) were submitted to 1-hour ischemia and treated with NPCs (4 x 10(6) cells/animal) at 4 h of reperfusion. To serve as controls, ischemic animals were treated with cerebellum homogenate harvested from adult rat brain. All groups were sacrificed at 24 h of reperfusion. NPCs were isolated from rat fetus telencephalon and cultured until neurosphere formation (7 days). Before administration, NPCs were labeled with carboxyfluorescein diacetate succinimydylester (CFSE). Kidneys were harvested for analysis of cytokine profile and macrophage infiltration. At 24 h, NPC treatment resulted in a significant reduction in serum creatinine (IRI + NPC 1.21 + 0.18 vs. IRI 3.33 + 0.14 and IRI + cerebellum 2.95 + 0.78mg/dl, p < 0.05) and acute tubular necrosis (IRI + NPC 46.0 + 2.4% vs. IRI 79.7 + 14.2%, p < 0.05). NPC-CFSE and glial fibrillary acidic protein (GFAP)-positive cells (astrocyte marker) were found exclusively in renal parenchyma, which also presented GFAP and SOX-2 (an embryonic neural stem cell marker) mRNA expression. NPC treatment resulted in lower renal proinflammatory IL1-beta and TNF-alpha expression and higher anti-inflammatory IL-4 and IL-10 transcription. NPC-treated animals also had less macrophage infiltration and decreased serum proinflammatory cytokines (IL-1 beta, TNF-alpha and INF-gamma). Our data suggested that NPC therapy improved renal function by influencing immunological responses. Copyright (C) 2009 S. Karger AG, Basel
Resumo:
This work proposes and discusses an approach for inducing Bayesian classifiers aimed at balancing the tradeoff between the precise probability estimates produced by time consuming unrestricted Bayesian networks and the computational efficiency of Naive Bayes (NB) classifiers. The proposed approach is based on the fundamental principles of the Heuristic Search Bayesian network learning. The Markov Blanket concept, as well as a proposed ""approximate Markov Blanket"" are used to reduce the number of nodes that form the Bayesian network to be induced from data. Consequently, the usually high computational cost of the heuristic search learning algorithms can be lessened, while Bayesian network structures better than NB can be achieved. The resulting algorithms, called DMBC (Dynamic Markov Blanket Classifier) and A-DMBC (Approximate DMBC), are empirically assessed in twelve domains that illustrate scenarios of particular interest. The obtained results are compared with NB and Tree Augmented Network (TAN) classifiers, and confinn that both proposed algorithms can provide good classification accuracies and better probability estimates than NB and TAN, while being more computationally efficient than the widely used K2 Algorithm.
Resumo:
Various popular machine learning techniques, like support vector machines, are originally conceived for the solution of two-class (binary) classification problems. However, a large number of real problems present more than two classes. A common approach to generalize binary learning techniques to solve problems with more than two classes, also known as multiclass classification problems, consists of hierarchically decomposing the multiclass problem into multiple binary sub-problems, whose outputs are combined to define the predicted class. This strategy results in a tree of binary classifiers, where each internal node corresponds to a binary classifier distinguishing two groups of classes and the leaf nodes correspond to the problem classes. This paper investigates how measures of the separability between classes can be employed in the construction of binary-tree-based multiclass classifiers, adapting the decompositions performed to each particular multiclass problem. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
Several real problems involve the classification of data into categories or classes. Given a data set containing data whose classes are known, Machine Learning algorithms can be employed for the induction of a classifier able to predict the class of new data from the same domain, performing the desired discrimination. Some learning techniques are originally conceived for the solution of problems with only two classes, also named binary classification problems. However, many problems require the discrimination of examples into more than two categories or classes. This paper presents a survey on the main strategies for the generalization of binary classifiers to problems with more than two classes, known as multiclass classification problems. The focus is on strategies that decompose the original multiclass problem into multiple binary subtasks, whose outputs are combined to obtain the final prediction.
Resumo:
Traditional content-based image retrieval (CBIR) systems use low-level features such as colors, shapes, and textures of images. Although, users make queries based on semantics, which are not easily related to such low-level characteristics. Recent works on CBIR confirm that researchers have been trying to map visual low-level characteristics and high-level semantics. The relation between low-level characteristics and image textual information has motivated this article which proposes a model for automatic classification and categorization of words associated to images. This proposal considers a self-organizing neural network architecture, which classifies textual information without previous learning. Experimental results compare the performance results of the text-based approach to an image retrieval system based on low-level features. (c) 2008 Wiley Periodicals, Inc.
Resumo:
Several popular Machine Learning techniques are originally designed for the solution of two-class problems. However, several classification problems have more than two classes. One approach to deal with multiclass problems using binary classifiers is to decompose the multiclass problem into multiple binary sub-problems disposed in a binary tree. This approach requires a binary partition of the classes for each node of the tree, which defines the tree structure. This paper presents two algorithms to determine the tree structure taking into account information collected from the used dataset. This approach allows the tree structure to be determined automatically for any multiclass dataset.
Resumo:
Species` potential distribution modelling consists of building a representation of the fundamental ecological requirements of a species from biotic and abiotic conditions where the species is known to occur. Such models can be valuable tools to understand the biogeography of species and to support the prediction of its presence/absence considering a particular environment scenario. This paper investigates the use of different supervised machine learning techniques to model the potential distribution of 35 plant species from Latin America. Each technique was able to extract a different representation of the relations between the environmental conditions and the distribution profile of the species. The experimental results highlight the good performance of random trees classifiers, indicating this particular technique as a promising candidate for modelling species` potential distribution. (C) 2010 Elsevier Ltd. All rights reserved.
Resumo:
Cellular neural networks (CNNs) have locally connected neurons. This characteristic makes CNNs adequate for hardware implementation and, consequently, for their employment on a variety of applications as real-time image processing and construction of efficient associative memories. Adjustments of CNN parameters is a complex problem involved in the configuration of CNN for associative memories. This paper reviews methods of associative memory design based on CNNs, and provides comparative performance analysis of these approaches.
Resumo:
The issue of how children learn the meaning of words is fundamental to developmental psychology. The recent attempts to develop or evolve efficient communication protocols among interacting robots or Virtual agents have brought that issue to a central place in more applied research fields, such as computational linguistics and neural networks, as well. An attractive approach to learning an object-word mapping is the so-called cross-situational learning. This learning scenario is based on the intuitive notion that a learner can determine the meaning of a word by finding something in common across all observed uses of that word. Here we show how the deterministic Neural Modeling Fields (NMF) categorization mechanism can be used by the learner as an efficient algorithm to infer the correct object-word mapping. To achieve that we first reduce the original on-line learning problem to a batch learning problem where the inputs to the NMF mechanism are all possible object-word associations that Could be inferred from the cross-situational learning scenario. Since many of those associations are incorrect, they are considered as clutter or noise and discarded automatically by a clutter detector model included in our NMF implementation. With these two key ingredients - batch learning and clutter detection - the NMF mechanism was capable to infer perfectly the correct object-word mapping. (C) 2009 Elsevier Ltd. All rights reserved.
Resumo:
The relationship between thought and language and, in particular, the issue of whether and how language influences thought is still a matter of fierce debate. Here we consider a discrimination task scenario to study language acquisition in which an agent receives linguistic input from an external teacher, in addition to sensory stimuli from the objects that exemplify the overlapping categories that make up the environment. Sensory and linguistic input signals are fused using the Neural Modelling Fields (NMF) categorization algorithm. We find that the agent with language is capable of differentiating object features that it could not distinguish without language. In this sense, the linguistic stimuli prompt the agent to redefine and refine the discrimination capacity of its sensory channels. (C) 2007 Elsevier Ltd. All rights reserved.
Resumo:
The objective of this article is to find out the influence of the parameters of the ARIMA-GARCH models in the prediction of artificial neural networks (ANN) of the feed forward type, trained with the Levenberg-Marquardt algorithm, through Monte Carlo simulations. The paper presents a study of the relationship between ANN performance and ARIMA-GARCH model parameters, i.e. the fact that depending on the stationarity and other parameters of the time series, the ANN structure should be selected differently. Neural networks have been widely used to predict time series and their capacity for dealing with non-linearities is a normally outstanding advantage. However, the values of the parameters of the models of generalized autoregressive conditional heteroscedasticity have an influence on ANN prediction performance. The combination of the values of the GARCH parameters with the ARIMA autoregressive terms also implies in ANN performance variation. Combining the parameters of the ARIMA-GARCH models and changing the ANN`s topologies, we used the Theil inequality coefficient to measure the prediction of the feed forward ANN.
Resumo:
Neural differentiation has been extensively studied in vitro in a model termed neurospheres, which consists of aggregates of neural progenitor cells. Previous studies suggest that they have a great potential for the treatment of neurological disorders. One of the major challenges for scientists is to control cell fate and develop ideal culture conditions for neurosphere expansion in vitro, without altering their features. Similar to human neural progenitors, rat neurospheres cultured in the absence of epidermal and fibroblast growth factors for a short period increased the levels of beta-3 tubulin and decreased the expression of glial fibrillary acidic protein and nestin, compared to neurospheres cultured in the presence of these factors. In this work, we show that rat neurospheres cultured in suspension under mitogen-free condition presented significant higher expression of P2X2 and P2X6 receptor subunits, when compared to cells cultured in the presence of growth factors, suggesting a direct relationship between P2X2/6 receptor expression and induction of neuronal differentiation in mitogen-free cultured rat neurospheres.
Resumo:
This work investigates neural network models for predicting the trypanocidal activity of 28 quinone compounds. Artificial neural networks (ANN), such as multilayer perceptrons (MLP) and Kohonen models, were employed with the aim of modeling the nonlinear relationship between quantum and molecular descriptors and trypanocidal activity. The calculated descriptors and the principal components were used as input to train neural network models to verify the behavior of the nets. The best model for both network models (MLP and Kohonen) was obtained with four descriptors as input. The descriptors were T(5) (torsion angle), QTS1 (sum of absolute values of the atomic charges), VOLS2 (volume of the substituent at region B) and HOMO-1 (energy of the molecular orbital below HOMO). These descriptors provide information on the kind of interaction that occurs between the compounds and the biological receptor. Both neural network models used here can predict the trypanocidal activity of the quinone compounds with good agreement, with low errors in the testing set and a high correctness rate. Thanks to the nonlinear model obtained from the neural network models, we can conclude that electronic and structural properties are important factors in the interaction between quinone compounds that exhibit trypanocidal activity and their biological receptors. The final ANN models should be useful in the design of novel trypanocidal quinones having improved potency.
Resumo:
Cannabinoid compounds have widely been employed because of its medicinal and psychotropic properties. These compounds are isolated from Cannabis sativa (or marijuana) and are used in several medical treatments, such as glaucoma, nausea associated to chemotherapy, pain and many other situations. More recently, its use as appetite stimulant has been indicated in patients with cachexia or AIDS. In this work, the influence of several molecular descriptors on the psychoactivity of 50 cannabinoid compounds is analyzed aiming one obtain a model able to predict the psychoactivity of new cannabinoids. For this purpose, initially, the selection of descriptors was carried out using the Fisher`s weight, the correlation matrix among the calculated variables and principal component analysis. From these analyses, the following descriptors have been considered more relevant: E(LUMO) (energy of the lowest unoccupied molecular orbital), Log P (logarithm of the partition coefficient), VC4 (volume of the substituent at the C4 position) and LP1 (Lovasz-Pelikan index, a molecular branching index). To follow, two neural network models were used to construct a more adequate model for classifying new cannabinoid compounds. The first model employed was multi-layer perceptrons, with algorithm back-propagation, and the second model used was the Kohonen network. The results obtained from both networks were compared and showed that both techniques presented a high percentage of correctness to discriminate psychoactive and psychoinactive compounds. However, the Kohonen network was superior to multi-layer perceptrons.