A simple algorithm for convex hull determination in high dimensions

Khosravani, Hamid Reza; Ruano, Antonio; Ferreira, P. M.

http://hdl.handle.net/10400.1/4778

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
06657492.pdf		1.33 MB	Adobe PDF	Download

Send Feedback

Authors

Khosravani, Hamid Reza

Ruano, Antonio

Ferreira, P. M.

Abstract(s)

Selecting suitable data for neural network training, out of a larger set, is an important task. For approximation problems, as the role of the model is a nonlinear interpolator, the training data should cover the whole range where the model must be used, i.e., the samples belonging to the convex hull of the data should belong to the training set. Convex hull is also widely applied in reducing training data for SVM classification. The determination of the samples in the convex-hull of a set of high dimensions, however, is a time-complex task. In this paper, a simple algorithm for this problem is proposed.

Keywords

Convex hull Data selection problem Neural networks SVM

URI

http://hdl.handle.net/10400.1/4778

Citation

Khosravani, Hamid R.; Ruano, Antonio E; Ferreira, Pedro M.A simple algorithm for convex hull determination in high dimensions, Trabalho apresentado em 2013 IEEE International Symposium on Intelligent Signal Processing (WISP), In 2013 IEEE 8th International Symposium on Intelligent Signal Processing, Funchal, Portugal, 2013.