Sparse computation for large-scale binary classification

Well-known data mining algorithms rely on inputs in the form of pairwise similarities between objects. For large datasets it is computationally impossible to perform all pairwise comparisons. We therefore propose a novel approach that uses approximate Principal Component Analysis to efficiently identify groups of similar objects. The effectiveness of the approach is demonstrated in the context of binary classification using the supervised normalized cut as a classifier. For large datasets from the UCI repository, the approach significantly improves run times with minimal loss in accuracy.

Index Tracking Using Data-Mining Techniques and Mixed-Binary Linear Programming

Index tracking has become one of the most common strategies in asset management. The index-tracking problem consists of constructing a portfolio that replicates the future performance of an index by including only a subset of the index constituents in the portfolio. Finding the most representative subset is challenging when the number of stocks in the index is large. We introduce a new three-stage approach that at first identifies promising subsets by employing data-mining techniques, then determines the stock weights in the subsets using mixed-binary linear programming, and finally evaluates the subsets based on cross validation. The best subset is returned as the tracking portfolio. Our approach outperforms state-of-the-art methods in terms of out-of-sample performance and running times.

Consensus Statements: Session 1 - Screening and Surveillance

The introduction of transient elastography in clinical practice has allowed the early identification of patients with chronic liver disease (CLD) at risk of developing clinically significant portal hypertension (CSPH) (1b;A).

Binary recombinase systems for high-resolution conditional mutagenesis.

Conditional mutagenesis using Cre recombinase expressed from tissue specific promoters facilitates analyses of gene function and cell lineage tracing. Here, we describe two novel dual-promoter-driven conditional mutagenesis systems designed for greater accuracy and optimal efficiency of recombination. Co-Driver employs a recombinase cascade of Dre and Dre-respondent Cre, which processes loxP-flanked alleles only when both recombinases are expressed in a predetermined temporal sequence. This unique property makes Co-Driver ideal for sequential lineage tracing studies aimed at unraveling the relationships between cellular precursors and mature cell types. Co-InCre was designed for highly efficient intersectional conditional transgenesis. It relies on highly active trans-splicing inteins and promoters with simultaneous transcriptional activity to reconstitute Cre recombinase from two inactive precursor fragments. By generating native Cre, Co-InCre attains recombination rates that exceed all other binary SSR systems evaluated in this study. Both Co-Driver and Co-InCre significantly extend the utility of existing Cre-responsive alleles.

FAIRLIE: Stata module to generate nonlinear decomposition of binary outcome differentials

fairlie computes the nonlinear decomposition of binary outcome differentials proposed by Fairlie (1999, 2003).