Weisfeiler and Leman go sparse Towards scalable higher-order graph embeddings

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

Weisfeiler and Leman go sparse: Towards scalable
       higher-order graph embeddings

       Christopher Morris         Gaurav Rattan        Petra Mutzel

                        Abstract
      Graph kernels based on the 1-dimensional Weisfeiler-Leman algorithm and corre-
      sponding neural architectures recently emerged as powerful tools for (supervised)
      learning with graphs. However, due to the purely local nature of the algorithms, they
      might miss essential patterns in the  ...

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏0 回帖

关键词：embeddings Embedding Towards Toward owards