A new algorithm for solving convex hull problem and its application to feature selection

A new method to solve the convex hull problem in n-dimensional spaces is proposed in this paper. At each step, a new point is added into the convex hull if the point is judged to be out of the current convex hull by a linear programming model. For the linear separable classification problem, if an instance is regarded as a point of the instances space, the overlap does not still occur between the convex hulls of different classes after a feature is deleted, then we can delete that feature. Repeat this process, an algorithm for feature selection is given. Experimental results show the effectiveness of the algorithm.