Manifold Alignment Aware Ants: A Markovian Process for Manifold Extraction

The presence of manifolds is a common assumption in many applications, including astronomy and computer vision. For instance, in astronomy, low-dimensional stellar structures, such as streams, shells, and globular clusters, can be found in the neighborhood of big galaxies such as the Milky Way. Since these structures are often buried in very large data sets, an algorithm, which can not only recover the manifold but also remove the background noise (or outliers), is highly desirable. While other works try to recover manifolds either by pushing all points toward manifolds or by downsampling from dense regions, aiming to solve one of the problems, they generally fail to suppress the noise on manifolds and remove background noise simultaneously. Inspired by the collective behavior of biological ants in food-seeking process, we propose a new algorithm that employs several random walkers equipped with a local alignment measure to detect and denoise manifolds. During the walking process, the agents release pheromone on data points, which reinforces future movements. Over time the pheromone concentrates on the manifolds, while it fades in the background noise due to an evaporation procedure. We use the Markov chain (MC) framework to provide a theoretical analysis of the convergence of the algorithm and its performance. Moreover, an empirical analysis, based on synthetic and real-world data sets, is provided to demonstrate its applicability in different areas, such as improving the performance of t-distributed stochastic neighbor embedding (t-SNE) and spectral clustering using the underlying MC formulas, recovering astronomical low-dimensional structures, and improving the performance of the fast Parzen window density estimator.

Oral Microbiota Transplant in Dogs with Naturally Occurring Periodontitis

In periodontitis patients, dysbiosis of the oral microbiota is not only found at clinically diseased periodontal sites but also at clinically healthy periodontal sites, buccal mucosae, tongue, and saliva. The present study evaluated the safety and efficacy of an oral microbiota transplant (OMT) for the treatment of periodontitis in dogs. Eighteen systemically healthy beagle dogs with naturally occurring periodontitis were enrolled in the study and randomly assigned to a test or control group. A 4-y-old, periodontally healthy female beagle dog served as a universal OMT donor. To reduce periodontal inflammation, all dogs received full-mouth mechanical debridement of teeth and mucosae 2 wk before baseline. At baseline, full-mouth mechanical debridement was repeated and followed by adjunctive subgingival and oral irrigation with 0.1% NaOCl. Subsequently, test dogs were inoculated with an OMT from the healthy donor. No daily oral hygiene was performed after OMT transplantation. Adverse events were assessed throughout the observation period. Clinical examinations were performed and whole-mouth oral microbiota samples were collected at week 2, baseline, week 2, and week 12. The composition of oral microbiota samples was analyzed using high-throughput 16S ribosomal RNA gene amplicon sequencing followed by taxonomic assignment and downstream bioinformatic and statistical analyses. Results demonstrated that the intergroup difference in the primary outcome measure, probing pocket depth at week 12, was statistically insignificant. However, the single adjunctive OMT had an additional effect on the oral microbiota composition compared to the full-mouth mechanical and antimicrobial debridement alone. The OMT resulted in an "ecological shift" toward the composition of the donor microbiota, but this was transient in nature and was not observed at week 12. No local or systemic adverse events were observed throughout the study period. The results indicate that OMT may modulate the microbiota composition in dogs with naturally occurring periodontitis and can be applied safely.

Learning pharmacokinetic models for in vivo glucocorticoid activation

To understand trends in individual responses to medication, one can take a purely data-driven machine learning approach, or alternatively apply pharmacokinetics combined with mixed-effects statistical modelling. To take advantage of the predictive power of machine learning and the explanatory power of pharmacokinetics, we propose a latent variable mixture model for learning clusters of pharmacokinetic models demonstrated on a clinical data set investigating 11β-hydroxysteroid dehydrogenase enzymes (11β-HSD) activity in healthy adults. The proposed strategy automatically constructs different population models that are not based on prior knowledge or experimental design, but result naturally as mixture component models of the global latent variable mixture model. We study the parameter of the underlying multi-compartment ordinary differential equation model via identifiability analysis on the observable measurements, which reveals the model is structurally locally identifiable. Further approximation with a perturbation technique enables efficient training of the proposed probabilistic latent variable mixture clustering technique using Estimation Maximization. The training on the clinical data results in 4 clusters reflecting the prednisone conversion rate over a period of 4 h based on venous blood samples taken at 20-min intervals. The learned clusters differ in prednisone absorption as well as prednisone/prednisolone conversion. In the discussion section we include a detailed investigation of the relationship of the pharmacokinetic parameters of the trained cluster models for possible or plausible physiological explanation and correlations analysis using additional phenotypic participant measurements.

A Community Challenge for Inferring Genetic Predictors of Gene Essentialities through Analysis of a Functional Screen of Cancer Cell Lines

We report the results of a DREAM challenge designed to predict relative genetic essentialities based on a novel dataset testing 98,000 shRNAs against 149 molecularly characterized cancer cell lines. We analyzed the results of over 3,000 submissions over a period of 4 months. We found that algorithms combining essentiality data across multiple genes demonstrated increased accuracy; gene expression was the most informative molecular data type; the identity of the gene being predicted was far more important than the modeling strategy; well-predicted genes and selected molecular features showed enrichment in functional categories; and frequently selected expression features correlated with survival in primary tumors. This study establishes benchmarks for gene essentiality prediction, presents a community resource for future comparison with this benchmark, and provides insights into factors influencing the ability to predict gene essentiality from functional genetic screens. This study also demonstrates the value of releasing pre-publication data publicly to engage the community in an open research collaboration.

Sparse group factor analysis for biclustering of multiple data sources

MOTIVATION

Modelling methods that find structure in data are necessary with the current large volumes of genomic data, and there have been various efforts to find subsets of genes exhibiting consistent patterns over subsets of treatments. These biclustering techniques have focused on one data source, often gene expression data. We present a Bayesian approach for joint biclustering of multiple data sources, extending a recent method Group Factor Analysis to have a biclustering interpretation with additional sparsity assumptions. The resulting method enables data-driven detection of linear structure present in parts of the data sources.

RESULTS

Our simulation studies show that the proposed method reliably infers biclusters from heterogeneous data sources. We tested the method on data from the NCI-DREAM drug sensitivity prediction challenge, resulting in an excellent prediction accuracy. Moreover, the predictions are based on several biclusters which provide insight into the data sources, in this case on gene expression, DNA methylation, protein abundance, exome sequence, functional connectivity fingerprints and drug sensitivity.

AVAILABILITY AND IMPLEMENTATION

http://research.cs.aalto.fi/pml/software/GFAsparse/

CONTACTS

: kerstin.bunte@googlemail.com or samuel.kaski@aalto.fi.

Analysis of flow cytometry data by matrix relevance learning vector quantization

Flow cytometry is a widely used technique for the analysis of cell populations in the study and diagnosis of human diseases. It yields large amounts of high-dimensional data, the analysis of which would clearly benefit from efficient computational approaches aiming at automated diagnosis and decision support. This article presents our analysis of flow cytometry data in the framework of the DREAM6/FlowCAP2 Molecular Classification of Acute Myeloid Leukemia (AML) Challenge, 2011. In the challenge, example data was provided for a set of 179 subjects, comprising healthy donors and 23 cases of AML. The participants were asked to provide predictions with respect to the condition of 180 patients in a test set. We extracted feature vectors from the data in terms of single marker statistics, including characteristic moments, median and interquartile range of the observed values. Subsequently, we applied Generalized Matrix Relevance Learning Vector Quantization (GMLVQ), a machine learning technique which extends standard LVQ by an adaptive distance measure. Our method achieved the best possible performance with respect to the diagnoses of test set patients. The extraction of features from the flow cytometry data is outlined in detail, the machine learning approach is discussed and classification results are presented. In addition, we illustrate how GMLVQ can provide deeper insight into the problem by allowing to infer the relevance of specific markers and features for the diagnosis.

Texture feature ranking with relevance learning to classify interstitial lung disease patterns

OBJECTIVE

The generalized matrix learning vector quantization (GMLVQ) is used to estimate the relevance of texture features in their ability to classify interstitial lung disease patterns in high-resolution computed tomography images.

METHODOLOGY

After a stochastic gradient descent, the GMLVQ algorithm provides a discriminative distance measure of relevance factors, which can account for pairwise correlations between different texture features and their importance for the classification of healthy and diseased patterns. 65 texture features were extracted from gray-level co-occurrence matrices (GLCMs). These features were ranked and selected according to their relevance obtained by GMLVQ and, for comparison, to a mutual information (MI) criteria. The classification performance for different feature subsets was calculated for a k-nearest-neighbor (kNN) and a random forests classifier (RanForest), and support vector machines with a linear and a radial basis function kernel (SVMlin and SVMrbf).

RESULTS

For all classifiers, feature sets selected by the relevance ranking assessed by GMLVQ had a significantly better classification performance (p<0.05) for many texture feature sets compared to the MI approach. For kNN, RanForest, and SVMrbf, some of these feature subsets had a significantly better classification performance when compared to the set consisting of all features (p<0.05).

CONCLUSION

While this approach estimates the relevance of single features, future considerations of GMLVQ should include the pairwise correlation for the feature ranking, e.g. to reduce the redundancy of two equally relevant features.

A General Framework for Dimensionality-Reducing Data Visualization Mapping

In recent years, a wealth of dimension-reduction techniques for data visualization and preprocessing has been established. Nonparametric methods require additional effort for out-of-sample extensions, because they provide only a mapping of a given finite set of points. In this letter, we propose a general view on nonparametric dimension reduction based on the concept of cost functions and properties of the data. Based on this general principle, we transfer nonparametric dimension reduction to explicit mappings of the data manifold such that direct out-of-sample extensions become possible. Furthermore, this concept offers the possibility of investigating the generalization ability of data visualization to new data points. We demonstrate the approach based on a simple global linear mapping, as well as prototype-based local linear mappings. In addition, we can bias the functional form according to given auxiliary information. This leads to explicit supervised visualization mappings with discriminative properties comparable to state-of-the-art approaches.

Limited Rank Matrix Learning, discriminative dimension reduction and visualization

We present an extension of the recently introduced Generalized Matrix Learning Vector Quantization algorithm. In the original scheme, adaptive square matrices of relevance factors parameterize a discriminative distance measure. We extend the scheme to matrices of limited rank corresponding to low-dimensional representations of the data. This allows to incorporate prior knowledge of the intrinsic dimension and to reduce the number of adaptive parameters efficiently. In particular, for very large dimensional data, the limitation of the rank can reduce computation time and memory requirements significantly. Furthermore, two- or three-dimensional representations constitute an efficient visualization method for labeled data sets. The identification of a suitable projection is not treated as a pre-processing step but as an integral part of the supervised training. Several real world data sets serve as an illustration and demonstrate the usefulness of the suggested method.

Regularization in matrix relevance learning

In this paper, we present a regularization technique to extend recently proposed matrix learning schemes in learning vector quantization (LVQ). These learning algorithms extend the concept of adaptive distance measures in LVQ to the use of relevance matrices. In general, metric learning can display a tendency towards oversimplification in the course of training. An overly pronounced elimination of dimensions in feature space can have negative effects on the performance and may lead to instabilities in the training. We focus on matrix learning in generalized LVQ (GLVQ). Extending the cost function by an appropriate regularization term prevents the unfavorable behavior and can help to improve the generalization ability. The approach is first tested and illustrated in terms of artificial model data. Furthermore, we apply the scheme to benchmark classification data sets from the UCI Repository of Machine Learning. We demonstrate the usefulness of regularization also in the case of rank limited relevance matrices, i.e., matrix learning with an implicit, low-dimensional representation of the data.