Xiao Wang

Cheng Yang

Chuan Shi

This book provides a comprehensive introduction to the foundations and frontiers of graph neural networks. In addition, the book introduces the basic concepts and definitions in graph representation learning and discusses the development of advanced graph representation learning methods with a focus on graph neural networks. The book providers researchers and practitioners with an understanding of the fundamental issues as well as a launch point for discussing the latest trends in the science. The authors emphasize several frontier aspects of graph neural networks and utilize graph data to describe pairwise relations for real-world data from many different domains, including social science, chemistry, and biology. Several frontiers of graph neural networks are introduced, which enable readers to acquire the needed techniques of advances in graph neural networks via theoretical models and real-world applications.

Advances in Graph Neural Networks

Philip S. Yu

Representation learning in heterogeneous graphs (HG) is intended to provide a meaningful vector representation for each node so as to facilitate downstream applications such as link prediction, personalized recommendation, node classification, etc. This task, however, is challenging not only because of the need to incorporate heterogeneous structural (graph) information consisting of multiple types of node and edge, but also the need to consider heterogeneous attributes or types of content (e.g. text or image) associated with each node. Although considerable advances have been made in homogeneous (and heterogeneous) graph embedding, attributed graph embedding and graph neural networks, few are capable of simultaneously and effectively taking into account heterogeneous structural (graph) information as well as the heterogeneous content information of each node. In this book, we provide a comprehensive survey of current developments in HG representation learning. More importantly, we present the state-of-the-art in this field, including theoretical models and real applications that have been showcased at the top conferences and journals, such as TKDE, KDD, WWW, IJCAI and AAAI. The book has two major objectives: (1) to provide researchers with an understanding of the fundamental issues and a good point of departure for working in this rapidly expanding field, and (2) to present the latest research on applying heterogeneous graphs to model real systems and learning structural features of interaction systems. To the best of our knowledge, it is the first book to summarize the latest developments and present cutting-edge research on heterogeneous graph representation learning. To gain the most from it, readers should have a basic grasp of computer science, data mining and machine learning.

Heterogeneous Graph Representation Learning and Applications

This book offers researchers an understanding of the fundamental issues and a good starting point to work on this rapidly expanding field. It provides a comprehensive survey of current developments of heterogeneous information network. It also presents the newest research in applications of heterogeneous information networks to similarity search, ranking, clustering, recommendation. This information will help researchers to understand how to analyze networked data with heterogeneous information networks. Common data mining tasks are explored, including similarity search, ranking, and recommendation. The book illustrates some prototypes which analyze networked data. Professionals and academics working in data analytics, networks, machine learning, and data mining will find this content valuable. It is also suitable for advanced-level students in computer science who are interested in networking or pattern recognition.

Heterogeneous Information Network Analysis and Applications

Maosong Sun

Zhiyuan Liu

Cunchao Tu

Many machine learning algorithms require real-valued feature vectors of data instances as inputs. By projecting data into vector spaces, representation learning techniques have achieved promising performance in many areas such as computer vision and natural language processing. There is also a need to learn representations for discrete relational data, namely networks or graphs. Network Embedding (NE) aims at learning vector representations for each node or vertex in a network to encode the topologic structure. Due to its convincing performance and efficiency, NE has been widely applied in many network applications such as node classification and link prediction. This book provides a comprehensive introduction to the basic concepts, models, and applications of network representation learning (NRL). The book starts with an introduction to the background and rising of network embeddings as a general overview for readers. Then it introduces the development of NE techniques by presenting several representative methods on general graphs, as well as a unified NE framework based on matrix factorization. Afterward, it presents the variants of NE with additional information: NE for graphs with node attributes/contents/labels; and the variants with different characteristics: NE for community-structured/large-scale/heterogeneous graphs. Further, the book introduces different applications of NE such as recommendation and information diffusion prediction. Finally, the book concludes the methods and applications and looks forward to the future directions.

Chuan Shi

About

Books

Join the club