An incremental piecewise linear classifier based on polyhedral conic separation

Creative Commons License


Machine Learning, vol.101, no.1-3, pp.397-413, 2015 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 101 Issue: 1-3
  • Publication Date: 2015
  • Doi Number: 10.1007/s10994-014-5449-9
  • Journal Name: Machine Learning
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.397-413
  • Keywords: Classification, Polyhedral conic separation, Nonsmooth nonconvex optimization, Discrete gradient method, NONSMOOTH OPTIMIZATION, RADIAL EPIDERIVATIVES, SEPARABILITY
  • Anadolu University Affiliated: Yes


© 2014, The Author(s).In this paper, a piecewise linear classifier based on polyhedral conic separation is developed. This classifier builds nonlinear boundaries between classes using polyhedral conic functions. Since the number of polyhedral conic functions separating classes is not known a priori, an incremental approach is proposed to build separating functions. These functions are found by minimizing an error function which is nonsmooth and nonconvex. A special procedure is proposed to generate starting points to minimize the error function and this procedure is based on the incremental approach. The discrete gradient method, which is a derivative-free method for nonsmooth optimization, is applied to minimize the error function starting from those points. The proposed classifier is applied to solve classification problems on 12 publicly available data sets and compared with some mainstream and piecewise linear classifiers.