Optimization approaches for classification and feature selection using overlapping hyperboxes

Download

index.pdf

Date

2019

Author

Akbulut, Derya

Metadata

Show full item record

Item Usage Stats

350
views

135
downloads

In this thesis, an optimization approach is proposed for the binary classification problem. A mixed integer programming (MIP) model formulation is used to generate hyperboxes as classifiers. The hyperboxes are determined by lower and upper bounds on the feature values, and overlapping of hyperboxes is allowed to reach a balance between misclassification and overfitting. For the test phase, distance-based heuristic algorithms are also developed to classify the overlap and uncovered samples that are not classified by the hyperboxes. A matheuristic, namely Hyperbox Classification for Binary classes (HCB), is developed based on the MIP formulation. In each iteration of the HCB algorithm, a fixed number of hyperboxes are generated using the MIP model, and unclassified sample size is reduced by a hyperbox trimming algorithm. Although HCB controls the number of hyperboxes in a greedy manner, it provides an overall hyperbox configuration with no misclassification at the end of the training phase. HCB is extended as HCB-f with the addition of feature selection property. Starting with a single feature, HCB-f inserts features and hyperboxes to the model iteratively. When the algorithm terminates, only the set of inserted features are used for classification, hence they are selected.

Subject Keywords

Data mining., Classification., Computer algorithms., Integer programming., Programming (Mathematics).

URI

http://etd.lib.metu.edu.tr/upload/12623147/index.pdf
https://hdl.handle.net/11511/28031

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Effective optimization with weighted automata on decomposable trees Ravve, E. V.; Volkovich, Z.; Weber, Gerhard Wilhelm (Informa UK Limited, 2014-01-02) In this paper, we consider quantitative optimization problems on decomposable discrete systems. We restrict ourselves to labeled trees as the description of the systems and we use weighted automata on them as our computational model. We introduce a new kind of labeled decomposable trees, sum-like weighted labeled trees, and propose a method, which allows us to reduce the solution of an optimization problem, defined in a fragment of Weighted Monadic Second Order Logic, on such a tree to the solution of effec...
Optimising a nonlinear utility function in multi-objective integer programming Ozlen, Melih; Azizoğlu, Meral; Burton, Benjamin A. (2013-05-01) In this paper we develop an algorithm to optimise a nonlinear utility function of multiple objectives over the integer efficient set. Our approach is based on identifying and updating bounds on the individual objectives as well as the optimal utility value. This is done using already known solutions, linear programming relaxations, utility function inversion, and integer programming. We develop a general optimisation algorithm for use with k objectives, and we illustrate our approach using a tri-objective i...
Numerical method for optimizing stirrer configurations Schafer, M; Karasözen, Bülent; Uludağ, Yusuf; YAPICI, KEREM; Uğur, Ömür (2005-12-15) A numerical approach for the numerical optimization of stirrer configurations is presented. The methodology is based on a parametrized grid generator, a flow solver, and a mathematical optimization tool, which are integrated into an automated procedure. The flow solver is based on the discretization of the Navier-Stokes equations by means of the finite-volume method for block-structured, boundary-fitted grids with multi-grid acceleration and parallelization by grid partitioning. The optimization tool is an ...
Generating representative nondominated point subsets in multi-objective integer programs Ceyhan, Gökhan; Köksalan, Murat; Lokman, Banu; Department of Industrial Engineering (2014) In this thesis, we study generating a subset of all nondominated points of multi-objective integer programs in order to represent the nondominated frontier. Our motivation is based on the fact that generating all nondominated points of a multi-objective integer program is neither practical nor useful. The computational burden could be prohibitive and the resulting set could be huge. Instead of finding all nondominated points, we develop algorithms to generate a small representative subset of nondominated po...
Continuous optimization approaches for clustering via minimum sum of squares Akteke-Ozturk, Basak; Weber, Gerhard Wilhelm; Kropat, Erik (2008-05-23) In this paper, we survey the usage of semidefinite programming (SDP), and nonsmooth optimization approaches for solving the minimum sum of squares problem which is of fundamental importance in clustering. We point out that the main clustering idea of support vector clustering (SVC) method could be interpreted as a minimum sum of squares problem and explain the derivation of semidefinite programming and a nonsmooth optimization formulation for the minimum sum of squares problem. We compare the numerical resu...

Citation Formats

D. Akbulut, “Optimization approaches for classification and feature selection using overlapping hyperboxes,” Ph.D. - Doctoral Program, Middle East Technical University, 2019.