| 000 | 00000nam u2200205 c 4500 | |
| 001 | 000046168772 | |
| 005 | 20251121124907 | |
| 008 | 240109s2022 sz a b 000 0 eng | |
| 020 | ▼a 9783031004605 (pbk.) | |
| 020 | ▼z 9783031015885 (ebook) | |
| 020 | ▼z 9783031000331 (hbk.) | |
| 040 | ▼a 211009 ▼c 211009 ▼d 211009 ▼d 244002 | |
| 082 | 0 4 | ▼a 006.3/1 ▼2 23 |
| 084 | ▼a 006.31 ▼2 DDCK | |
| 090 | ▼a 006.31 ▼b H222g | |
| 100 | 1 | ▼a Hamilton, William L. |
| 245 | 1 0 | ▼a Graph representation learning / ▼c William L. Hamilton. |
| 260 | ▼a Switzerland : ▼b Springer, ▼c 2022. | |
| 300 | ▼a xvii, 141 p. : ▼b ill. (some col.) ; ▼c 24 cm. | |
| 490 | 1 | ▼a Synthesis lectures on artificial intelligence and machine learning ; ▼v 46 |
| 500 | ▼a Reprint of original ed. published by Morgan and Claypool, 2020. | |
| 504 | ▼a Includes bibliographical references (p. 131-140). | |
| 650 | 0 | ▼a Machine learning. |
| 650 | 0 | ▼a Neural networks (Computer science). |
| 650 | 0 | ▼a Graph theory ▼x Data processing. |
| 830 | 0 | ▼a Synthesis lectures on artificial intelligence and machine learning; ▼v 46. |
소장정보
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 과학도서관/Sci-Info/지정도서 | 청구기호 006.31 H222g | 등록번호 121270718 | 도서상태 대출불가(서가) | 반납예정일 | 예약 | 서비스 |
| No. 2 | 소장처 세종학술정보원/과학기술실(5층)/ | 청구기호 511.5 H222g | 등록번호 151365957 (2회 대출) | 도서상태 대출중 | 반납예정일 2026-04-18 | 예약 예약가능 | 서비스 |
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 과학도서관/Sci-Info/지정도서 | 청구기호 006.31 H222g | 등록번호 121270718 | 도서상태 대출불가(서가) | 반납예정일 | 예약 | 서비스 |
| No. | 소장처 | 청구기호 | 등록번호 | 도서상태 | 반납예정일 | 예약 | 서비스 |
|---|---|---|---|---|---|---|---|
| No. 1 | 소장처 세종학술정보원/과학기술실(5층)/ | 청구기호 511.5 H222g | 등록번호 151365957 (2회 대출) | 도서상태 대출중 | 반납예정일 2026-04-18 | 예약 예약가능 | 서비스 |
컨텐츠정보
책소개
Graph-structured data is ubiquitous throughout the natural and social sciences, from telecommunication networks to quantum chemistry. Building relational inductive biases into deep learning architectures is crucial for creating systems that can learn, reason, and generalize from this kind of data. Recent years have seen a surge in research on graph representation learning, including techniques for deep graph embeddings, generalizations of convolutional neural networks to graph-structured data, and neural message-passing approaches inspired by belief propagation. These advances in graph representation learning have led to new state-of-the-art results in numerous domains, including chemical synthesis, 3D vision, recommender systems, question answering, and social network analysis.
This book provides a synthesis and overview of graph representation learning. It begins with a discussion of the goals of graph representation learning as well as key methodological foundations in graph theory and network analysis. Following this, the book introduces and reviews methods for learning node embeddings, including random-walk-based methods and applications to knowledge graphs. It then provides a technical synthesis and introduction to the highly successful graph neural network (GNN) formalism, which has become a dominant and fast-growing paradigm for deep learning with graph data. The book concludes with a synthesis of recent advancements in deep generative models for graphs—a nascent but quickly growing subset of graph representation learning.
정보제공 :
목차
Preface.- Acknowledgments.- Introduction.- Background and Traditional Approaches.- Neighborhood Reconstruction Methods.- Multi-Relational Data and Knowledge Graphs.- The Graph Neural Network Model.- Graph Neural Networks in Practice.- Theoretical Motivations.- Traditional Graph Generation Approaches.- Deep Generative Models.- Conclusion.- Bibliography.- Author's Biography .
정보제공 :
