Minimal consistent subset selection as integer nonlinear programming problem

Abstract

The minimal consistent subset selection is a solution of high computational demands problem of the nearest neighbor decision system. This paper presents a new approach that aims to make the problem more clearly by stating it as a constrained optimization problem, called "integer nonlinear programming problem (INLP)". In this context, we propose method that formulates the minimal consistent subset selection problem as 0-1 integer nonlinear programming problem. We show experimental result of the minimal consistent subset of "IRIS Dataset", obtained by solving its constrained optimization model. The results obtained suggest that the approach offers exactly optimal solution of the problem. © 2006 IEEE.