最大熵
计算机科学
图形
人工智能
节点(物理)
无监督学习
机器学习
竞争性学习
特征学习
理论计算机科学
计算机网络
结构工程
盲信号分离
频道(广播)
工程类
作者
Petar Veličković,William Fedus,William L. Hamilton,Píetro Lió,Yoshua Bengio,R Devon Hjelm
出处
期刊:Cornell University - arXiv
日期:2018-09-27
被引量:9
标识
DOI:10.48550/arxiv.1809.10341
摘要
We present Deep Graph Infomax (DGI), a general approach for learning node representations within graph-structured data in an unsupervised manner. DGI relies on maximizing mutual information between patch representations and corresponding high-level summaries of graphs---both derived using established graph convolutional network architectures. The learnt patch representations summarize subgraphs centered around nodes of interest, and can thus be reused for downstream node-wise learning tasks. In contrast to most prior approaches to unsupervised learning with GCNs, DGI does not rely on random walk objectives, and is readily applicable to both transductive and inductive learning setups. We demonstrate competitive performance on a variety of node classification benchmarks, which at times even exceeds the performance of supervised learning.
科研通智能强力驱动
Strongly Powered by AbleSci AI