Pattern recognition on oriented matroids /
Pattern Recognition on Oriented Matroids covers a range of innovative problems in combinatorics, poset and graph theories, optimization, and number theory that constitute a far-reaching extension of the arsenal of committee methods in pattern recognition. The groundwork for the modern committee theo...
Clasificación: | Libro Electrónico |
---|---|
Autor principal: | |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Berlin ; Boston :
De Gruyter,
[2017]
|
Temas: | |
Acceso en línea: | Texto completo |
Tabla de Contenidos:
- Frontmatter
- Preface
- Contents
- Committees for Pattern Recognition: Infeasible Systems of Linear Inequalities, Hyperplane Arrangements, and Realizable Oriented Matroids
- 1. Oriented Matroids, the Pattern Recognition Problem, and Tope Committees
- 2. Boolean Intervals
- 3. Dehn-Sommerville Type Relations
- 4. Farey Subsequences
- 5. Blocking Sets of Set Families, and Absolute Blocking Constructions in Posets
- 6. Committees of Set Families, and Relative Blocking Constructions in Posets
- 7. Layers of Tope Committees
- 8. Three-Tope Committees
- 9. Halfspaces, Convex Sets, and Tope Committees
- 10. Tope Committees and Reorientations of Oriented Matroids
- 11. Topes and Critical Committees
- 12. Critical Committees and Distance Signals
- 13. Symmetric Cycles in the Hypercube Graphs
- Bibliography
- List of Notation
- Index.