Pattern Recognition on Oriented Matroids: The Existence of a Tope Committee
Combinatorics
2009-07-12 v5
Abstract
Oriented matroids can serve as a tool of modeling of collective decision-making processes in contradictory problems of pattern recognition. We present a generalization of the committee techniques of pattern recognition to oriented matroids. A tope committee for an oriented matroid is a subset of its maximal covectors such that every positive halfspace contains more than half of the maximal covectors from this subset. For a large subfamily of oriented matroids their committee structure is quite rich; for example, any maximal chains in their tope posets provide one with information sufficient to construct a committee.
Keywords
Cite
@article{arxiv.math/0607570,
title = {Pattern Recognition on Oriented Matroids: The Existence of a Tope Committee},
author = {Andrey O. Matveev},
journal= {arXiv preprint arXiv:math/0607570},
year = {2009}
}
Comments
40 pages, 12 figures; v.2 - corrections in Section 5.2, references added; v.3,4,5 - minor improvements and reorganization