Pattern Recognition on Oriented Matroids - Image 1

£54.55

De Gruyter Pattern Recognition on Oriented Matroids

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

Data Mining

It has never been this cheap. We have no record of a lower price.

£55 today · cheaper than every other day in the last 3 months

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 68 days · 68 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 68 days • 5 price levels

Days at Price

Current Price

Price Analysis

Most common price: £70 (45 days, 66.2%)

Price range: £55 - £70

Price levels: 5 different prices over 68 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 > Data Storage & Management > Data Mining
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

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Geometric Combinatorics (IAS/Park City Mathematics) (IAS/Park City Mathematics Series)

Extremal Finite Set Theory (Discrete Mathematics and Its Applications)

Extremal Finite Set Theory (Discrete Mathematics and Its Applications)

Extremal Problems for Finite Sets (Student Mathematical Library)

New Perspectives in Algebraic Combinatorics: 38 (Mathematical Sciences Research Institute Publications, Series Number 38)

Polytopes, Rings, and K-Theory (Springer Monographs in Mathematics)

Surveys in Combinatorics 2021 (London Mathematical Society Lecture Note Series)

Combinatorial and Algorithmic Mathematics: From Foundation to Optimization

Finite and Infinite Combinatorics in Sets and Logic: 411 (Nato Science Series C:, 411)

Extremal Combinatorics: With Applications in Computer Science (Texts in Theoretical Computer Science. An EATCS Series)

Applications of Group Theory to Combinatorics

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining: 146 (Intelligent Systems Reference Library, 146)

2017 MATRIX Annals: 2 (MATRIX Book Series, 2)

Handbook of Product Graphs, Second Edition (Discrete Mathematics and Its Applications)

Uniformly increasing Hypergraphs: On the regularity of Inclusion Ideals associated to Uniformly increasing Hypergraphs

Handbook of Product Graphs (Discrete Mathematics and Its Applications)

Mathematics via Problems: Part 3: Combinatorics: 29 (MSRI Mathematical Circles Library)

Surveys in Combinatorics 2024: Series Number 493 (London Mathematical Society Lecture Note Series, Series Number 493)

Graph Theory and Additive Combinatorics: Exploring Structure and Randomness

Oriented Matroids: 216 (Cambridge Studies in Advanced Mathematics, Series Number 216)

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

Essentials of Tropical Combinatorics: 219 (Graduate Studies in Mathematics)

Combinatorics of Nonnegative Matrices (Translations of Mathematical Monographs)

Essentials of Tropical Combinatorics (Graduate Studies in Mathematics)