Catholic University of Zimbabwe Library
Online Public Access Catalogue
(OPAC)

Graphs for Pattern Recognition Infeasible Systems of Linear Inequalities / Damir Gainanov.

By: Gainanov, Damir [author.]Material type: TextTextPublisher: De Gruyter, Description: 1 online resource (1 p.)ISBN: 9783110481068Subject(s): Technology & Engineering / Agriculture | Computers / Artificial Intelligence / Computer Vision & Pattern Recognition | ComputersGenre/Form: Electronic books.Online resources: View this content on Open Research Library. Summary: 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.
Tags from this library: No tags from this library for this title.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number URL Status Date due Barcode Item holds
eBook eBook Digital Library

Resources in this library are accessible in digital format e.g. eBooks or eJournals accessible online.

Online Access
Link to resource Available
Total holds: 0

Access copy available to the general public. Unrestricted star

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.

Description based on print version record.

KU Select 2019: STEM Backlist Books

There are no comments on this title.

to post a comment.

OPENING HOURS

Weekdays: 0815hrs - 1800hrs
Weekends:0900hrs - 1200hrs

Closed for Mass:

Mon, Thur: 1200hrs - 1300hrs
Sunday & Public Holiday’s

CALL SUPPORT

0242-570570, 0242-570169
09200664, +263 8644140602

LOCATION

18443, Cranborne Avenue, Hatfield, Harare

Other Links


©2021 | CUZ Library