A novel piecewise linear classifier based on polyhedral conic and max-min separabilities

Bagirov A. M., Ugon J., Webb D., ÖZTÜRK G., Kasimbeyli R.

TOP, cilt.21, sa.1, ss.3-24, 2013 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 21 Sayı: 1
  • Basım Tarihi: 2013
  • Doi Numarası: 10.1007/s11750-011-0241-5
  • Dergi Adı: TOP
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.3-24
  • Anahtar Kelimeler: Nonsmooth optimization, Piecewise linear separability, Data mining, Supervised learning, Piecewise linear classifiers, MINIMIZATION, DESIGN
  • Anadolu Üniversitesi Adresli: Evet

Özet

In this paper, an algorithm for finding piecewise linear boundaries between pattern classes is developed. This algorithm consists of two main stages. In the first stage, a polyhedral conic set is used to identify data points which lie inside their classes, and in the second stage we exclude those points to compute a piecewise linear boundary using the remaining data points. Piecewise linear boundaries are computed incrementally starting with one hyperplane. Such an approach allows one to significantly reduce the computational effort in many large data sets. Results of numerical experiments are reported. These results demonstrate that the new algorithm consistently produces a good test set accuracy on most data sets comparing with a number of other mainstream classifiers.