Pattern Recognition on Oriented Matroids - Image 1

£87.56

De Gruyter Pattern Recognition on Oriented Matroids

Name: Pattern Recognition on Oriented Matroids
Brand: De Gruyter
Price: 91.0 GBP
Availability: InStock

Beginners & Introduction

Price History & Forecast

Last 29 days • 29 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 29 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £91 (17 days, 58.6%)

Price range: £88 - £91

Price levels: 2 different prices over 29 days

Description

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 theory was laid in the mid-1960s, when it was shown that the familiar notion of solution to a feasible system of linear inequalities has ingenious analogues which can serve as collective solutions to infeasible systems. A hierarchy of dialects in the language of mathematics, for instance, open cones in the context of linear inequality systems, regions of hyperplane arrangements, and maximal covectors (or topes) of oriented matroids, provides an excellent opportunity to take a fresh look at the infeasible system of homogeneous strict linear inequalities - the standard working model for the contradictory two-class pattern recognition problem in its geometric setting. The universal language of oriented matroid theory considerably simplifies a structural and enumerative analysis of applied aspects of the infeasibility phenomenon. The present book is devoted to several selected topics in the emerging theory of pattern recognition on oriented matroids: the questions of existence and applicability of matroidal generalizations of committee decision rules and related graph-theoretic constructions to oriented matroids with very weak restrictions on their structural properties; a study (in which, in particular, interesting subsequences of the Farey sequence appear naturally) of the hierarchy of the corresponding tope committees; a description of the three-tope committees that are the most attractive approximation to the notion of solution to an infeasible system of linear constraints; an application of convexity in oriented matroids as well as blocker constructions in combinatorial optimization and in poset theory to enumerative problems on tope committees; an attempt to clarify how elementary changes (one-element reorientations) in an oriented matroid affect the family of its tope committees; a discrete Fourier analysis of the important family of critical tope committees through rank and distance relations in the tope poset and the tope graph; the characterization of a key combinatorial role played by the symmetric cycles in hypercube graphs. ContentsOriented Matroids, the Pattern Recognition Problem, and Tope CommitteesBoolean IntervalsDehn-Sommerville Type RelationsFarey SubsequencesBlocking Sets of Set Families, and Absolute Blocking Constructions in PosetsCommittees of Set Families, and Relative Blocking Constructions in PosetsLayers of Tope CommitteesThree-Tope CommitteesHalfspaces, Convex Sets, and Tope CommitteesTope Committees and Reorientations of Oriented MatroidsTopes and Critical CommitteesCritical Committees and Distance SignalsSymmetric Cycles in the Hypercube Graphs

Product Specifications

Brand: De Gruyter
Format: hardcover
ASIN: 3110530716
Category: Books > Subjects > Computing & Internet > Databases > Beginners & Introduction
Domain: Amazon UK
Release Date: 11 September 2017
Listed Since: 01 March 2017

Barcode

No barcode data available

De Gruyter Pattern Recognition on Oriented Matroids

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Graphs for Pattern Recognition: Infeasible Systems of Linear Inequalities

/uploads/images/products/2/B0D9H66CH7/de02f99d-bad7-4d89-b10c-cc7c8f380e2a.webp

Matroid Theory (Oxford Graduate Texts In Mathematics): 21

Combinatorics of Nonnegative Matrices (Translations of Mathematical Monographs)

Language Computability and Formal Language Theory

Non-Commutative Cryptography and Complexity of Group-Theoretic Problems (Mathematical Surveys and Monographs)

Connection Matrices in Combinatorial Topological Dynamics (SpringerBriefs in Mathematics)

Matrix Theory (Graduate Studies in Mathematics)

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

Deterministic Operations Research: Models and Methods in Linear Optimization

Effective Methods in Algebraic Geometry: 94 (Progress in Mathematics)

Springer Computational Invariant Theory: 130 Mathematics Book

Computational Oriented Matroids: Equivalence Classes of Matrices within a Natural Framework

Connective Real K-theory of Finite Groups: 169 (Mathematical Surveys and Monographs)

Combinatorial and Algorithmic Mathematics: From Foundation to Optimization

The Structure of Compact Groups: A Primer for Students - A Handbook for the Expert (De Gruyter Studies in Mathematics, 25)

Lattice Path Combinatorics and Applications: 58 (Developments in Mathematics, 58)

Connections in Discrete Mathematics: A Celebration of the Work of Ron Graham

Algebraic Methods in Statistics and Probability II (Contemporary Mathematics): Ams Special Session Algebraic Methods in Statistics and Probability, ... Illinois at Urbana-champaign, Champaign, Il

An Introduction to Convex Polytopes: 90 (Graduate Texts in Mathematics, 90)

Combinatorial Methods with Computer Applications: Discrete Mathematics and Its Applications

De Gruyter - The Adjunction Theory of Complex Projective Varieties

Lectures on Convex Sets