Right of Inference: Nearest Rectangle Learning Revisited

Abstract

In Nearest Rectangle ( NR ) learning, training instances are generalized into hyperrectangles and a query is classified according to the class of its nearest rectangle. The method has not received much attention since its introduction mainly because, as a hybrid learner, it does not gain accuracy advantage while sacrificing classification time comparing to some other interpretable eager learners such as decision trees. In this paper, we seek for accuracy improvement of NR learning through controlling the generation of rectangles, so that each of them has the right of inference . Rectangles having the right of inference are compact, conservative, and good for making local decisions. Experiments on benchmark datasets validate the effectiveness of the proposed approach.

Cite

Text

Gao and Ester. "Right of Inference: Nearest Rectangle Learning Revisited." European Conference on Machine Learning, 2006. doi:10.1007/11871842_62

Markdown

[Gao and Ester. "Right of Inference: Nearest Rectangle Learning Revisited." European Conference on Machine Learning, 2006.](https://mlanthology.org/ecmlpkdd/2006/gao2006ecml-right/) doi:10.1007/11871842_62

BibTeX

@inproceedings{gao2006ecml-right,
  title     = {{Right of Inference: Nearest Rectangle Learning Revisited}},
  author    = {Gao, Byron J. and Ester, Martin},
  booktitle = {European Conference on Machine Learning},
  year      = {2006},
  pages     = {638-645},
  doi       = {10.1007/11871842_62},
  url       = {https://mlanthology.org/ecmlpkdd/2006/gao2006ecml-right/}
}