The problem of classifying data in spaces with thousands of dimensions have recently been addressed in literature for its importance in computational biology. An example of such applications is the analysis of genomic and proteomic data. Among the most promising techniques that classify such data in lower dimensional subspace, Top Scoring Pairs has the advantage of finding a two-dimensional subspace with a simple decision rule. In the present paper we show how this technique can take advantage from the utilization of incremental generalized eigenvalue classifier to obtain higher classification accuracy with a small training set.
A supervised learning Technique and its applications to computational biology
2009
Abstract
The problem of classifying data in spaces with thousands of dimensions have recently been addressed in literature for its importance in computational biology. An example of such applications is the analysis of genomic and proteomic data. Among the most promising techniques that classify such data in lower dimensional subspace, Top Scoring Pairs has the advantage of finding a two-dimensional subspace with a simple decision rule. In the present paper we show how this technique can take advantage from the utilization of incremental generalized eigenvalue classifier to obtain higher classification accuracy with a small training set.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


