Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    UID:
    b3kat_BV043858717
    Umfang: X, 147 Seiten
    ISBN: 9783110480139 , 9783110481075
    Anmerkung: Erscheint auch als Open Access bei De Gruyter
    Weitere Ausg.: Erscheint auch als Online-Ausgabe, PDF ISBN 978-3-11-048106-8 10.1515/9783110481068
    Weitere Ausg.: Erscheint auch als Online-Ausgabe, EPUB ISBN 978-3-11-048030-6 10.1515/9783110481068
    Sprache: Englisch
    Fachgebiete: Informatik , Mathematik
    RVK:
    RVK:
    Schlagwort(e): Lineares Ungleichungssystem ; Graphentheorie ; Kombinatorische Optimierung ; Mustererkennung
    URL: Volltext  (kostenfrei)
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    UID:
    gbv_1777648858
    Umfang: 1 Online-Ressource (X, 147 Seiten) , Illustrationen
    ISBN: 9783110481068 , 9783110480306
    Anmerkung: Literaturverzeichnis Seite 133-140
    Weitere Ausg.: ISBN 3110480131
    Weitere Ausg.: ISBN 9783110480139
    Weitere Ausg.: ISBN 9783110481075
    Weitere Ausg.: ISBN 9783110481075
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe Gainanov, Damir N. Graphs for pattern recognition Berlin : De Gruyter, 2016 ISBN 3110480131
    Weitere Ausg.: ISBN 9783110480139
    Weitere Ausg.: ISBN 9783110481075
    Sprache: Englisch
    Fachgebiete: Informatik , Mathematik
    RVK:
    RVK:
    Schlagwort(e): Lineares Ungleichungssystem ; Graphentheorie ; Kombinatorische Optimierung ; Mustererkennung
    URL: Cover
    URL: Volltext  (Open Access)
    URL: Cover
    URL: Cover
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Online-Ressource
    Online-Ressource
    Berlin, [Germany] ; : De Gruyter,
    UID:
    almahu_9948327635802882
    Umfang: 1 online resource (158 pages)
    ISBN: 9783110481068 (e-book)
    Weitere Ausg.: Print version: Gainanov, Damir (Damir N.) Graphs for pattern recognition : infeasible systems of linear inequalities. Berlin, [Germany] ; Boston, [Massachusetts] : De Gruyter, c2016 ISBN 9783110480139
    Sprache: Deutsch
    Fachgebiete: Informatik , Mathematik
    RVK:
    RVK:
    Schlagwort(e): Electronic books. ; Electronic books
    URL: Volltext  (lizenzpflichtig)
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Online-Ressource
    Online-Ressource
    De Gruyter,
    UID:
    kobvindex_HPB960975717
    Umfang: 1 online resource (158)
    ISBN: 3110481065 , 9783110481068
    Inhalt: 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.
    Anmerkung: 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
    Weitere Ausg.: Print version: ISBN 9783110480139
    Weitere Ausg.: ISBN 3110480131
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    Online-Ressource
    Online-Ressource
    Berlin, [Germany] ; : De Gruyter,
    UID:
    almahu_9949517702102882
    Umfang: 1 online resource (158 pages)
    ISBN: 9783110481068
    Weitere Ausg.: Print version: Gainanov, Damir (Damir N.) Graphs for pattern recognition : infeasible systems of linear inequalities. Berlin, [Germany] ; Boston, [Massachusetts] : De Gruyter, c2016 ISBN 9783110480139
    Sprache: Deutsch
    Schlagwort(e): Electronic books.
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    Online-Ressource
    Online-Ressource
    Berlin ;Boston :De Gruyter,
    UID:
    edocfu_9958354675802883
    Umfang: 1 online resource (158p.)
    ISBN: 9783110481068
    Inhalt: 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.
    Anmerkung: 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.
    Weitere Ausg.: ISBN 978-3-11-048013-9
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    Online-Ressource
    Online-Ressource
    De Gruyter | Berlin, [Germany] ; : De Gruyter,
    UID:
    almahu_9948249612302882
    Umfang: 1 online resource (x, 147 pages)
    Ausgabe: 1st ed.
    ISBN: 3-11-048030-1 , 3-11-048106-5
    Inhalt: 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
    Anmerkung: 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.
    Weitere Ausg.: ISBN 3-11-048013-1
    Sprache: Deutsch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    Online-Ressource
    Online-Ressource
    De Gruyter | Berlin, [Germany] ; : De Gruyter,
    UID:
    edocfu_9959237949302883
    Umfang: 1 online resource (x, 147 pages)
    Ausgabe: 1st ed.
    ISBN: 3-11-048030-1 , 3-11-048106-5
    Inhalt: 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
    Anmerkung: 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.
    Weitere Ausg.: ISBN 3-11-048013-1
    Sprache: Deutsch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 9
    Online-Ressource
    Online-Ressource
    De Gruyter | Berlin, [Germany] ; : De Gruyter,
    UID:
    edoccha_9959237949302883
    Umfang: 1 online resource (x, 147 pages)
    Ausgabe: 1st ed.
    ISBN: 3-11-048030-1 , 3-11-048106-5
    Inhalt: 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
    Anmerkung: 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.
    Weitere Ausg.: ISBN 3-11-048013-1
    Sprache: Deutsch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Meinten Sie 9783110180039?
Meinten Sie 9783110280739?
Meinten Sie 9783110348019?
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz