Pattern Recognition on Oriented Matroids: The Existence of a Tope Committee
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matroids and geometric lattices (05B35) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Pattern recognition, speech recognition (68T10)
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.
This page was built for publication: Pattern Recognition on Oriented Matroids: The Existence of a Tope Committee
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6477568)
