Multi Center Polyhedral Conic Classifiers for Estimating Non-Linear Decision Boundaries

Saglamlar H., ÇEVİKALP H.

28th Signal Processing and Communications Applications Conference (SIU), ELECTR NETWORK, 5 - 07 Ekim 2020 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Doi Numarası: 10.1109/siu49456.2020.9302354
  • Basıldığı Ülke: ELECTR NETWORK
  • Anahtar Kelimeler: Polyhedral conic classifiers, multi center polyhedral conic classifiers, kernel SVM, k-means, classification
  • Eskişehir Osmangazi Üniversitesi Adresli: Evet

Özet

Polyhedral conic classifiers are getting popular with the performance against support vector machines (SVM). In these classifiers a conic function with a vertex point is used. Vertex point is an important parameter and improves the performance when it is set to the mean of positive samples. In cases where positive data belonging to the same class are clustered in different regions, a single classifier is not enough, and more than one classifier is needed. In this study, a novel multi center polyhedral conic classifiers (MCPCC) method is developed to use only one classifier to classify positive data clustered in different centers. Experiments are performed on two synthetic datasets using proposed method. The proposed method was compared with Kernel SVM and other polyhedral conic classifiers and it was found to give impressive results.