Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

2020

TÜBİTAK

Conic functions

Articles 1 - 2 of 2

Full-Text Articles in Engineering

A Random Subspace Based Conic Functions Ensemble Classifier, Emre Çi̇men Jan 2020

A Random Subspace Based Conic Functions Ensemble Classifier, Emre Çi̇men

Turkish Journal of Electrical Engineering and Computer Sciences

Classifiers overfit when the data dimensionality ratio to the number of samples is high in a dataset. This problem makes a classification model unreliable. When the overfitting problem occurs, one can achieve high accuracy in the training; however, test accuracy occurs significantly less than training accuracy. The random subspace method is a practical approach to overcome the overfitting problem. In random subspace methods, the classification algorithm selects a random subset of the features and trains a classifier function trained with the selected features. The classification algorithm repeats the process multiple times, and eventually obtains an ensemble of classifier functions. Conic …


Revised Polyhedral Conic Functions Algorithm For Supervised Classification, Gürhan Ceylan, Gürkan Öztürk Jan 2020

Revised Polyhedral Conic Functions Algorithm For Supervised Classification, Gürhan Ceylan, Gürkan Öztürk

Turkish Journal of Electrical Engineering and Computer Sciences

In supervised classification, obtaining nonlinear separating functions from an algorithm is crucial for prediction accuracy. This paper analyzes the polyhedral conic functions (PCF) algorithm that generates nonlinear separating functions by only solving simple subproblems. Then, a revised version of the algorithm is developed that achieves better generalization and fast training while maintaining the simplicity and high prediction accuracy of the original PCF algorithm. This is accomplished by making the following modifications to the subproblem: extension of the objective function with a regularization term, relaxation of a hard constraint set and introduction of a new error term. Experimental results show that …