方法对比

	图神经网络	卷积神经网络图像分类	随机森林	支持向量机（分类）
领域	深度学习	深度学习	机器学习	机器学习
方法族	Machine learning	Machine learning	Machine learning	Machine learning
起源年份	2017	2016	2001	1995
提出者	Kipf, T.N. & Welling, M.	He, K. et al. (ResNet); Tan, M. & Le, Q.V. (EfficientNet)	Breiman, L.	Cortes, C. & Vapnik, V.
类型	Deep learning on graph-structured data	Deep convolutional neural network (supervised)	Ensemble (bagging of decision trees)	Maximum-margin classifier (kernel method)
开创性文献	Kipf, T.N. & Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional Networks. ICLR.	He, K., Zhang, X., Ren, S. & Sun, J. (2016). Deep Residual Learning for Image Recognition. CVPR.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.	Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297.
别名	Grafik Sinir Ağı (GNN), GNN, graph neural net, graph convolutional network	CNN — Görüntü Sınıflandırma (ResNet / VGG / EfficientNet), convolutional neural network image classifier, deep image classification, ResNet / VGG / EfficientNet	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble	Destek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier
相关	4	5	4	5
摘要	A Graph Neural Network (GNN) is a deep learning method, popularised by Kipf and Welling in 2017 with the Graph Convolutional Network, that learns from the relationships in network (graph) structures made of nodes and edges. It is designed for data that is naturally relational, such as social networks, molecular structures, and recommendation systems.	CNN image classification uses deep convolutional architectures such as ResNet (He et al., 2016), VGG and EfficientNet (Tan & Le, 2019) to sort images into categories. Stacked convolutional layers learn a hierarchy of visual features directly from pixels, and skip (residual) connections prevent the vanishing-gradient problem in very deep networks.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.	The Support Vector Machine, introduced by Corinna Cortes and Vladimir Vapnik in 1995, is a classifier that finds the optimal separating hyperplane between classes in a high-dimensional space. It chooses the boundary that leaves the widest possible margin to the nearest training points, which makes its decisions robust on new data.