Machine Learning
The symmetric eigenvalue problem
The symmetric eigenvalue problem
Support vector machines: hype or hallelujah?
ACM SIGKDD Explorations Newsletter - Special issue on “Scalable data mining algorithms”
Neural Networks for Pattern Recognition
Neural Networks for Pattern Recognition
Machine Learning
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
M@CBETH: a microarray classification benchmarking tool
Bioinformatics
Incremental Classification with Generalized Eigenvalues
Journal of Classification
A classification method based on generalized eigenvalue problems
Optimization Methods & Software - Systems Analysis, Optimization and Data Mining in Biomedicine
Data Mining in Biomedicine
Hi-index | 0.00 |
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.