A polyhedral conic functions based classification method for noisy data
Journal of Industrial and Management Optimization, 2021 <p style='text-indent:20px;'>This paper presents a robust binary classification method, which is an extended version of the Modified Polyhedral Conic Functions (M-PCF) algorithm, earlier developed by Gasimov and Ozturk. The new version presented in this paper, has new features in comparison to the original algorithm.
Müge Acar, Refail Kasımbeyli
exaly +4 more sources
Clustering based polyhedral conic functions algorithm in classification
Journal of Industrial and Management Optimization, 2015 In this study, a new algorithm based on polyhedral conic functions (PCFs) is developed to solve multi-class supervised data classification problems. The $k$ PCFs are constructed for each class in order to separate it from the rest of the data set. The $k$-means algorithm is applied to find vertices of PCFs and then a linear programming model is solved ...
Gurkan Öztürk
exaly +3 more sources
ICF: An algorithm for large scale classification with conic functions
SoftwareX, 2018 Incremental Conic Functions (ICF) algorithm is developed for solving classification problems based on mathematical programming. This algorithm improves previous version of conic function-based classifier construction in terms of computational speed ...
Emre Cimen +2 more
doaj +3 more sources
A Binary Classification Algorithm Based on Polyhedral Conic Functions
Düzce Üniversitesi Bilim ve Teknoloji Dergisi, 2015 Data classification is one of the main techniques of data mining. Different mathematical programming approaches of the data classification were presented in recent years.
Nur Uylaş Satı
doaj +1 more source
A novel semisupervised classification method via membership and polyhedral conic functions
Turkish Journal of Electrical Engineering and Computer Sciences, 2020 WOS ...
exaly +2 more sources
Application of the Polyhedral Conic Functions Method in the Text Classification and Comparative Analysis [PDF]
Scientific Programming, 2018 In direct proportion to the heavy increase of online information data, the attention to text categorization (classification) has also increased. In text categorization problem, namely, text classification, the goal is to classify the documents into predefined classes (categories or labels).
Nur Uylas Sati, Burak Ordin
openaire +3 more sources
From Steiner Formulas for Cones to Concentration of Intrinsic Volumes [PDF]
, 2014 The intrinsic volumes of a convex cone are geometric functionals that return basic structural information about the cone. Recent research has demonstrated that conic intrinsic volumes are valuable for understanding the behavior of random convex ...
McCoy, Michael B., Tropp, Joel A.
core +2 more sources
Polyhedral conic kernel-like functions for SVMs
TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES, 2019 In this study, we propose a new approach that can be used as a kernel-like function for support vector machines (SVMs) in order to get nonlinear classification surfaces. We combined polyhedral conic functions (PCFs) with the SVM method. To get nonlinear classification surfaces, kernel functions are used with SVMs.
GÜRKAN ÖZTÜRK, EMRE ÇİMEN
openaire +1 more source
Intrinsic Volumes of Polyhedral Cones: A combinatorial perspective [PDF]
, 2017 The theory of intrinsic volumes of convex cones has recently found striking applications in areas such as convex optimization and compressive sensing.
Amelunxen, Dennis, Lotz, Martin
core +2 more sources
A distributionally robust perspective on uncertainty quantification and chance constrained programming [PDF]
, 2015 The objective of uncertainty quantification is to certify that a given physical, engineering or economic system satisfies multiple safety conditions with high probability.
Hanasusanto, GA +3 more
core +1 more source