Classification and sparse-signature extraction from gene-expression data
arXiv:0907.3687 · doi:10.1088/1742-5468/2009/05/P05001
Abstract
In this work we suggest a statistical mechanics approach to the classification of high-dimensional data according to a binary label. We propose an algorithm whose aim is twofold: First it learns a classifier from a relatively small number of data, second it extracts a sparse signature, {\it i.e.} a lower-dimensional subspace carrying the information needed for the classification. In particular the second part of the task is NP-hard, therefore we propose a statistical-mechanics based message-passing approach. The resulting algorithm is firstly tested on artificial data to prove its validity, but also to elucidate possible limitations. As an important application, we consider the classification of gene-expression data measured in various types of cancer tissues. We find that, despite the currently low quantity and quality of available data (the number of available samples is much smaller than the number of measured genes, limiting thus strongly the predictive capacities), the algorithm performs slightly better than many state-of-the-art approaches in bioinformatics.
15 pages, 13 eps figures
References in corpus (8)
- The random K-satisfiability problem: from an analytic solution to an efficient algorithm
- Learning by message-passing in networks of discrete synapses
- Clustering by soft-constraint affinity propagation: Applications to gene-expression data
- On the exactness of the cavity method for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs
- Inference from correlated patterns: a unified theory for perceptron learning and linear vector channels
- Inference algorithms for gene networks: a statistical mechanics analysis
- Statistical Mechanical Development of a Sparse Bayesian Classifier
- Efficient Bayesian Inference for Learning in the Ising Linear Perceptron and Signal Detection in CDMA