Weighted Order Statistic Classifiers with Large Rank-Order Margin

Abstract

We investigate how stack filter function classes like weighted order statistics can be applied to classification problems. This leads to a new design criteria for linear classifiers when inputs are binary-valued and weights are positive. We present a rank-based measure of margin that is directly optimized as a standard linear program and investigate its relationship to regularization. Our approach can robustly combine large numbers of base hypothesis and has similar performance to other types of regularization. ICML Proceedings of the Twentieth International Conference on Machine Learning

Cite

Text

Porter et al. "Weighted Order Statistic Classifiers with Large Rank-Order Margin." International Conference on Machine Learning, 2003.

Markdown

[Porter et al. "Weighted Order Statistic Classifiers with Large Rank-Order Margin." International Conference on Machine Learning, 2003.](https://mlanthology.org/icml/2003/porter2003icml-weighted/)

BibTeX

@inproceedings{porter2003icml-weighted,
  title     = {{Weighted Order Statistic Classifiers with Large Rank-Order Margin}},
  author    = {Porter, Reid B. and Eads, Damian and Hush, Don R. and Theiler, James},
  booktitle = {International Conference on Machine Learning},
  year      = {2003},
  pages     = {600-607},
  url       = {https://mlanthology.org/icml/2003/porter2003icml-weighted/}
}