Skip to main content

A classification method based on generalized eigenvalue problems

Buy Article:

$55.00 plus tax (Refund Policy)

Binary classification refers to supervised techniques that split a set of points in two classes, with respect to a training set of points whose membership is known for each class. Binary classification plays a central role in the solution of many scientific, financial, engineering, medical and biological problems. Many methods with good classification accuracy are currently available. This work shows how a binary classification problem can be expressed in terms of a generalized eigenvalue problem. A new regularization technique is proposed, which gives results that are comparable to other techniques in use, in terms of classification accuracy. The advantage of this method relies in its lower computational complexity with respect to the existing techniques based on generalized eigenvalue problems. Finally, the method is compared with other methods using benchmark data sets.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

Keywords: Binary classification; Classification; Generalized Eigenvalue problem

Document Type: Research Article

Affiliations: 1: High Performance Computing and Networking Institute, National Research Council, Italy 2: Department of Statistic, Probability and Applied Statistics, University of Rome 'La Sapienza', Italy 3: Center for Applied Optimization, University of Florida, Gainesville, FL, USA

Publication date: 01 February 2007

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more