Hyperplane algorithm - first step of the paired planes classification procedure

  • Authors:
  • Dan Vance;Anca L. Ralescu

  • Affiliations:
  • University of Cincinnati, Cincinnati, Ohio;University of Cincinnati, Cincinnati, Ohio

  • Venue:
  • AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The objective of supervised learning is to estimate unknowns based on labeled training samples. If the unknown to be estimated is categorical or discrete, the problem is one of classification. Algorithms for supervised learning are useful tools in many areas of agriculture, medicine, and engineering, including prediction of malignant cancer, document analysis, and speech recognition. In general, Support Vector Machine algorithms have been successful in classification problems, but they have high computational complexity. In this paper, we present the Hyperplane Algorithm. It and two other related algorithms form an ensemble classifier for supervised classification. The Hyperplane Algorithm is reminiscent of a support vector machine but is low in computational complexity. It also has several other advantages compared to Support Vector Machines. Results for five real-life datasets results are shown.