Classification Using Geometric Level Sets

A variational level set method is developed for the supervised classification problem. Nonlinear classifier decision boundaries are obtained by minimizing an energy functional that is composed of an empirical risk term with a margin-based loss and a geometric regularization term new to machine learning: the surface area of the decision boundary. This geometric level set classifier is analyzed in terms of consistency and complexity through the calculation of its ε-entropy. For multicategory classification, an efficient scheme is developed using a logarithmic number of decision functions in the number of classes rather than the typical linear number of decision functions. Geometric level set classification yields performance results on benchmark data sets that are competitive with well-established methods. [abs] [ pdf ][ bib ] &copy JMLR 2010. ( edit, beta )

Authors

• Kush R. Varshney IBM Research
• Alan S. Willsky

Keywords

No keywords are indexed for this paper.