Machine Learning In Complex Networks

This book presents the features and advantages offered by complex networks in the machine learning domain. In the first part, an overview on complex networks and network-based machine learning is presented, offering necessary background material. In the second part, we describe in details some specific techniques based on complex networks for supervised, non-supervised, and semi-supervised learning. Particularly, a stochastic particle competition technique for both non-supervised and semi-supervised learning using a stochastic nonlinear dynamical system is described in details. Moreover, an analytical analysis is supplied, which enables one to predict the behavior of the proposed technique. In addition, data reliability issues are explored in semi-supervised learning. Such matter has practical importance and is not often found in the literature. With the goal of validating these techniques for solving real problems, simulations on broadly accepted databases are conducted. Still in this book, we present a hybrid supervised classification technique that combines both low and high orders of learning. The low level term can be implemented by any classification technique, while the high level term is realized by the extraction of features of the underlying network constructed from the input data. Thus, the former classifies the test instances by their physical features, while the latter measures the compliance of the test instances with the pattern formation of the data. We show that the high level technique can realize classification according to the semantic meaning of the data. This book intends to combine two widely studied research areas, machine learning and complex networks, which in turn will generate broad interests to scientific community, mainly to computer science and engineering areas.

This book bridges the gap between advances in the communities of computer science and physics--namely machine learning and statistical physics. It contains diverse but relevant topics in statistical physics, complex systems, network theory, and machine learning. Examples of such topics are: predicting missing links, higher-order generative modeling of networks, inferring network structure by tracking the evolution and dynamics of digital traces, recommender systems, and diffusion processes. The book contains extended versions of high-quality submissions received at the workshop, Dynamics On and Of Complex Networks (doocn.org), together with new invited contributions. The chapters will benefit a diverse community of researchers. The book is suitable for graduate students, postdoctoral researchers and professors of various disciplines including sociology, physics, mathematics, and computer science.

This book concentrates on mining networks, a subfield within data science. Data science uses scientific and computational tools to extract valuable knowledge from large data sets. Once data is processed and cleaned, it is analyzed and presented to support decision-making processes. Data science and machine learning tools have become widely used in companies of all sizes. Networks are often large-scale, decentralized, and evolve dynamically over time. Mining complex networks aim to understand the principles governing the organization and the behavior of such networks is crucial for a broad range of fields of study. Here are a few selected typical applications of mining networks: Community detection (which users on some social media platforms are close friends). Link prediction (who is likely to connect to whom on such platforms). Node attribute prediction (what advertisement should be shown to a given user of a particular platform to match their interests). Influential node detection (which social media users would be the best ambassadors of a specific product). This textbook is suitable for an upper-year undergraduate course or a graduate course in programs such as data science, mathematics, computer science, business, engineering, physics, statistics, and social science. This book can be successfully used by all enthusiasts of data science at various levels of sophistication to expand their knowledge or consider changing their career path. Jupiter notebooks (in Python and Julia) accompany the book and can be accessed on https://www.ryerson.ca/mining-complex-networks/. These not only contain all the experiments presented in the book, but also include additional material. Bogumił Kamiński is the Chairman of the Scientific Council for the Discipline of Economics and Finance at SGH Warsaw School of Economics. He is also an Adjunct Professor at the Data Science Laboratory at Ryerson University. Bogumił is an expert in applications of mathematical modeling to solving complex real-life problems. He is also a substantial open-source contributor to the development of the Julia language and its package ecosystem. Paweł Prałat is a Professor of Mathematics in Ryerson University, whose main research interests are in random graph theory, especially in modeling and mining complex networks. He is the Director of Fields-CQAM Lab on Computational Methods in Industrial Mathematics in The Fields Institute for Research in Mathematical Sciences and has pursued collaborations with various industry partners as well as the Government of Canada. He has written over 170 papers and three books with 130 plus collaborators. François Théberge holds a B.Sc. degree in applied mathematics from the University of Ottawa, a M.Sc. in telecommunications from INRS and a PhD in electrical engineering from McGill University. He has been employed by the Government of Canada since 1996 where he was involved in the creation of the data science team as well as the research group now known as the Tutte Institute for Mathematics and Computing. He also holds an adjunct professorial position in the Department of Mathematics and Statistics at the University of Ottawa. His current interests include relational-data mining and deep learning.

This book deals with network representation learning. It deals with embedding nodes, edges, subgraphs and graphs. There is a growing interest in understanding complex systems in different domains including health, education, agriculture and transportation. Such complex systems are analyzed by modeling, using networks that are aptly called complex networks. Networks are becoming ubiquitous as they can represent many real-world relational data, for instance, information networks, molecular structures, telecommunication networks and protein–protein interaction networks. Analysis of these networks provides advantages in many fields such as recommendation (recommending friends in a social network), biological field (deducing connections between proteins for treating new diseases) and community detection (grouping users of a social network according to their interests) by leveraging the latent information of networks. An active and important area of current interest is to come out with algorithms that learn features by embedding nodes or (sub)graphs into a vector space. These tasks come under the broad umbrella of representation learning. A representation learning model learns a mapping function that transforms the graphs' structure information to a low-/high-dimension vector space maintaining all the relevant properties.

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.

Explore the multidisciplinary nature of complex networks through machine learning techniques Statistical 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 networks An introduction to complex networks—measures, statistical properties, and models Modeling for evolving biological networks The structure of an evolving random bipartite graph Density-based enumeration in structured data Hyponym extraction employing a weighted graph kernel Statistical 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.

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.

This book deals with network representation learning. It deals with embedding nodes, edges, subgraphs and graphs. There is a growing interest in understanding complex systems in different domains including health, education, agriculture and transportation. Such complex systems are analyzed by modeling, using networks that are aptly called complex networks. Networks are becoming ubiquitous as they can represent many real-world relational data, for instance, information networks, molecular structures, telecommunication networks and protein-protein interaction networks. Analysis of these networks provides advantages in many fields such as recommendation (recommending friends in a social network), biological field (deducing connections between proteins for treating new diseases) and community detection (grouping users of a social network according to their interests) by leveraging the latent information of networks. An active and important area of current interest is to come out with algorithms that learn features by embedding nodes or (sub)graphs into a vector space. These tasks come under the broad umbrella of representation learning. A representation learning model learns a mapping function that transforms the graphs' structure information to a low-/high-dimension vector space maintaining all the relevant properties. .