10 € off your first Starcart purchase (for one product valued over 60 €). Use coupon10 € off for one product over 60 €. Coupon code
STAR
See moreDe Gruyter
Graphs for Pattern Recognition
€132.39€243.70-46%
With code
STAR
€10 off of your first Starcart purchaseProduct sold and delivered by
Availability
AvailableDelivery fee
Calculated at checkout
Returns
Return fee applies, 14 days
Return conditions
Payment
30 days free payment period for all purchases
Description
This monograph deals with mathematical constructions that are foundational in such an important area of data mining as pattern recognition. By using combinatorial and graph theoretic techniques, a closer look is taken at infeasible systems of linear inequalities, whose generalized solutions act as building blocks of geometric decision rules for pattern recognition.
Infeasible systems of linear inequalities prove to be a key object in pattern recognition problems described in geometric terms thanks to the committee method. Such infeasible systems of inequalities represent an important special subclass of infeasible systems of constraints with a monotonicity property – systems whose multi-indices of feasible subsystems form abstract simplicial complexes (independence systems), which are fundamental objects of combinatorial topology.
The methods of data mining and machine learning discussed in this monograph form the foundation of technologies like big data and deep learning, which play a growing role in many areas of human-technology interaction and help to find solutions, better solutions and excellent solutions.
Contents:
Preface
Pattern recognition, infeasible systems of linear inequalities, and graphs
Infeasible monotone systems of constraints
Complexes, (hyper)graphs, and inequality systems
Polytopes, positive bases, and inequality systems
Monotone Boolean functions, complexes, graphs, and inequality systems
Inequality systems, committees, (hyper)graphs, and alternative covers
Bibliography
List of notation
Index
Infeasible systems of linear inequalities prove to be a key object in pattern recognition problems described in geometric terms thanks to the committee method. Such infeasible systems of inequalities represent an important special subclass of infeasible systems of constraints with a monotonicity property – systems whose multi-indices of feasible subsystems form abstract simplicial complexes (independence systems), which are fundamental objects of combinatorial topology.
The methods of data mining and machine learning discussed in this monograph form the foundation of technologies like big data and deep learning, which play a growing role in many areas of human-technology interaction and help to find solutions, better solutions and excellent solutions.
Contents:
Preface
Pattern recognition, infeasible systems of linear inequalities, and graphs
Infeasible monotone systems of constraints
Complexes, (hyper)graphs, and inequality systems
Polytopes, positive bases, and inequality systems
Monotone Boolean functions, complexes, graphs, and inequality systems
Inequality systems, committees, (hyper)graphs, and alternative covers
Bibliography
List of notation
Index
GTIN
9783110480139
Stores
Starcart may earn a commission when you buy with Starcart or directly from the merchants.
3 reasons to shop with Starcart
Get the lowest prices
Millions of products from various online stores at the best prices, plus additional Starcart benefits.
Buy with a single cart
With Starcart, you can easily make purchases from different online stores using just one shopping cart.
Pay securely
Starcart handles the payments to the stores for you, making your shopping experience safe and secure.