1Oriented Matroids, the Pattern Recognition Problem, and Tope Committees
In this chapter we state the two-class pattern recognition problem in the language of oriented matroids and show that oriented matroids with very weak restrictions on their properties always have certain subsets of maximal covectors that can serve as building blocks of collective decision rules.
We present a natural generalization, in terms of maximal covectors of an oriented matroid, of the notion of committee of a linear inequality system: a tope committee 
for an oriented matroid is defined to be a subset of its maximal covectors such that for every element of the ground ...
Get Pattern Recognition on Oriented Matroids now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
