Classification by vertical and cutting multi-hyperplane decision tree induction

  • Authors:
  • Marco Better;Fred Glover;Michele Samorani

  • Affiliations:
  • OptTek Systems, Inc., 1919 Seventh Street, Boulder, Colorado 80302, United States;OptTek Systems, Inc., 1919 Seventh Street, Boulder, Colorado 80302, United States;Leeds School of Business, University of Colorado at Boulder, Campus Box419, Boulder, Colorado 80309, United States

  • Venue:
  • Decision Support Systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Two-group classification is a key task in decision making and data mining applications. We introduce two new mixed integer programming formulations that make use of multiple separating hyperplanes. They represent a generalization of previous piecewise-linear models that embed rules having the form of hyperplanes, which are used to successively separate the two groups. In fact, the classifiers obtained are particular types of decision trees which are allowed to grow in depth and not in width. Computational results show that our models achieve better classification accuracy in less time than previous approaches.