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.

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.

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

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 Universitat der Bundeswehr Munchen. 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 Universitat Munchen. 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.

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.

"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

Filling a gap in literature, this self-contained book presents theoretical and application-oriented results that allow for a structural exploration of 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. Applications to biology, chemistry, linguistics, and data analysis are emphasized.

The book 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. It may also be used as a supplementary textbook in graduate-level seminars on structural graph analysis, complex networks, or network-based machine learning methods.

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.

"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 quantitatively Applications of graph measures in social network analysis and other disciplines Metrical properties of graphs and measures Mathematical properties of quantitative methods or measures in graph theory Network complexity measures and other topological indices Quantitative approaches to graphs using machine learning (e.g., clustering) Graph measures and statistics Information-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.

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.

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.

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

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 Universitat der Bundeswehr Munchen. 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 Universitat Munchen. 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.

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 quantitatively Applications of graph measures in social network analysis and other disciplines Metrical properties of graphs and measures Mathematical properties of quantitative methods or measures in graph theory Network complexity measures and other topological indices Quantitative approaches to graphs using machine learning (e.g., clustering) Graph measures and statistics Information-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.

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 authors cover all three main components of data science: computer science; mathematics and statistics; and domain knowledge. The book presents methods and implementations in R side-by-side, allowing the immediate practical application of the learning concepts. Furthermore, this teaches computational thinking in a natural way. The book includes exercises, case studies, Q&A and examples.

Matthias Dehmer ruckt das Web Structure Mining, insbesondere die strukturelle Analyse Web-basierter Hypertexte auf Grundlage gerichteter Graphen, in den Mittelpunkt seiner Untersuchung. Der Autor stellt ein graphentheoretisches Modell zur Bestimmung der strukturellen Ahnlichkeit einer Klasse von gerichteten Graphen vor. Auf Basis des angesprochenen Modells fuhrt er Experimente mit bestehenden Hypertexten durch und beschreibt neuartige Anwendungen im Web Structure Mining und in anderen Gebieten.

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.