Search

Granulocytic myeloid-derived suppressor cells (G-MDSCs) promote tumor growth and immunosuppression in multiple myeloma (MM). However, their phenotype is not well established for accurate monitoring or clinical translation. We aimed to provide the phenotypic profile of G-MDSCs based on their prognostic significance in MM, immunosuppressive potential, and molecular program. The preestablished phenotype of G-MDSCs was evaluated in bone marrow samples from controls and MM patients using multidimensional flow cytometry; surprisingly, we found that CD11b+CD14−CD15+CD33+HLADR− cells overlapped with common eosinophils and neutrophils, which were not expanded in MM patients. Therefore, we relied on automated clustering to unbiasedly identify all granulocytic subsets in the tumor microenvironment: basophils, eosinophils, and immature, intermediate, and mature neutrophils. In a series of 267 newly diagnosed MM patients (GEM2012MENOS65 trial), only the frequency of mature neutrophils at diagnosis was significantly associated with patient outcome, and a high mature neutrophil/T-cell ratio resulted in inferior progression-free survival (P < .001). Upon fluorescence-activated cell sorting of each neutrophil subset, T-cell proliferation decreased in the presence of mature neutrophils (0.5-fold; P = .016), and the cytotoxic potential of T cells engaged by a BCMA×CD3-bispecific antibody increased notably with the depletion of mature neutrophils (fourfold; P = .0007). Most interestingly, RNA sequencing of the 3 subsets revealed that G-MDSC–related genes were specifically upregulated in mature neutrophils from MM patients vs controls because of differential chromatin accessibility. Taken together, our results establish a correlation between the clinical significance, immunosuppressive potential, and transcriptional network of well-defined neutrophil subsets, providing for the first time a set of optimal markers (CD11b/CD13/CD16) for accurate monitoring of G-MDSCs in MM.

A recently introduced text classifier, called SS3, has obtained state-of-the-art performance on the CLEF's eRisk tasks. SS3 was created to deal with risk detection over text streams and, therefore, not only supports incremental training and classification but also can visually explain its rationale. However, little attention has been paid to the potential use of SS3 as a general classifier. We believe this could be due to the unavailability of an open-source implementation of SS3. In this work, we introduce PySS3, a package that implements SS3 and also comes with visualization tools that allow researchers to deploy robust, explainable, and trusty machine learning models for text classification.

We present experiments on detecting hyperpartisanship in news using a 'masking' method that allows us to assess the role of style vs. content for the task at hand. Our results corroborate previous research on this task in that topic related features yield better results than stylistic ones. We additionally show that competitive results can be achieved by simply including higher-length n-grams, which suggests the need to develop more challenging datasets and tasks that address implicit and more subtle forms of bias.

Author Profiling (AP) aims at predicting specific characteristics from a group of authors by analyzing their written documents. Many research has been focused on determining suitable features for modeling writing patterns from authors. Reported results indicate that content-based features continue to be the most relevant and discriminant features for solving this task. Thus, in this paper, we present a thorough analysis regarding the appropriateness of different distributional term representations (DTR) for the AP task. In this regard, we introduce a novel framework for supervised AP using these representations and, supported on it. We approach a comparative analysis of representations such as DOR, TCOR, SSR, and word2vec in the AP problem. We also compare the performance of the DTRs against classic approaches including popular topic-based methods. The obtained results indicate that DTRs are suitable for solving the AP task in social media domains as they achieve competitive results while providing meaningful interpretability.

Text classification is a widely studied problem, and it can be considered solved for some domains and under certain circumstances. There are scenarios, however, that have received little or no attention at all, despite its relevance and applicability. One of such scenarios is early text classification, where one needs to know the category of a document by using partial information only. A document is processed as a sequence of terms, and the goal is to devise a method that can make predictions as fast as possible. The importance of this variant of the text classification problem is evident in domains like sexual predator detection, where one wants to identify an offender as early as possible. This paper analyzes the suitability of the standard naive Bayes classifier for approaching this problem. Specifically, we assess its performance when classifying documents after seeing an increasingly number of terms. A simple modification to the standard naive Bayes implementation allows us to make predictions with partial information. To the best of our knowledge naive Bayes has not been used for this purpose before. Throughout an extensive experimental evaluation we show the effectiveness of the classifier for early text classification. What is more, we show that this simple solution is very competitive when compared with state of the art methodologies that are more elaborated. We foresee our work will pave the way for the development of more effective early text classification techniques based in the naive Bayes formulation., 8 pages, preprint submitted to SDM'16

This paper describes a novel approach to learning term-weighting schemes (TWSs) in the context of text classification. In text mining a TWS determines the way in which documents will be represented in a vector space model, before applying a classifier. Whereas acceptable performance has been obtained with standard TWSs (e.g., Boolean and term-frequency schemes), the definition of TWSs has been traditionally an art. Further, it is still a difficult task to determine what is the best TWS for a particular problem and it is not clear yet, whether better schemes, than those currently available, can be generated by combining known TWS. We propose in this article a genetic program that aims at learning effective TWSs that can improve the performance of current schemes in text classification. The genetic program learns how to combine a set of basic units to give rise to discriminative TWSs. We report an extensive experimental study comprising data sets from thematic and non-thematic text classification as well as from image classification. Our study shows the validity of the proposed method; in fact, we show that TWSs learned with the genetic program outperform traditional schemes and other TWSs proposed in recent works. Further, we show that TWSs learned from a specific domain can be effectively used for other tasks.