• Title: Graphs for Pattern Recognition: Infeasible Systems of Linear Inequalities
• Authors Damir Gainanov
• Publisher: De Gruyter; 1st edition (October 10, 2016); eBook (Creative Commons Licensed)
• License(s): Creative Commons License (CC)
• Paperback: 158 pages
• eBook: PDF
• Language: English
• ISBN-10: 3110480131
• ISBN-13: 978-3110480139
• Share This:  

Book Description

This book 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.

• Damir Gainanov, Ural Federal University, Russia.

• Amazon

• Graph Theory
• Combinatorics
• Data Analysis/Mining
• Algorithms and Data Structures
• Discrete and Finite Mathematics

• Graphs for Pattern Recognition: Infeasible Systems of Linear Inequalities
• The Mirror Site (1) - PDF

• Pattern Recognition and Machine Learning (Christopher Bishop)

  This is the first textbook on Pattern Recognition to present the Bayesian viewpoint. The book presents approximate inference algorithms that permit fast approximate answers in situations where exact answers are not feasible.

• Deep Learning on Graphs (Yao Ma, et al)

  The book is a self-contained, comprehensive text on foundations and techniques of Graph Neural Networks with applications in NLP, data mining, vision and healthcare. Accessible to who want to use graph neural networks to advance their disciplines.

• Graph Theory (Reinhard Diestel)

  This book covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail.

• Graph Theory - Advanced Algorithms and Applications

  Not only will the methods and explanations help you to understand more about graph theory, but you will find it joyful to discover ways that you can apply graph theory in your applications or scientific research.

• Graph Theory and Complex Networks (Maarten van Steen)

  This book aims to explain the basics of graph theory that are needed at an introductory level for students in computer or information sciences. It also aims to provide an introduction to the modern field of network science.

• Probability on Trees and Networks (Russell Lyons, et al.)

  This book is concerned with certain aspects of discrete probability on infinite graphs that are currently in vigorous development. Of course, finite graphs are analyzed as well, but usually with the aim of understanding infinite graphs and networks.

• Random Graphs and Complex Networks (Remco van der Hofstad)

  This rigorous introduction to network science presents Random Graphs as models for real-world networks. Such networks have distinctive empirical properties and a wealth of new models have emerged to capture them.

• Graph Algorithms: Practical Examples in Apache Spark and Neo4j

  This book is a practical guide to getting started with graph algorithms for developers and data scientists who have experience using Apache Spark or Neo4j. You'll walk through hands-on examples that show you how to use graph algorithms in Apache Spark/Neo4j.

• A Survey of Statistical Network Models (Anna Goldenberg, et al.)

  This book aims to provide the reader with an entry point to the voluminous literature on statistical network modeling. It guides the reader through the development of key stochastic network models, touches upon a number of examples and commonalities.

• Lecture Notes on Graph Theory (Tero Harju)

  These are introductory lecture notes on graph theory. It offers undergraduates a remarkably student-friendly introduction to graph theory and takes an engaging approach that emphasizes graph theory's history.

• Algorithmic Graph Theory (David Joyner, et al)

  This is an introductory book on algorithmic graph theory. Theory and algorithms are illustrated using the Sage open source mathematics software. It's especially suitable for computer scientists and mathematicians interested in computational complexity.

• Explorations in Algebraic Graph Theory (Chris Godsil, et al.)

  This book aims to express properties of graphs in algebraic terms, then to deduce theorems about them. It tackles the applications of linear algebra and matrix theory to the study of graphs; algebraic constructions such as adjacency matrix, using the Sage.

• An Introduction to Combinatorics and Graph Theory

  This book walks the reader through the classic parts of Combinatorics and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques.

• Graph Databases: New Opportunities for Connected Data

  This book provides a practical foundation for those who want to apply Graph Database to real-world business solutions. You'll learn why graph database are useful, where they're applicable, and how to design and implement solutions that use them.

• Advances in Graph Algorithms (Ton Kloks, et al.)

  This is a book about some currently popular topics such as exponential algorithms, fixed-parameter algorithms and algorithms using decomposition trees of graphs which is one of focuses of the book - occupied a whole chapter.