Matthias Dehmer - Böcker

The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively. Incorporating interdisciplinary knowledge from graph theory, information theory, measurement theory, and statistical techniques, this book covers a wide range of quantitative-graph theoretical concepts and methods, including those pertaining to real and random graphs such as:Comparative approaches (graph similarity or distance)Graph measures to characterize graphs quantitativelyApplications of graph measures in social network analysis and other disciplinesMetrical properties of graphs and measuresMathematical properties of quantitative methods or measures in graph theoryNetwork complexity measures and other topological indicesQuantitative approaches to graphs using machine learning (e.g., clustering)Graph measures and statisticsInformation-theoretic methods to analyze graphs quantitatively (e.g., entropy)Through its broad coverage, Quantitative Graph Theory: Mathematical Foundations and Applications fills a gap in the contemporary literature of discrete and applied mathematics, computer science, systems biology, and related disciplines. It is intended for researchers as well as graduate and advanced undergraduate students in the fields of mathematics, computer science, mathematical chemistry, cheminformatics, physics, bioinformatics, and systems biology.

Entrepreneurial Complexity: Methods and Applications deals with theoretical and practical results of Entrepreneurial Sciences and Management (ESM), emphasising qualitative and quantitative methods. ESM has been a modern and exciting research field in which methods from various disciplines have been applied. However, the existing body of literature lacks the proper use of mathematical and formal models; individuals who perform research in this broad interdisciplinary area have been trained differently. In particular, they are not used to solving business-oriented problems mathematically. This book utilises formal techniques in ESM as an advantage for developing theories and models which are falsifiable. Features Discusses methods for defining and measuring complexity in entrepreneurial sciences Summarises new technologies and innovation-based techniques in entrepreneurial sciences Outlines new formal methods and complexity-models for entrepreneurship To date no book has been dedicated exclusively to use formal models in Entrepreneurial Sciences and Management

Modern and Interdisciplinary Problems in Network Science: A Translational Research Perspective covers a broad range of concepts and methods, with a strong emphasis on interdisciplinarity. The topics range from analyzing mathematical properties of network-based methods to applying them to application areas. By covering this broad range of topics, the book aims to fill a gap in the contemporary literature in disciplines such as physics, applied mathematics and information sciences.

Frontiers in Data Science deals with philosophical and practical results in Data Science. A broad definition of Data Science describes the process of analyzing data to transform data into insights. This also involves asking philosophical, legal and social questions in the context of data generation and analysis. In fact, Big Data also belongs to this universe as it comprises data gathering, data fusion and analysis when it comes to manage big data sets. A major goal of this book is to understand data science as a new scientific discipline rather than the practical aspects of data analysis alone.

This book covers both theoretical and practical results for graph polynomials. Graph polynomials have been developed for measuring combinatorial graph invariants and for characterizing graphs. Various problems in pure and applied graph theory or discrete mathematics can be treated and solved efficiently by using graph polynomials. Graph polynomials have been proven useful areas such as discrete mathematics, engineering, information sciences, mathematical chemistry and related disciplines.

Big Data of Complex Networks presents and explains the methods from the study of big data that can be used in analysing massive structural data sets, including both very large networks and sets of graphs. As well as applying statistical analysis techniques like sampling and bootstrapping in an interdisciplinary manner to produce novel techniques for analyzing massive amounts of data, this book also explores the possibilities offered by the special aspects such as computer memory in investigating large sets of complex networks.Intended for computer scientists, statisticians and mathematicians interested in the big data and networks, Big Data of Complex Networks is also a valuable tool for researchers in the fields of visualization, data analysis, computer vision and bioinformatics.Key features: Provides a complete discussion of both the hardware and software used to organize big data Describes a wide range of useful applications for managing big data and resultant data sets Maintains a firm focus on massive data and large networks Unveils innovative techniques to help readers handle big data Matthias Dehmer received his PhD in computer science from the Darmstadt University of Technology, Germany. Currently, he is Professor at UMIT – The Health and Life Sciences University, Austria, and the Universität der Bundeswehr München. His research interests are in graph theory, data science, complex networks, complexity, statistics and information theory.Frank Emmert-Streib received his PhD in theoretical physics from the University of Bremen, and is currently Associate professor at Tampere University of Technology, Finland. His research interests are in the field of computational biology, machine learning and network medicine.Stefan Pickl holds a PhD in mathematics from the Darmstadt University of Technology, and is currently a Professor at Bundeswehr Universität München. His research interests are in operations research, systems biology, graph theory and discrete optimization.Andreas Holzinger received his PhD in cognitive science from Graz University and his habilitation (second PhD) in computer science from Graz University of Technology. He is head of the Holzinger Group HCI-KDD at the Medical University Graz and Visiting Professor for Machine Learning in Health Informatics Vienna University of Technology.

"Information Theory and Statistical Learning" presents theoretical and practical results about information theoretic methods used in the context of statistical learning. The book will present a comprehensive overview of the large range of different methods that have been developed in a multitude of contexts. Each chapter is written by an expert in the field. The book is intended for an interdisciplinary readership working in machine learning, applied statistics, artificial intelligence, biostatistics, computational biology, bioinformatics, web mining or related disciplines.Advance Praise for "Information Theory and Statistical Learning":"A new epoch has arrived for information sciences to integrate various disciplines such as information theory, machine learning, statistical inference, data mining, model selection etc. I am enthusiastic about recommending the present book to researchers and students, because it summarizes most of these new emerging subjects and methods, which are otherwise scattered in many places." Shun-ichi Amari, RIKEN Brain Science Institute, Professor-Emeritus at the University of Tokyo

Explore the multidisciplinary nature of complex networks through machine learning techniquesStatistical and Machine Learning Approaches for Network Analysis provides an accessible framework for structurally analyzing graphs by bringing together known and novel approaches on graph classes and graph measures for classification. By providing different approaches based on experimental data, the book uniquely sets itself apart from the current literature by exploring the application of machine learning techniques to various types of complex networks.Comprised of chapters written by internationally renowned researchers in the field of interdisciplinary network theory, the book presents current and classical methods to analyze networks statistically. Methods from machine learning, data mining, and information theory are strongly emphasized throughout. Real data sets are used to showcase the discussed methods and topics, which include: A survey of computational approaches to reconstruct and partition biological networksAn introduction to complex networks—measures, statistical properties, and modelsModeling for evolving biological networksThe structure of an evolving random bipartite graphDensity-based enumeration in structured dataHyponym extraction employing a weighted graph kernelStatistical and Machine Learning Approaches for Network Analysis is an excellent supplemental text for graduate-level, cross-disciplinary courses in applied discrete mathematics, bioinformatics, pattern recognition, and computer science. The book is also a valuable reference for researchers and practitioners in the fields of applied discrete mathematics, machine learning, data mining, and biostatistics.

Entrepreneurial Complexity: Methods and Applications deals with theoretical and practical results of Entrepreneurial Sciences and Management (ESM), emphasising qualitative and quantitative methods. ESM has been a modern and exciting research field in which methods from various disciplines have been applied. However, the existing body of literature lacks the proper use of mathematical and formal models; individuals who perform research in this broad interdisciplinary area have been trained differently. In particular, they are not used to solving business-oriented problems mathematically. This book utilises formal techniques in ESM as an advantage for developing theories and models which are falsifiable. Features Discusses methods for defining and measuring complexity in entrepreneurial sciences Summarises new technologies and innovation-based techniques in entrepreneurial sciences Outlines new formal methods and complexity-models for entrepreneurship To date no book has been dedicated exclusively to use formal models in Entrepreneurial Sciences and Management

Modern and Interdisciplinary Problems in Network Science: A Translational Research Perspective covers a broad range of concepts and methods, with a strong emphasis on interdisciplinarity. The topics range from analyzing mathematical properties of network-based methods to applying them to application areas. By covering this broad range of topics, the book aims to fill a gap in the contemporary literature in disciplines such as physics, applied mathematics and information sciences.

Because of the increasing complexity and growth of real-world networks, their analysis by using classical graph-theoretic methods is oftentimes a difficult procedure. As a result, there is a strong need to combine graph-theoretic methods with mathematical techniques from other scientific disciplines, such as machine learning and information theory, in order to analyze complex networks more adequately.Filling a gap in literature, this self-contained book presents theoretical and application-oriented results to structurally explore complex networks. The work focuses not only on classical graph-theoretic methods, but also demonstrates the usefulness of structural graph theory as a tool for solving interdisciplinary problems. Special emphasis is given to methods related to: applications in biology, chemistry, linguistics, and data analysis; graph colorings; graph polynomials; information measures for graphs; metrical properties of graphs; partitions and decompositions; and quantitative graph measures.Structural Analysis of Complex Networks is suitable for a broad, interdisciplinary readership of researchers, practitioners, and graduate students in discrete mathematics, statistics, computer science, machine learning, artificial intelligence, computational and systems biology, cognitive science, computational linguistics, and mathematical chemistry. The book may be used as a supplementary textbook in graduate-level seminars on structural graph analysis, complex networks, or network-based machine learning methods.

For over a decade, complex networks have steadily grown as an important tool across a broad array of academic disciplines, with applications ranging from physics to social media. A  tightly organized collection of carefully-selected papers on the subject, Towards an Information Theory of Complex Networks: Statistical Methods and Applications presents theoretical and practical results about information-theoretic and statistical models of complex networks in the natural sciences and humanities. The book's major goal is to advocate and promote a combination of graph-theoretic, information-theoretic, and statistical methods as a way to better understand and characterize real-world networks. This volume is the first to present a self-contained, comprehensive overview of information-theoretic models of complex networks with an emphasis on applications. As such, it marks a first step toward establishing advanced statistical information theory as a unified theoretical basis of complex networks for all scientific disciplines and can serve as a valuable resource for a diverse audience of advanced students and professional scientists. While it is primarily intended as a reference for research, the book could also be a useful supplemental graduate text in courses related to information science, graph theory, machine learning, and computational biology, among others.

"Information Theory and Statistical Learning" presents theoretical and practical results about information theoretic methods used in the context of statistical learning. The book will present a comprehensive overview of the large range of different methods that have been developed in a multitude of contexts. Each chapter is written by an expert in the field. The book is intended for an interdisciplinary readership working in machine learning, applied statistics, artificial intelligence, biostatistics, computational biology, bioinformatics, web mining or related disciplines.Advance Praise for "Information Theory and Statistical Learning":"A new epoch has arrived for information sciences to integrate various disciplines such as information theory, machine learning, statistical inference, data mining, model selection etc. I am enthusiastic about recommending the present book to researchers and students, because it summarizes most of these new emerging subjects and methods, which are otherwise scattered in many places." Shun-ichi Amari, RIKEN Brain Science Institute, Professor-Emeritus at the University of Tokyo

The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively. Incorporating interdisciplinary knowledge from graph theory, information theory, measurement theory, and statistical techniques, this book covers a wide range of quantitative-graph theoretical concepts and methods, including those pertaining to real and random graphs such as:Comparative approaches (graph similarity or distance)Graph measures to characterize graphs quantitativelyApplications of graph measures in social network analysis and other disciplinesMetrical properties of graphs and measuresMathematical properties of quantitative methods or measures in graph theoryNetwork complexity measures and other topological indicesQuantitative approaches to graphs using machine learning (e.g., clustering)Graph measures and statisticsInformation-theoretic methods to analyze graphs quantitatively (e.g., entropy)Through its broad coverage, Quantitative Graph Theory: Mathematical Foundations and Applications fills a gap in the contemporary literature of discrete and applied mathematics, computer science, systems biology, and related disciplines. It is intended for researchers as well as graduate and advanced undergraduate students in the fields of mathematics, computer science, mathematical chemistry, cheminformatics, physics, bioinformatics, and systems biology.

Big Data of Complex Networks presents and explains the methods from the study of big data that can be used in analysing massive structural data sets, including both very large networks and sets of graphs. As well as applying statistical analysis techniques like sampling and bootstrapping in an interdisciplinary manner to produce novel techniques for analyzing massive amounts of data, this book also explores the possibilities offered by the special aspects such as computer memory in investigating large sets of complex networks.Intended for computer scientists, statisticians and mathematicians interested in the big data and networks, Big Data of Complex Networks is also a valuable tool for researchers in the fields of visualization, data analysis, computer vision and bioinformatics.Key features: Provides a complete discussion of both the hardware and software used to organize big data Describes a wide range of useful applications for managing big data and resultant data sets Maintains a firm focus on massive data and large networks Unveils innovative techniques to help readers handle big dataMatthias Dehmer received his PhD in computer science from the Darmstadt University of Technology, Germany. Currently, he is Professor at UMIT – The Health and Life Sciences University, Austria, and the Universität der Bundeswehr München. His research interests are in graph theory, data science, complex networks, complexity, statistics and information theory.Frank Emmert-Streib received his PhD in theoretical physics from the University of Bremen, and is currently Associate professor at Tampere University of Technology, Finland. His research interests are in the field of computational biology, machine learning and network medicine.Stefan Pickl holds a PhD in mathematics from the Darmstadt University of Technology, and is currently a Professor at Bundeswehr Universität München. His research interests are in operations research, systems biology, graph theory and discrete optimization.Andreas Holzinger received his PhD in cognitive science from Graz University and his habilitation (second PhD) in computer science from Graz University of Technology. He is head of the Holzinger Group HCI-KDD at the Medical University Graz and Visiting Professor for Machine Learning in Health Informatics Vienna University of Technology.

This book covers both theoretical and practical results for graph polynomials. Graph polynomials have been developed for measuring combinatorial graph invariants and for characterizing graphs. Various problems in pure and applied graph theory or discrete mathematics can be treated and solved efficiently by using graph polynomials. Graph polynomials have been proven useful areas such as discrete mathematics, engineering, information sciences, mathematical chemistry and related disciplines.

Frontiers in Data Science deals with philosophical and practical results in Data Science. A broad definition of Data Science describes the process of analyzing data to transform data into insights. This also involves asking philosophical, legal and social questions in the context of data generation and analysis. In fact, Big Data also belongs to this universe as it comprises data gathering, data fusion and analysis when it comes to manage big data sets. A major goal of this book is to understand data science as a new scientific discipline rather than the practical aspects of data analysis alone.

The textbook provides students with tools they need to analyze complex data using methods from data science, machine learning and artificial intelligence. The authors include both the presentation of methods along with applications using the programming language R, which is the gold standard for analyzing data.

The textbook provides students with tools they need to analyze complex data using methods from data science, machine learning and artificial intelligence. The authors include both the presentation of methods along with applications using the programming language R, which is the gold standard for analyzing data.

The aim of the book is to help students become data scientists. Since this requires a series of courses over a considerable period of time, the book intends to accompany students from the beginning to an advanced understanding of the knowledge and skills that define a modern data scientist. The book presents a comprehensive overview of the mathematical foundations of the programming language R and of its applications to data science.

Mathematical problems such as graph theory problems are of increasing importance for the analysis of modelling data in biomedical research such as in systems biology, neuronal network modelling etc. This book follows a new approach of including graph theory from a mathematical perspective with specific applications of graph theory in biomedical and computational sciences. The book is written by renowned experts in the field and offers valuable background information for a wide audience.

This handbook and ready reference presents a combination of statistical, information-theoretic, and data analysis methods to meet the challenge of designing empirical models involving molecular descriptors within bioinformatics. The topics range from investigating information processing in chemical and biological networks to studying statistical and information-theoretic techniques for analyzing chemical structures to employing data analysis and machine learning techniques for QSAR/QSPR.The high-profile international author and editor team ensures excellent coverage of the topic, making this a must-have for everyone working in chemoinformatics and structure-oriented drug design.

This comprehensive introduction to computational network theory as a branch of network theory builds on the understanding that such networks are a tool to derive or verify hypotheses by applying computational techniques to large scale network data.The highly experienced team of editors and high-profile authors from around the world present and explain a number of methods that are representative of computational network theory, derived from graph theory, as well as computational and statistical techniques. With its coherent structure and homogenous style, this reference is equally suitable for courses on computational networks.

This latest addition to the successful Network Biology series presents current methods for determining the entropy of networks, making it the first to cover the recently established Quantitative Graph Theory.An excellent international team of editors and contributors provides an up-to-date outlook for the field, covering a broad range of graph entropy-related concepts and methods. The topics range from analyzing mathematical properties of methods right up to applying them in real-life areas. Filling a gap in the contemporary literature this is an invaluable reference for a number of disciplines, including mathematicians, computer scientists, computational biologists, and structural chemists.