Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    De Gruyter | Berlin, [Germany] ; : De Gruyter,
    UID:
    edocfu_9959237949302883
    Format: 1 online resource (x, 147 pages)
    Edition: 1st ed.
    ISBN: 3-11-048030-1 , 3-11-048106-5
    Content: 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:PrefacePattern recognition, infeasible systems of linear inequalities, and graphsInfeasible monotone systems of constraintsComplexes, (hyper)graphs, and inequality systemsPolytopes, positive bases, and inequality systemsMonotone Boolean functions, complexes, graphs, and inequality systemsInequality systems, committees, (hyper)graphs, and alternative coversBibliographyList of notationIndex
    Note: Frontmatter -- , Preface -- , Contents -- , 1. Pattern recognition, infeasible systems of linear inequalities, and graphs -- , 2. Complexes, (hyper)graphs, and inequality systems -- , 3. Polytopes, positive bases, and inequality systems -- , 4. Monotone Boolean functions, complexes, graphs, and inequality systems -- , 5. Inequality systems, committees, (hyper)graphs, and alternative covers -- , Bibliography -- , List of notation -- , Index , In English.
    Additional Edition: ISBN 3-11-048013-1
    Language: German
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages