Classification using geometric level sets
Author(s)
Varshney, Kush R.; Willsky, Alan S.
Downloadvarshney10a.pdf (1011.Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2010-02Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Laboratory for Information and Decision SystemsJournal
Journal of Machine Learning Research
Publisher
Association for Computing Machinery (ACM)
Citation
Kush R. Varshney and Alan S. Willsky. 2010. Classification Using Geometric Level Sets. J. Mach. Learn. Res. 11 (March 2010), 491-516.
Version: Final published version
ISSN
1532-4435
1533-7928