"Can Graph Neural Networks Go Deeper Without Over-Smoothing? Yes, With a ..."

Kushal Bose, Swagatam Das (2023)

> Home

Details and statistics

DOI: 10.1109/TETCI.2023.3249255

access: closed

type: Journal Article

metadata version: 2023-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tetci/BoseD23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tetci/BoseD23
Kushal Bose, Swagatam Das:
Can Graph Neural Networks Go Deeper Without Over-Smoothing? Yes, With a Randomized Path Exploration! IEEE Trans. Emerg. Top. Comput. Intell. 7(5): 1595-1604 (2023)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.