Human and murine clonal CD8+ T cell expansions arise during tuberculosis because of TCR selection

The immune system can recognize virtually any antigen, yet T cell responses against several pathogens, including Mycobacterium tuberculosis, are restricted to a limited number of immunodominant epitopes. The host factors that affect immunodominance are incompletely understood. Whether immunodominant epitopes elicit protective CD8+ T cell responses or instead act as decoys to subvert immunity and allow pathogens to establish chronic infection is unknown. Here we show that anatomically distinct human granulomas contain clonally expanded CD8+ T cells with overlapping T cell receptor (TCR) repertoires. Similarly, the murine CD8+ T cell response against M. tuberculosis is dominated by TB10.44-11-specific T cells with extreme TCRß bias. Using a retro genic model of TB10.44-11-specific CD8+ Tcells, we show that TCR dominance can arise because of competition between clonotypes driven by differences in affinity. Finally, we demonstrate that TB10.4-specific CD8+ T cells mediate protection against tuberculosis, which requires interferon-? production and TAP1-dependent antigen presentation in vivo. Our study of how immunodominance, biased TCR repertoires, and protection are inter-related, provides a new way to measure the quality of T cell immunity, which if applied to vaccine evaluation, could enhance our understanding of how to elicit protective T cell immunity.

Selection of Trypanosoma cruzi clonal genotypes (clonet 20 and 39) isolated from Bolivian triatomines following subculture in liquid medium

Previous studies showed that two groups of Trypanosoma cruzi clonal genotypes named clonet 20 and clonet 39 were predominant in Triatoma infestans, the unique vector of Chagas disease in Bolivia. These groups of clones correspond to distinct genetic clusters. These clonets were detected in T. infestans and Rhodnius pictipes fecal samples before isolation and after culture by kDNA PCR (polymerase chain rreaction) and hybridization of the amplified products with clonet specific kDNA probes named 20 and 39 as previously reported. Forty eight T. infestans and three R. pictipes infected insects captured at random in different Bolivian departments were proceeded. As previously reported the direct identification of the two major clonets in fecal samples allowed the detection of abundant mixed infections: 41% in the original sample, however after culture, only 6% of mixed infections were detected. Among the 21 parasite stocks isolated from digestive tracts where mixed infections were initially detected (clonet 20 + 39) clonet 20 alone was detected in 81% of them. This result clearly showed that the culture step selected clonet 20 parasites over those belonging to clonet 39. The taxonomic status of the isolated stocks was also confirmed by isoenzyme typing, and correlation was observed between clustering topology and hybridization patterns with the probes 20 and 39.

A genetic algorithm to ensemble feature selection

We are going to implement the "GA-SEFS" by Tsymbal and analyse experimentally its performance depending on the classifier algorithms used in the fitness function (NB, MNge, SMO). We are also going to study the effect of adding to the fitness function a measure to control complexity of the base classifiers.

Clonal deletion and the fate of autoreactive thymocytes that survive negative selection.

Clonal deletion of autoreactive thymocytes is important for self-tolerance, but the intrathymic signals that induce clonal deletion have not been clearly identified. We now report that clonal deletion during negative selection required CD28-mediated costimulation of autoreactive thymocytes at the CD4(+)CD8(lo) intermediate stage of differentiation. Autoreactive thymocytes were prevented from undergoing clonal deletion by either a lack of CD28 costimulation or transgenic overexpression of the antiapoptotic factors Bcl-2 or Mcl-1, with surviving thymocytes differentiating into anergic CD4(-)CD8(-) double-negative thymocytes positive for the T cell antigen receptor αβ subtype (TCRαβ) that 'preferentially' migrated to the intestine, where they re-expressed CD8α and were sequestered as CD8αα(+) intraepithelial lymphocytes (IELs). Our study identifies costimulation by CD28 as the intrathymic signal required for clonal deletion and identifies CD8αα(+) IELs as the developmental fate of autoreactive thymocytes that survive negative selection.

A fast linear-in-the-parameters classifier construction algorithm using orthogonal forward selection to minimize leave-one-out misclassification rate

We propose a simple and computationally efficient construction algorithm for two class linear-in-the-parameters classifiers. In order to optimize model generalization, a forward orthogonal selection (OFS) procedure is used for minimizing the leave-one-out (LOO) misclassification rate directly. An analytic formula and a set of forward recursive updating formula of the LOO misclassification rate are developed and applied in the proposed algorithm. Numerical examples are used to demonstrate that the proposed algorithm is an excellent alternative approach to construct sparse two class classifiers in terms of performance and computational efficiency.

Mean-tracking clustering algorithm for radial basis function centre selection

Radial basis functions can be combined into a network structure that has several advantages over conventional neural network solutions. However, to operate effectively the number and positions of the basis function centres must be carefully selected. Although no rigorous algorithm exists for this purpose, several heuristic methods have been suggested. In this paper a new method is proposed in which radial basis function centres are selected by the mean-tracking clustering algorithm. The mean-tracking algorithm is compared with k means clustering and it is shown that it achieves significantly better results in terms of radial basis function performance. As well as being computationally simpler, the mean-tracking algorithm in general selects better centre positions, thus providing the radial basis functions with better modelling accuracy

Variable selection for financial distress classification using a genetic algorithm

This paper is concerned with the use of a genetic algorithm to select financial ratios for corporate distress classification models. For this purpose, the fitness value associated to a set of ratios is made to reflect the requirements of maximizing the amount of information available for the model and minimizing the collinearity between the model inputs. A case study involving 60 failed and continuing British firms in the period 1997-2000 is used for illustration. The classification model based on ratios selected by the genetic algorithm compares favorably with a model employing ratios usually found in the financial distress literature.

A Genetic Algorithm for the selection of structural MRI features for classification of Mild Cognitive Impairment and Alzheimer's Disease

This work investigates the problem of feature selection in neuroimaging features from structural MRI brain images for the classification of subjects as healthy controls, suffering from Mild Cognitive Impairment or Alzheimer’s Disease. A Genetic Algorithm wrapper method for feature selection is adopted in conjunction with a Support Vector Machine classifier. In very large feature sets, feature selection is found to be redundant as the accuracy is often worsened when compared to an Support Vector Machine with no feature selection. However, when just the hippocampal subfields are used, feature selection shows a significant improvement of the classification accuracy. Three-class Support Vector Machines and two-class Support Vector Machines combined with weighted voting are also compared with the former and found more useful. The highest accuracy achieved at classifying the test data was 65.5% using a genetic algorithm for feature selection with a three-class Support Vector Machine classifier.

U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.

A novel algorithm for feature selection using Harmony Search and its application for non-technical losses detection

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Feature selection through gravitational search algorithm

In this paper we deal with the problem of feature selection by introducing a new approach based on Gravitational Search Algorithm (GSA). The proposed algorithm combines the optimization behavior of GSA together with the speed of Optimum-Path Forest (OPF) classifier in order to provide a fast and accurate framework for feature selection. Experiments on datasets obtained from a wide range of applications, such as vowel recognition, image classification and fraud detection in power distribution systems are conducted in order to asses the robustness of the proposed technique against Principal Component Analysis (PCA), Linear Discriminant Analysis (LDA) and a Particle Swarm Optimization (PSO)-based algorithm for feature selection.

BBA: A binary bat algorithm for feature selection

Feature selection aims to find the most important information from a given set of features. As this task can be seen as an optimization problem, the combinatorial growth of the possible solutions may be in-viable for a exhaustive search. In this paper we propose a new nature-inspired feature selection technique based on the bats behaviour, which has never been applied to this context so far. The wrapper approach combines the power of exploration of the bats together with the speed of the Optimum-Path Forest classifier to find the set of features that maximizes the accuracy in a validating set. Experiments conducted in five public datasets have demonstrated that the proposed approach can outperform some well-known swarm-based techniques. © 2012 IEEE.

Binary Bat Algorithm for Feature Selection

Feature selection aims to find the most important information to save computational efforts and data storage. We formulated this task as a combinatorial optimization problem since the exponential growth of possible solutions makes an exhaustive search infeasible. In this work, we propose a new nature-inspired feature selection technique based on bats behavior, namely, binary bat algorithm The wrapper approach combines the power of exploration of the bats together with the speed of the optimum-path forest classifier to find a better data representation. Experiments in public datasets have shown that the proposed technique can indeed improve the effectiveness of the optimum-path forest and outperform some well-known swarm-based techniques. © 2013 Copyright © 2013 Elsevier Inc. All rights reserved.

BCS: A Binary Cuckoo Search algorithm for feature selection

Feature selection has been actively pursued in the last years, since to find the most discriminative set of features can enhance the recognition rates and also to make feature extraction faster. In this paper, the propose a new feature selection called Binary Cuckoo Search, which is based on the behavior of cuckoo birds. The experiments were carried out in the context of theft detection in power distribution systems in two datasets obtained from a Brazilian electrical power company, and have demonstrated the robustness of the proposed technique against with several others nature-inspired optimization techniques. © 2013 IEEE.

A wrapper approach for feature selection based on Bat Algorithm and Optimum-Path Forest

Besides optimizing classifier predictive performance and addressing the curse of the dimensionality problem, feature selection techniques support a classification model as simple as possible. In this paper, we present a wrapper feature selection approach based on Bat Algorithm (BA) and Optimum-Path Forest (OPF), in which we model the problem of feature selection as an binary-based optimization technique, guided by BA using the OPF accuracy over a validating set as the fitness function to be maximized. Moreover, we present a methodology to better estimate the quality of the reduced feature set. Experiments conducted over six public datasets demonstrated that the proposed approach provides statistically significant more compact sets and, in some cases, it can indeed improve the classification effectiveness. © 2013 Elsevier Ltd. All rights reserved.