Graphs for Pattern Recognition. Infeasible Systems of Linear Inequalities
| dc.contributor.author | Gainanov, Damir | * |
| dc.date.accessioned | 2021-02-11T14:52:11Z | |
| dc.date.available | 2021-02-11T14:52:11Z | |
| dc.date.issued | 2016 | * |
| dc.date.submitted | 2020-05-19 12:37:27 | * |
| dc.identifier | 45533 | * |
| dc.identifier.uri | https://directory.doabooks.org/handle/20.500.12854/48863 | |
| dc.description.abstract | Data mining and pattern recognition are areas based on the mathematical constructions discussed in this monograph. By using combinatorial and graph theoretical techniques, it is shown how to tackle infeasible systems of linear inequalities. These are, in turn, building blocks of geometric decision rules for pattern recognition. | * |
| dc.language | English | * |
| dc.subject | QA1-939 | * |
| dc.title | Graphs for Pattern Recognition. Infeasible Systems of Linear Inequalities | * |
| dc.type | book | |
| oapen.identifier.doi | 10.1515/9783110481068 | * |
| oapen.relation.isPublishedBy | af2fbfcc-ee87-43d8-a035-afb9d7eef6a5 | * |
| oapen.relation.isbn | 9783110481068 | * |
| oapen.pages | 148 | * |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||
This item appears in the following Collection(s)
Except where otherwise noted, this item's license is described
as
https://creativecommons.org/licenses/by-nc-nd/4.0/